Index: /stable/HeuristicLab.ExtLibs.sln
===================================================================
--- /stable/HeuristicLab.ExtLibs.sln	(revision 15129)
+++ /stable/HeuristicLab.ExtLibs.sln	(revision 15130)
@@ -72,4 +72,6 @@
 EndProject
 Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "HeuristicLab.MathJax-2.6.1", "HeuristicLab.ExtLibs\HeuristicLab.MathJax\2.6.1\HeuristicLab.MathJax-2.6.1\HeuristicLab.MathJax-2.6.1.csproj", "{BCDA17A6-5B4A-495C-B182-E856CA081BE6}"
+EndProject
+Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "HeuristicLab.IGraph-0.8.0-pre", "HeuristicLab.ExtLibs\HeuristicLab.Igraph\0.8.0-pre\HeuristicLab.Igraph-0.8.0-pre\HeuristicLab.IGraph-0.8.0-pre.csproj", "{088D34F2-32EA-43FF-BAA8-22428D5B66BE}"
 EndProject
 Global
@@ -467,4 +469,12 @@
 		{BCDA17A6-5B4A-495C-B182-E856CA081BE6}.Release|x86.ActiveCfg = Release|x86
 		{BCDA17A6-5B4A-495C-B182-E856CA081BE6}.Release|x86.Build.0 = Release|x86
+		{088D34F2-32EA-43FF-BAA8-22428D5B66BE}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
+		{088D34F2-32EA-43FF-BAA8-22428D5B66BE}.Debug|Any CPU.Build.0 = Debug|Any CPU
+		{088D34F2-32EA-43FF-BAA8-22428D5B66BE}.Debug|x64.ActiveCfg = Debug|Any CPU
+		{088D34F2-32EA-43FF-BAA8-22428D5B66BE}.Debug|x86.ActiveCfg = Debug|Any CPU
+		{088D34F2-32EA-43FF-BAA8-22428D5B66BE}.Release|Any CPU.ActiveCfg = Release|Any CPU
+		{088D34F2-32EA-43FF-BAA8-22428D5B66BE}.Release|Any CPU.Build.0 = Release|Any CPU
+		{088D34F2-32EA-43FF-BAA8-22428D5B66BE}.Release|x64.ActiveCfg = Release|Any CPU
+		{088D34F2-32EA-43FF-BAA8-22428D5B66BE}.Release|x86.ActiveCfg = Release|Any CPU
 	EndGlobalSection
 	GlobalSection(SolutionProperties) = preSolution
Index: /stable/HeuristicLab.ExtLibs/HeuristicLab.Igraph/0.8.0-pre/HeuristicLab.Igraph-0.8.0-pre/Datatypes.cs
===================================================================
--- /stable/HeuristicLab.ExtLibs/HeuristicLab.Igraph/0.8.0-pre/HeuristicLab.Igraph-0.8.0-pre/Datatypes.cs	(revision 15130)
+++ /stable/HeuristicLab.ExtLibs/HeuristicLab.Igraph/0.8.0-pre/HeuristicLab.Igraph-0.8.0-pre/Datatypes.cs	(revision 15130)
@@ -0,0 +1,156 @@
+﻿#region License Information
+/* HeuristicLab
+ * Copyright (C) 2002-2016 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
+ *
+ * This file is part of HeuristicLab.
+ *
+ * HeuristicLab 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.
+ *
+ * HeuristicLab 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 HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
+ */
+#endregion
+
+using System;
+using System.Runtime.InteropServices;
+
+namespace HeuristicLab.IGraph {
+  #region Structs
+  [StructLayout(LayoutKind.Sequential, CharSet = CharSet.Ansi)]
+  internal class igraph_rng_type_t {
+    IntPtr name;
+    internal uint min;
+    internal uint max;
+  };
+
+  [StructLayout(LayoutKind.Sequential, CharSet = CharSet.Ansi)]
+  internal class igraph_rng_t {
+    IntPtr type;
+    IntPtr state;
+    internal int def;
+  };
+
+
+  [StructLayout(LayoutKind.Sequential, CharSet = CharSet.Ansi)]
+  internal class igraph_vector_t {
+    IntPtr stor_begin;
+    IntPtr stor_end;
+    IntPtr end;
+  };
+
+  [StructLayout(LayoutKind.Sequential, CharSet = CharSet.Ansi)]
+  internal class igraph_matrix_t {
+    internal igraph_vector_t data = new igraph_vector_t();
+    internal int nrow;
+    internal int ncol;
+  };
+
+  [StructLayout(LayoutKind.Sequential, CharSet = CharSet.Ansi)]
+  internal class igraph_t {
+    internal int n;
+    internal bool directed;
+    igraph_vector_t from = new igraph_vector_t();
+    igraph_vector_t to = new igraph_vector_t();
+    igraph_vector_t oi = new igraph_vector_t();
+    igraph_vector_t ii = new igraph_vector_t();
+    igraph_vector_t os = new igraph_vector_t();
+    igraph_vector_t @is = new igraph_vector_t();
+    IntPtr attr;
+  };
+
+  [StructLayout(LayoutKind.Explicit, CharSet = CharSet.Ansi)]
+  internal struct igraph_vs_t {
+    [FieldOffset(0)]
+    internal int type;
+    [FieldOffset(4)]
+    int vid;
+    [FieldOffset(4)]
+    IntPtr vecptr;
+    [FieldOffset(4)]
+    int adj_vid;
+    [FieldOffset(8)]
+    igraph_neimode_t adj_mode;
+    [FieldOffset(4)]
+    int seq_from;
+    [FieldOffset(8)]
+    int seq_to;
+  }
+
+  [StructLayout(LayoutKind.Sequential, CharSet = CharSet.Ansi)]
+  unsafe internal struct igraph_arpack_options_t {
+    /* INPUT */
+    internal fixed char bmat[1]; /* I-standard problem, G-generalized */
+    internal int n; /* Dimension of the eigenproblem */
+    internal fixed char which[2]; /* LA, SA, LM, SM, BE */
+    internal int nev; /* Number of eigenvalues to be computed */
+    internal double tol; /* Stopping criterion */
+    internal int ncv; /* Number of columns in V */
+    internal int ldv; /* Leading dimension of V */
+    internal int ishift; /* 0-reverse comm., 1-exact with tridiagonal */
+    internal int mxiter; /* Maximum number of update iterations to take */
+    internal int nb; /* Block size on the recurrence, only 1 works */
+    internal int mode; /* The kind of problem to be solved (1-5)
+                          1: A*x=l*x, A symmetric
+                          2: A*x=l*M*x, A symm. M pos. def.
+                          3: K*x = l*M*x, K symm., M pos. semidef.
+                          4: K*x = l*KG*x, K s. pos. semidef. KG s. indef.
+                          5: A*x = l*M*x, A symm., M symm. pos. semidef. */
+    internal int start; /* 0: random, 1: use the supplied vector */
+    internal int lworkl; /* Size of temporary storage, default is fine */
+    internal double sigma; /* The shift for modes 3,4,5 */
+    internal double sigmai; /* The imaginary part of shift for rnsolve */
+    /* OUTPUT */
+    internal int info; /* What happened, see docs */
+    internal int ierr; /* What happened  in the dseupd call */
+    internal int noiter; /* The number of iterations taken */
+    internal int nconv;
+    internal int numop; /* Number of OP*x operations */
+    internal int numopb; /* Number of B*x operations if BMAT='G' */
+    internal int numreo; /* Number of steps of re-orthogonalizations */
+    /* INTERNAL */
+    internal fixed int iparam[11];
+    internal fixed int ipntr[14];
+  }
+
+  [StructLayout(LayoutKind.Sequential, CharSet = CharSet.Ansi)]
+  internal struct igraph_pagerank_power_options_t {
+    internal int niter;
+    internal double eps;
+  }
+  #endregion
+
+  #region Delegates
+  [UnmanagedFunctionPointer(CallingConvention.Cdecl, CharSet = CharSet.Ansi)]
+  internal delegate bool igraph_bfshandler_t(igraph_t graph, int vid, int pred, int succ, int rank, int dist, IntPtr extra);
+
+  [UnmanagedFunctionPointer(CallingConvention.Cdecl, CharSet = CharSet.Ansi)]
+  internal delegate bool igraph_dfshandler_t(igraph_t graph, int vid, int dist, IntPtr extra);
+  #endregion
+
+  #region Enums
+  internal enum igraph_layout_grid_t {
+    IGRAPH_LAYOUT_GRID,
+    IGRAPH_LAYOUT_NOGRID,
+    IGRAPH_LAYOUT_AUTOGRID
+  };
+  internal enum igraph_pagerank_algo_t {
+    IGRAPH_PAGERANK_ALGO_POWER = 0,
+    IGRAPH_PAGERANK_ALGO_ARPACK = 1,
+    IGRAPH_PAGERANK_ALGO_PRPACK = 2
+  }
+  internal enum igraph_neimode_t {
+    IGRAPH_OUT = 1,
+    IGRAPH_IN = 2,
+    IGRAPH_ALL = 3,
+    IGRAPH_TOTAL = 3
+  }
+  #endregion
+}
Index: /stable/HeuristicLab.ExtLibs/HeuristicLab.Igraph/0.8.0-pre/HeuristicLab.Igraph-0.8.0-pre/DllImporter.cs
===================================================================
--- /stable/HeuristicLab.ExtLibs/HeuristicLab.Igraph/0.8.0-pre/HeuristicLab.Igraph-0.8.0-pre/DllImporter.cs	(revision 15130)
+++ /stable/HeuristicLab.ExtLibs/HeuristicLab.Igraph/0.8.0-pre/HeuristicLab.Igraph-0.8.0-pre/DllImporter.cs	(revision 15130)
@@ -0,0 +1,447 @@
+﻿#region License Information
+/* HeuristicLab
+ * Copyright (C) 2002-2016 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
+ *
+ * This file is part of HeuristicLab.
+ *
+ * HeuristicLab 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.
+ *
+ * HeuristicLab 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 HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
+ */
+#endregion
+
+using System;
+using System.Runtime.InteropServices;
+
+namespace HeuristicLab.IGraph {
+  internal static class DllImporter {
+    private const string X86Dll = "igraph-0.8.0-pre-x86.dll";
+    private const string X64Dll = "igraph-0.8.0-pre-x64.dll";
+    private readonly static bool X86 = false;
+
+    static DllImporter() {
+      X86 = !Environment.Is64BitProcess;
+    }
+
+    #region igraph
+    #region igraph init/finalize
+    internal static void igraph_empty(igraph_t graph, int n, bool directed) {
+      if (X86) igraph_empty_x86(graph, n, directed);
+      else igraph_empty_x64(graph, n, directed);
+    }
+    internal static int igraph_destroy(igraph_t graph) {
+      return X86 ? igraph_destroy_x86(graph) : igraph_destroy_x64(graph);
+    }
+    #endregion
+
+    #region igraph query
+    internal static int igraph_vcount(igraph_t graph) {
+      return X86 ? igraph_vcount_x86(graph) : igraph_vcount_x64(graph);
+    }
+    #endregion
+
+    #region igraph characteristics
+    internal static int igraph_density(igraph_t graph, out double density, bool loops) {
+      density = double.NaN;
+      return X86 ? igraph_density_x86(graph, ref density, loops) : igraph_density_x64(graph, ref density, loops);
+    }
+
+    internal static int igraph_pagerank(igraph_t graph, igraph_pagerank_algo_t algo, igraph_vector_t vector, out double value, igraph_vs_t vids, bool directed, double damping, igraph_vector_t weights) {
+      value = 1;
+      var options = IntPtr.Zero;
+      if (algo == igraph_pagerank_algo_t.IGRAPH_PAGERANK_ALGO_ARPACK) {
+        var arpackoptions = GetDefaultArpackOptions();
+        options = Marshal.AllocHGlobal(Marshal.SizeOf(typeof(igraph_arpack_options_t)));
+        Marshal.StructureToPtr(arpackoptions, options, false);
+      } else if (algo == igraph_pagerank_algo_t.IGRAPH_PAGERANK_ALGO_POWER) {
+        var poweroptions = GetDefaultPowerOptions();
+        options = Marshal.AllocHGlobal(Marshal.SizeOf(typeof(igraph_pagerank_power_options_t)));
+        Marshal.StructureToPtr(poweroptions, options, false);
+      }
+      try {
+        return X86 ? igraph_pagerank_x86(graph, algo, vector, ref value, vids, directed, damping, weights, options) : igraph_pagerank_x64(graph, algo, vector, ref value, vids, directed, damping, weights, options);
+      } finally {
+        if (algo == igraph_pagerank_algo_t.IGRAPH_PAGERANK_ALGO_ARPACK) {
+          Marshal.DestroyStructure(options, typeof(igraph_arpack_options_t));
+          Marshal.FreeHGlobal(options);
+        } else if (algo == igraph_pagerank_algo_t.IGRAPH_PAGERANK_ALGO_POWER) {
+          Marshal.DestroyStructure(options, typeof(igraph_pagerank_power_options_t));
+          Marshal.FreeHGlobal(options);
+        }
+      }
+    }
+
+    unsafe private static igraph_arpack_options_t GetDefaultArpackOptions() {
+      var arpackoptions = new igraph_arpack_options_t();
+      arpackoptions.bmat[0] = 'I';
+      arpackoptions.which[0] = arpackoptions.which[1] = 'X';
+      arpackoptions.nev = 1;
+      arpackoptions.ishift = 1;
+      arpackoptions.mxiter = 1000;
+      arpackoptions.nb = 1;
+      arpackoptions.mode = 1;
+      arpackoptions.iparam[0] = arpackoptions.ishift;
+      arpackoptions.iparam[1] = arpackoptions.iparam[4] = arpackoptions.iparam[5] = arpackoptions.iparam[7] = arpackoptions.iparam[8] = arpackoptions.iparam[9] = arpackoptions.iparam[10] = 0;
+      arpackoptions.iparam[2] = arpackoptions.mxiter;
+      arpackoptions.iparam[3] = arpackoptions.nb;
+      arpackoptions.iparam[6] = arpackoptions.mode;
+      return arpackoptions;
+    }
+
+    private static igraph_pagerank_power_options_t GetDefaultPowerOptions() {
+      var poweroptions = new igraph_pagerank_power_options_t();
+      poweroptions.niter = 50;
+      poweroptions.eps = 1e-5;
+      return poweroptions;
+    }
+    #endregion
+
+    #region igraph manipulation
+    internal static int igraph_add_edge(igraph_t graph, int from, int to) {
+      return X86 ? igraph_add_edge_x86(graph, from, to) : igraph_add_edge_x64(graph, from, to);
+    }
+    #endregion
+
+    #region igraph visits
+    internal static int igraph_bfs(igraph_t graph, int root, igraph_vector_t roots, igraph_neimode_t mode, bool unreachable, igraph_vector_t restricted, igraph_vector_t order, igraph_vector_t rank, igraph_vector_t father, igraph_vector_t pred, igraph_vector_t succ, igraph_vector_t dist, igraph_bfshandler_t callback, object tag) {
+      return MarshalIfExistsAndCall(tag, ptr => X86 ? igraph_bfs_x86(graph, root, roots, mode, unreachable, restricted, order, rank, father, pred, succ, dist, callback, ptr) : igraph_bfs_x64(graph, root, roots, mode, unreachable, restricted, order, rank, father, pred, succ, dist, callback, ptr));
+    }
+    internal static int igraph_dfs(igraph_t graph, int root, igraph_neimode_t mode, bool unreachable, igraph_vector_t order, igraph_vector_t order_out, igraph_vector_t father, igraph_vector_t dist, igraph_dfshandler_t inWrapper, igraph_dfshandler_t outWrapper, object tag) {
+      return MarshalIfExistsAndCall(tag, ptr => X86 ? igraph_dfs_x86(graph, root, mode, unreachable, order, order_out, father, dist, inWrapper, outWrapper, ptr) : igraph_dfs_x64(graph, root, mode, unreachable, order, order_out, father, dist, inWrapper, outWrapper, ptr));
+    }
+    #endregion
+
+    #region Platform specific DLL imports
+    [DllImport(X86Dll, EntryPoint = "igraph_empty", CallingConvention = CallingConvention.Cdecl)]
+    private static extern void igraph_empty_x86([In, Out]igraph_t graph, int n, bool directed);
+    [DllImport(X64Dll, EntryPoint = "igraph_empty", CallingConvention = CallingConvention.Cdecl)]
+    private static extern void igraph_empty_x64([In, Out]igraph_t graph, int n, bool directed);
+    [DllImport(X86Dll, EntryPoint = "igraph_destroy", CallingConvention = CallingConvention.Cdecl)]
+    private static extern int igraph_destroy_x86([In, Out]igraph_t graph);
+    [DllImport(X64Dll, EntryPoint = "igraph_destroy", CallingConvention = CallingConvention.Cdecl)]
+    private static extern int igraph_destroy_x64([In, Out]igraph_t graph);
+    [DllImport(X86Dll, EntryPoint = "igraph_vcount", CallingConvention = CallingConvention.Cdecl)]
+    private static extern int igraph_vcount_x86(igraph_t graph);
+    [DllImport(X64Dll, EntryPoint = "igraph_vcount", CallingConvention = CallingConvention.Cdecl)]
+    private static extern int igraph_vcount_x64(igraph_t graph);
+    [DllImport(X86Dll, EntryPoint = "igraph_add_edge", CallingConvention = CallingConvention.Cdecl)]
+    private static extern int igraph_add_edge_x86([In, Out]igraph_t graph, int from, int to);
+    [DllImport(X64Dll, EntryPoint = "igraph_add_edge", CallingConvention = CallingConvention.Cdecl)]
+    private static extern int igraph_add_edge_x64([In, Out]igraph_t graph, int from, int to);
+    [DllImport(X86Dll, EntryPoint = "igraph_density", CallingConvention = CallingConvention.Cdecl)]
+    private static extern int igraph_density_x86(igraph_t graph, ref double density, bool loops);
+    [DllImport(X64Dll, EntryPoint = "igraph_density", CallingConvention = CallingConvention.Cdecl)]
+    private static extern int igraph_density_x64(igraph_t graph, ref double density, bool loops);
+    [DllImport(X86Dll, EntryPoint = "igraph_pagerank", CallingConvention = CallingConvention.Cdecl)]
+    private static extern int igraph_pagerank_x86(igraph_t graph, igraph_pagerank_algo_t algo, [In, Out]igraph_vector_t vector, ref double value, igraph_vs_t vids, bool directed, double damping, igraph_vector_t weights, IntPtr options);
+    [DllImport(X64Dll, EntryPoint = "igraph_pagerank", CallingConvention = CallingConvention.Cdecl)]
+    private static extern int igraph_pagerank_x64(igraph_t graph, igraph_pagerank_algo_t algo, [In, Out]igraph_vector_t vector, ref double value, igraph_vs_t vids, bool directed, double damping, igraph_vector_t weights, IntPtr options);
+    [DllImport(X86Dll, EntryPoint = "igraph_bfs", CallingConvention = CallingConvention.Cdecl)]
+    private static extern int igraph_bfs_x86(igraph_t graph, int root, igraph_vector_t roots, igraph_neimode_t mode, bool unreachable, igraph_vector_t restricted, [In, Out]igraph_vector_t order, [In, Out]igraph_vector_t rank, [In, Out]igraph_vector_t father, [In, Out]igraph_vector_t pred, [In, Out]igraph_vector_t succ, [In, Out]igraph_vector_t dist, igraph_bfshandler_t callback, IntPtr extra);
+    [DllImport(X64Dll, EntryPoint = "igraph_bfs", CallingConvention = CallingConvention.Cdecl)]
+    private static extern int igraph_bfs_x64(igraph_t graph, int root, igraph_vector_t roots, igraph_neimode_t mode, bool unreachable, igraph_vector_t restricted, [In, Out]igraph_vector_t order, [In, Out]igraph_vector_t rank, [In, Out]igraph_vector_t father, [In, Out]igraph_vector_t pred, [In, Out]igraph_vector_t succ, [In, Out]igraph_vector_t dist, igraph_bfshandler_t callback, IntPtr extra);
+    [DllImport(X86Dll, EntryPoint = "igraph_dfs", CallingConvention = CallingConvention.Cdecl)]
+    private static extern int igraph_dfs_x86(igraph_t graph, int root, igraph_neimode_t mode, bool unreachable, [In, Out]igraph_vector_t order, [In, Out]igraph_vector_t order_out, [In, Out]igraph_vector_t father, [In, Out]igraph_vector_t dist, igraph_dfshandler_t in_callback, igraph_dfshandler_t out_callback, IntPtr extra);
+    [DllImport(X64Dll, EntryPoint = "igraph_dfs", CallingConvention = CallingConvention.Cdecl)]
+    private static extern int igraph_dfs_x64(igraph_t graph, int root, igraph_neimode_t mode, bool unreachable, [In, Out]igraph_vector_t order, [In, Out]igraph_vector_t order_out, [In, Out]igraph_vector_t father, [In, Out]igraph_vector_t dist, igraph_dfshandler_t in_callback, igraph_dfshandler_t out_callback, IntPtr extra);
+    #endregion
+    #endregion
+
+    #region igraph_rng
+    internal static int igraph_rng_get_integer(int l, int h) {
+      return X86 ? igraph_rng_get_integer_x86(igraph_rng_default_x86(), l, h) : igraph_rng_get_integer_x64(igraph_rng_default_x64(), l, h);
+    }
+    internal static int igraph_rng_seed(uint seed) {
+      return X86 ? igraph_rng_seed_x86(igraph_rng_default_x86(), seed) : igraph_rng_seed_x64(igraph_rng_default_x64(), seed);
+    }
+
+    #region Platform specific DLL imports
+    [DllImport(X86Dll, EntryPoint = "igraph_rng_default", CallingConvention = CallingConvention.Cdecl)]
+    private static extern IntPtr igraph_rng_default_x86();
+    [DllImport(X64Dll, EntryPoint = "igraph_rng_default", CallingConvention = CallingConvention.Cdecl)]
+    private static extern IntPtr igraph_rng_default_x64();
+    [DllImport(X86Dll, EntryPoint = "igraph_rng_get_integer", CallingConvention = CallingConvention.Cdecl)]
+    private static extern int igraph_rng_get_integer_x86(IntPtr rng, int l, int h);
+    [DllImport(X64Dll, EntryPoint = "igraph_rng_get_integer", CallingConvention = CallingConvention.Cdecl)]
+    private static extern int igraph_rng_get_integer_x64(IntPtr rng, int l, int h);
+    [DllImport(X86Dll, EntryPoint = "igraph_rng_seed", CallingConvention = CallingConvention.Cdecl)]
+    private static extern int igraph_rng_seed_x86(IntPtr rng, uint seed);
+    [DllImport(X64Dll, EntryPoint = "igraph_rng_seed", CallingConvention = CallingConvention.Cdecl)]
+    private static extern int igraph_rng_seed_x64(IntPtr rng, uint seed);
+    #endregion
+    #endregion
+
+    #region igraph_vector
+    internal static int igraph_vector_init(igraph_vector_t vector, int length) {
+      return X86 ? igraph_vector_init_x86(vector, length) : igraph_vector_init_x64(vector, length);
+    }
+    internal static int igraph_vector_init_copy(igraph_vector_t vector, double[] vec) {
+      return X86 ? igraph_vector_init_copy_x86(vector, vec, vec.Length) : igraph_vector_init_copy_x64(vector, vec, vec.Length);
+    }
+    internal static void igraph_vector_destroy(igraph_vector_t vector) {
+      if (X86) igraph_vector_destroy_x86(vector);
+      else igraph_vector_destroy_x64(vector);
+    }
+    internal static int igraph_vector_copy(igraph_vector_t to, igraph_vector_t from) {
+      return X86 ? igraph_vector_copy_x86(to, from) : igraph_vector_copy_x64(to, from);
+    }
+    internal static double[] igraph_vector_to_array(igraph_vector_t from) {
+      var len = igraph_vector_size(from);
+      var result = new double[len];
+      if (X86) igraph_vector_copy_to_x86(from, result);
+      else igraph_vector_copy_to_x64(from, result);
+      return result;
+    }
+
+    internal static int igraph_vector_size(igraph_vector_t vector) {
+      return X86 ? igraph_vector_size_x86(vector) : igraph_vector_size_x64(vector);
+    }
+
+    internal static double igraph_vector_e(igraph_vector_t vector, int index) {
+      return X86 ? igraph_vector_e_x86(vector, index) : igraph_vector_e_x64(vector, index);
+    }
+
+    internal static void igraph_vector_set(igraph_vector_t vector, int index, double value) {
+      if (X86) igraph_vector_set_x86(vector, index, value);
+      else igraph_vector_set_x64(vector, index, value);
+    }
+    internal static void igraph_vector_fill(igraph_vector_t vector, double v) {
+      if (X86) igraph_vector_fill_x86(vector, v);
+      else igraph_vector_fill_x64(vector, v);
+    }
+    internal static void igraph_vector_scale(igraph_vector_t vector, double by) {
+      if (X86) igraph_vector_scale_x86(vector, by);
+      else igraph_vector_scale_x64(vector, by);
+    }
+
+    internal static int igraph_vector_reverse(igraph_vector_t vector) {
+      return X86 ? igraph_vector_reverse_x86(vector) : igraph_vector_reverse_x64(vector);
+    }
+    internal static int igraph_vector_shuffle(igraph_vector_t vector) {
+      return X86 ? igraph_vector_shuffle_x86(vector) : igraph_vector_shuffle_x64(vector);
+    }
+
+    #region Platform specific DLL imports
+    [DllImport(X86Dll, EntryPoint = "igraph_vector_init", CallingConvention = CallingConvention.Cdecl)]
+    private static extern int igraph_vector_init_x86([In, Out]igraph_vector_t vector, int length);
+    [DllImport(X64Dll, EntryPoint = "igraph_vector_init", CallingConvention = CallingConvention.Cdecl)]
+    private static extern int igraph_vector_init_x64([In, Out]igraph_vector_t vector, int length);
+    [DllImport(X86Dll, EntryPoint = "igraph_vector_init_copy", CallingConvention = CallingConvention.Cdecl)]
+    private static extern int igraph_vector_init_copy_x86([In, Out]igraph_vector_t vector, double[] vec, int length);
+    [DllImport(X64Dll, EntryPoint = "igraph_vector_init_copy", CallingConvention = CallingConvention.Cdecl)]
+    private static extern int igraph_vector_init_copy_x64([In, Out]igraph_vector_t vector, double[] vec, int length);
+    [DllImport(X86Dll, EntryPoint = "igraph_vector_destroy", CallingConvention = CallingConvention.Cdecl)]
+    private static extern void igraph_vector_destroy_x86([In, Out]igraph_vector_t vector);
+    [DllImport(X64Dll, EntryPoint = "igraph_vector_destroy", CallingConvention = CallingConvention.Cdecl)]
+    private static extern void igraph_vector_destroy_x64([In, Out]igraph_vector_t vector);
+    [DllImport(X86Dll, EntryPoint = "igraph_vector_size", CallingConvention = CallingConvention.Cdecl)]
+    private static extern int igraph_vector_size_x86(igraph_vector_t vector);
+    [DllImport(X64Dll, EntryPoint = "igraph_vector_size", CallingConvention = CallingConvention.Cdecl)]
+    private static extern int igraph_vector_size_x64(igraph_vector_t vector);
+    [DllImport(X86Dll, EntryPoint = "igraph_vector_e", CallingConvention = CallingConvention.Cdecl)]
+    private static extern double igraph_vector_e_x86(igraph_vector_t vector, int index);
+    [DllImport(X64Dll, EntryPoint = "igraph_vector_e", CallingConvention = CallingConvention.Cdecl)]
+    private static extern double igraph_vector_e_x64(igraph_vector_t vector, int index);
+    [DllImport(X86Dll, EntryPoint = "igraph_vector_set", CallingConvention = CallingConvention.Cdecl)]
+    private static extern double igraph_vector_set_x86([In, Out]igraph_vector_t vector, int index, double value);
+    [DllImport(X64Dll, EntryPoint = "igraph_vector_set", CallingConvention = CallingConvention.Cdecl)]
+    private static extern double igraph_vector_set_x64([In, Out]igraph_vector_t vector, int index, double value);
+    [DllImport(X86Dll, EntryPoint = "igraph_vector_copy", CallingConvention = CallingConvention.Cdecl)]
+    private static extern int igraph_vector_copy_x86([In, Out]igraph_vector_t to, igraph_vector_t from);
+    [DllImport(X64Dll, EntryPoint = "igraph_vector_copy", CallingConvention = CallingConvention.Cdecl)]
+    private static extern int igraph_vector_copy_x64([In, Out]igraph_vector_t to, igraph_vector_t from);
+    [DllImport(X86Dll, EntryPoint = "igraph_vector_copy_to", CallingConvention = CallingConvention.Cdecl)]
+    private static extern void igraph_vector_copy_to_x86(igraph_vector_t from, [In, Out]double[] to);
+    [DllImport(X64Dll, EntryPoint = "igraph_vector_copy_to", CallingConvention = CallingConvention.Cdecl)]
+    private static extern void igraph_vector_copy_to_x64(igraph_vector_t from, [In, Out]double[] to);
+    [DllImport(X86Dll, EntryPoint = "igraph_vector_fill", CallingConvention = CallingConvention.Cdecl)]
+    private static extern int igraph_vector_fill_x86([In, Out]igraph_vector_t vector, double v);
+    [DllImport(X64Dll, EntryPoint = "igraph_vector_fill", CallingConvention = CallingConvention.Cdecl)]
+    private static extern int igraph_vector_fill_x64([In, Out]igraph_vector_t vector, double v);
+    [DllImport(X86Dll, EntryPoint = "igraph_vector_reverse", CallingConvention = CallingConvention.Cdecl)]
+    private static extern int igraph_vector_reverse_x86([In, Out]igraph_vector_t vector);
+    [DllImport(X64Dll, EntryPoint = "igraph_vector_reverse", CallingConvention = CallingConvention.Cdecl)]
+    private static extern int igraph_vector_reverse_x64([In, Out]igraph_vector_t vector);
+    [DllImport(X86Dll, EntryPoint = "igraph_vector_shuffle", CallingConvention = CallingConvention.Cdecl)]
+    private static extern int igraph_vector_shuffle_x86([In, Out]igraph_vector_t vector);
+    [DllImport(X64Dll, EntryPoint = "igraph_vector_shuffle", CallingConvention = CallingConvention.Cdecl)]
+    private static extern int igraph_vector_shuffle_x64([In, Out]igraph_vector_t vector);
+    [DllImport(X86Dll, EntryPoint = "igraph_vector_scale", CallingConvention = CallingConvention.Cdecl)]
+    private static extern void igraph_vector_scale_x86([In, Out]igraph_vector_t vector, double by);
+    [DllImport(X64Dll, EntryPoint = "igraph_vector_scale", CallingConvention = CallingConvention.Cdecl)]
+    private static extern void igraph_vector_scale_x64([In, Out]igraph_vector_t vector, double by);
+    #endregion
+    #endregion
+
+    #region igraph_matrix
+    internal static int igraph_matrix_init(igraph_matrix_t matrix, int nrows, int ncols) {
+      return X86 ? igraph_matrix_init_x86(matrix, nrows, ncols) : igraph_matrix_init_x64(matrix, nrows, ncols);
+    }
+    internal static void igraph_matrix_destroy(igraph_matrix_t matrix) {
+      if (X86) igraph_matrix_destroy_x86(matrix);
+      else igraph_matrix_destroy_x64(matrix);
+    }
+    internal static int igraph_matrix_copy(igraph_matrix_t to, igraph_matrix_t from) {
+      return X86 ? igraph_matrix_copy_x86(to, from) : igraph_matrix_copy_x64(to, from);
+    }
+
+    internal static double igraph_matrix_e(igraph_matrix_t matrix, int row, int col) {
+      return X86 ? igraph_matrix_e_x86(matrix, row, col) : igraph_matrix_e_x64(matrix, row, col);
+    }
+
+    internal static void igraph_matrix_set(igraph_matrix_t matrix, int row, int col, double value) {
+      if (X86) igraph_matrix_set_x86(matrix, row, col, value);
+      else igraph_matrix_set_x64(matrix, row, col, value);
+    }
+
+    internal static void igraph_matrix_fill(igraph_matrix_t matrix, double v) {
+      if (X86) igraph_matrix_fill_x86(matrix, v);
+      else igraph_matrix_fill_x64(matrix, v);
+    }
+
+    internal static int igraph_matrix_transpose(igraph_matrix_t matrix) {
+      return X86 ? igraph_matrix_transpose_x86(matrix) : igraph_matrix_transpose_x64(matrix);
+    }
+
+    internal static void igraph_matrix_scale(igraph_matrix_t matrix, double by) {
+      if (X86) igraph_matrix_scale_x86(matrix, by);
+      else igraph_matrix_scale_x64(matrix, by);
+    }
+
+    #region Platform specific DLL imports
+    [DllImport(X86Dll, EntryPoint = "igraph_matrix_init", CallingConvention = CallingConvention.Cdecl)]
+    private static extern int igraph_matrix_init_x86([In, Out]igraph_matrix_t matrix, int nrow, int ncol);
+    [DllImport(X64Dll, EntryPoint = "igraph_matrix_init", CallingConvention = CallingConvention.Cdecl)]
+    private static extern int igraph_matrix_init_x64([In, Out]igraph_matrix_t matrix, int nrow, int ncol);
+    [DllImport(X86Dll, EntryPoint = "igraph_matrix_destroy", CallingConvention = CallingConvention.Cdecl)]
+    private static extern void igraph_matrix_destroy_x86([In, Out]igraph_matrix_t matrix);
+    [DllImport(X64Dll, EntryPoint = "igraph_matrix_destroy", CallingConvention = CallingConvention.Cdecl)]
+    private static extern void igraph_matrix_destroy_x64([In, Out]igraph_matrix_t matrix);
+    [DllImport(X86Dll, EntryPoint = "igraph_matrix_e", CallingConvention = CallingConvention.Cdecl)]
+    private static extern double igraph_matrix_e_x86(igraph_matrix_t matrix, int row, int col);
+    [DllImport(X64Dll, EntryPoint = "igraph_matrix_e", CallingConvention = CallingConvention.Cdecl)]
+    private static extern double igraph_matrix_e_x64(igraph_matrix_t matrix, int row, int col);
+    [DllImport(X86Dll, EntryPoint = "igraph_matrix_set", CallingConvention = CallingConvention.Cdecl)]
+    private static extern double igraph_matrix_set_x86([In, Out]igraph_matrix_t matrix, int row, int col, double value);
+    [DllImport(X64Dll, EntryPoint = "igraph_matrix_set", CallingConvention = CallingConvention.Cdecl)]
+    private static extern double igraph_matrix_set_x64([In, Out]igraph_matrix_t matrix, int row, int col, double value);
+    [DllImport(X86Dll, EntryPoint = "igraph_matrix_copy", CallingConvention = CallingConvention.Cdecl)]
+    private static extern int igraph_matrix_copy_x86([In, Out]igraph_matrix_t to, igraph_matrix_t from);
+    [DllImport(X64Dll, EntryPoint = "igraph_matrix_copy", CallingConvention = CallingConvention.Cdecl)]
+    private static extern int igraph_matrix_copy_x64([In, Out]igraph_matrix_t to, igraph_matrix_t from);
+    [DllImport(X86Dll, EntryPoint = "igraph_matrix_fill", CallingConvention = CallingConvention.Cdecl)]
+    private static extern void igraph_matrix_fill_x86([In, Out]igraph_matrix_t matrix, double v);
+    [DllImport(X64Dll, EntryPoint = "igraph_matrix_fill", CallingConvention = CallingConvention.Cdecl)]
+    private static extern void igraph_matrix_fill_x64([In, Out]igraph_matrix_t matrix, double v);
+    [DllImport(X86Dll, EntryPoint = "igraph_matrix_transpose", CallingConvention = CallingConvention.Cdecl)]
+    private static extern int igraph_matrix_transpose_x86([In, Out]igraph_matrix_t matrix);
+    [DllImport(X64Dll, EntryPoint = "igraph_matrix_transpose", CallingConvention = CallingConvention.Cdecl)]
+    private static extern int igraph_matrix_transpose_x64([In, Out]igraph_matrix_t matrix);
+    [DllImport(X86Dll, EntryPoint = "igraph_matrix_scale", CallingConvention = CallingConvention.Cdecl)]
+    private static extern int igraph_matrix_scale_x86([In, Out]igraph_matrix_t matrix, double by);
+    [DllImport(X64Dll, EntryPoint = "igraph_matrix_scale", CallingConvention = CallingConvention.Cdecl)]
+    private static extern int igraph_matrix_scale_x64([In, Out]igraph_matrix_t matrix, double by);
+    #endregion
+    #endregion
+
+    #region igraph_layout
+    internal static int igraph_layout_fruchterman_reingold(igraph_t graph, igraph_matrix_t res, bool use_seed, int niter, double start_temp, igraph_layout_grid_t grid, igraph_vector_t weights, igraph_vector_t minx, igraph_vector_t maxx, igraph_vector_t miny, igraph_vector_t maxy) {
+      return X86 ? igraph_layout_fruchterman_reingold_x86(graph, res, use_seed, niter, start_temp, grid, weights, minx, maxx, miny, maxy) : igraph_layout_fruchterman_reingold_x64(graph, res, use_seed, niter, start_temp, grid, weights, minx, maxx, miny, maxy);
+    }
+    internal static int igraph_layout_kamada_kawai(igraph_t graph, igraph_matrix_t res, bool use_seed, int maxiter, double epsilon, double kkconst, igraph_vector_t weights, igraph_vector_t minx, igraph_vector_t maxx, igraph_vector_t miny, igraph_vector_t maxy) {
+      return X86 ? igraph_layout_kamada_kawai_x86(graph, res, use_seed, maxiter, epsilon, kkconst, weights, minx, maxx, miny, maxy) : igraph_layout_kamada_kawai_x64(graph, res, use_seed, maxiter, epsilon, kkconst, weights, minx, maxx, miny, maxy);
+    }
+    internal static int igraph_layout_davidson_harel(igraph_t graph, igraph_matrix_t res, bool use_seed, int maxiter, int fineiter, double cool_fact, double weight_node_dist, double weight_border, double weight_edge_lengths, double weight_edge_crossings, double weight_node_edge_dist) {
+      return X86 ? igraph_layout_davidson_harel_x86(graph, res, use_seed, maxiter, fineiter, cool_fact, weight_node_dist, weight_border, weight_edge_lengths, weight_edge_crossings, weight_node_edge_dist) : igraph_layout_davidson_harel_x64(graph, res, use_seed, maxiter, fineiter, cool_fact, weight_node_dist, weight_border, weight_edge_lengths, weight_edge_crossings, weight_node_edge_dist);
+    }
+    internal static int igraph_layout_mds(igraph_t graph, igraph_matrix_t res, igraph_matrix_t dist = null, int dim = 2) {
+      return MarshalIfExistsAndCall(GetDefaultArpackOptions(), ptr => X86 ? igraph_layout_mds_x86(graph, res, dist, dim, ptr) : igraph_layout_mds_x64(graph, res, dist, dim, ptr));
+    }
+
+    #region Platform specific DLL imports
+    [DllImport(X86Dll, EntryPoint = "igraph_layout_fruchterman_reingold", CallingConvention = CallingConvention.Cdecl)]
+    private static extern int igraph_layout_fruchterman_reingold_x86(igraph_t graph, [In, Out]igraph_matrix_t res, bool use_seed, int niter, double start_temp, igraph_layout_grid_t grid, igraph_vector_t weights, igraph_vector_t minx, igraph_vector_t maxx, igraph_vector_t miny, igraph_vector_t maxy);
+    [DllImport(X64Dll, EntryPoint = "igraph_layout_fruchterman_reingold", CallingConvention = CallingConvention.Cdecl)]
+    private static extern int igraph_layout_fruchterman_reingold_x64(igraph_t graph, [In, Out]igraph_matrix_t res, bool use_seed, int niter, double start_temp, igraph_layout_grid_t grid, igraph_vector_t weights, igraph_vector_t minx, igraph_vector_t maxx, igraph_vector_t miny, igraph_vector_t maxy);
+    [DllImport(X86Dll, EntryPoint = "igraph_layout_kamada_kawai", CallingConvention = CallingConvention.Cdecl)]
+    private static extern int igraph_layout_kamada_kawai_x86(igraph_t graph, [In, Out]igraph_matrix_t res, bool use_seed, int maxiter, double epsilon, double kkconst, igraph_vector_t weights, igraph_vector_t minx, igraph_vector_t maxx, igraph_vector_t miny, igraph_vector_t maxy);
+    [DllImport(X64Dll, EntryPoint = "igraph_layout_kamada_kawai", CallingConvention = CallingConvention.Cdecl)]
+    private static extern int igraph_layout_kamada_kawai_x64(igraph_t graph, [In, Out]igraph_matrix_t res, bool use_seed, int maxiter, double epsilon, double kkconst, igraph_vector_t weights, igraph_vector_t minx, igraph_vector_t maxx, igraph_vector_t miny, igraph_vector_t maxy);
+    [DllImport(X86Dll, EntryPoint = "igraph_layout_davidson_harel", CallingConvention = CallingConvention.Cdecl)]
+    private static extern int igraph_layout_davidson_harel_x86(igraph_t graph, [In, Out]igraph_matrix_t res, bool use_seed, int maxiter, int fineiter, double cool_fact, double weight_node_dist, double weight_border, double weight_edge_lengths, double weight_edge_crossings, double weight_node_edge_dist);
+    [DllImport(X64Dll, EntryPoint = "igraph_layout_davidson_harel", CallingConvention = CallingConvention.Cdecl)]
+    private static extern int igraph_layout_davidson_harel_x64(igraph_t graph, [In, Out]igraph_matrix_t res, bool use_seed, int maxiter, int fineiter, double cool_fact, double weight_node_dist, double weight_border, double weight_edge_lengths, double weight_edge_crossings, double weight_node_edge_dist);
+    [DllImport(X86Dll, EntryPoint = "igraph_layout_mds", CallingConvention = CallingConvention.Cdecl)]
+    private static extern int igraph_layout_mds_x86(igraph_t graph, [In, Out]igraph_matrix_t res, igraph_matrix_t dist, int dim, IntPtr options);
+    [DllImport(X64Dll, EntryPoint = "igraph_layout_mds", CallingConvention = CallingConvention.Cdecl)]
+    private static extern int igraph_layout_mds_x64(igraph_t graph, [In, Out]igraph_matrix_t res, igraph_matrix_t dist, int dim, IntPtr options);
+    #endregion
+    #endregion
+
+    #region igraph_iterators
+    internal static int igraph_vs_all(ref igraph_vs_t vs) {
+      return X86 ? igraph_vs_all_x86(ref vs) : igraph_vs_all_x64(ref vs);
+    }
+    internal static void igraph_vs_destroy(ref igraph_vs_t vs) {
+      if (X86) igraph_vs_destroy_x86(ref vs);
+      else igraph_vs_destroy_x64(ref vs);
+    }
+
+    #region Platform specific DLL imports
+    [DllImport(X86Dll, EntryPoint = "igraph_vs_all", CallingConvention = CallingConvention.Cdecl)]
+    private static extern int igraph_vs_all_x86([In, Out]ref igraph_vs_t vs);
+    [DllImport(X64Dll, EntryPoint = "igraph_vs_all", CallingConvention = CallingConvention.Cdecl)]
+    private static extern int igraph_vs_all_x64([In, Out]ref igraph_vs_t vs);
+    [DllImport(X86Dll, EntryPoint = "igraph_vs_destroy", CallingConvention = CallingConvention.Cdecl)]
+    private static extern void igraph_vs_destroy_x86([In, Out]ref igraph_vs_t vs);
+    [DllImport(X64Dll, EntryPoint = "igraph_vs_destroy", CallingConvention = CallingConvention.Cdecl)]
+    private static extern void igraph_vs_destroy_x64([In, Out]ref igraph_vs_t vs);
+    #endregion
+    #endregion
+
+    private static int MarshalIfExistsAndCall(object o, Func<IntPtr, int> call) {
+      var ptr = IntPtr.Zero;
+      if (o != null) {
+        try {
+          ptr = Marshal.AllocHGlobal(Marshal.SizeOf(o));
+        } catch (OutOfMemoryException e) { throw new InvalidOperationException("Not enough memory to perform operation.", e); }
+        Marshal.StructureToPtr(o, ptr, false);
+      }
+      try {
+        return call(ptr);
+      } finally {
+        if (o != null) {
+          Marshal.DestroyStructure(ptr, o.GetType());
+          Marshal.FreeHGlobal(ptr);
+        }
+      }
+    }
+
+    private static void MarshalIfExistsAndCall(object o, Action<IntPtr> call) {
+      var ptr = IntPtr.Zero;
+      if (o != null) {
+        try {
+          ptr = Marshal.AllocHGlobal(Marshal.SizeOf(o));
+        } catch (OutOfMemoryException e) { throw new InvalidOperationException("Not enough memory to perform operation.", e); }
+        Marshal.StructureToPtr(o, ptr, false);
+      }
+      try {
+        call(ptr);
+      } finally {
+        if (o != null) {
+          Marshal.DestroyStructure(ptr, o.GetType());
+          Marshal.FreeHGlobal(ptr);
+        }
+      }
+    }
+  }
+}
Index: /stable/HeuristicLab.ExtLibs/HeuristicLab.Igraph/0.8.0-pre/HeuristicLab.Igraph-0.8.0-pre/HeuristicLab.IGraph-0.8.0-pre.csproj
===================================================================
--- /stable/HeuristicLab.ExtLibs/HeuristicLab.Igraph/0.8.0-pre/HeuristicLab.Igraph-0.8.0-pre/HeuristicLab.IGraph-0.8.0-pre.csproj	(revision 15130)
+++ /stable/HeuristicLab.ExtLibs/HeuristicLab.Igraph/0.8.0-pre/HeuristicLab.Igraph-0.8.0-pre/HeuristicLab.IGraph-0.8.0-pre.csproj	(revision 15130)
@@ -0,0 +1,88 @@
+﻿<?xml version="1.0" encoding="utf-8"?>
+<Project ToolsVersion="12.0" DefaultTargets="Build" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
+  <Import Project="$(MSBuildExtensionsPath)\$(MSBuildToolsVersion)\Microsoft.Common.props" Condition="Exists('$(MSBuildExtensionsPath)\$(MSBuildToolsVersion)\Microsoft.Common.props')" />
+  <PropertyGroup>
+    <Configuration Condition=" '$(Configuration)' == '' ">Debug</Configuration>
+    <Platform Condition=" '$(Platform)' == '' ">AnyCPU</Platform>
+    <ProjectGuid>{088D34F2-32EA-43FF-BAA8-22428D5B66BE}</ProjectGuid>
+    <OutputType>Library</OutputType>
+    <AppDesignerFolder>Properties</AppDesignerFolder>
+    <RootNamespace>HeuristicLab.IGraph</RootNamespace>
+    <AssemblyName>HeuristicLab.IGraph-0.8.0-pre</AssemblyName>
+    <TargetFrameworkVersion>v4.5</TargetFrameworkVersion>
+    <FileAlignment>512</FileAlignment>
+  </PropertyGroup>
+  <PropertyGroup Condition=" '$(Configuration)|$(Platform)' == 'Debug|AnyCPU' ">
+    <DebugSymbols>true</DebugSymbols>
+    <DebugType>full</DebugType>
+    <Optimize>false</Optimize>
+    <OutputPath>..\..\..\..\bin\</OutputPath>
+    <DefineConstants>DEBUG;TRACE</DefineConstants>
+    <ErrorReport>prompt</ErrorReport>
+    <WarningLevel>4</WarningLevel>
+    <AllowUnsafeBlocks>true</AllowUnsafeBlocks>
+  </PropertyGroup>
+  <PropertyGroup Condition=" '$(Configuration)|$(Platform)' == 'Release|AnyCPU' ">
+    <DebugType>pdbonly</DebugType>
+    <Optimize>true</Optimize>
+    <OutputPath>..\..\..\..\bin\</OutputPath>
+    <DefineConstants>TRACE</DefineConstants>
+    <ErrorReport>prompt</ErrorReport>
+    <WarningLevel>4</WarningLevel>
+    <AllowUnsafeBlocks>true</AllowUnsafeBlocks>
+  </PropertyGroup>
+  <PropertyGroup>
+    <SignAssembly>true</SignAssembly>
+  </PropertyGroup>
+  <PropertyGroup>
+    <AssemblyOriginatorKeyFile>HeuristicLab.snk</AssemblyOriginatorKeyFile>
+  </PropertyGroup>
+  <ItemGroup>
+    <Reference Include="System" />
+    <Reference Include="System.Core" />
+    <Reference Include="System.Xml.Linq" />
+    <Reference Include="System.Data.DataSetExtensions" />
+    <Reference Include="Microsoft.CSharp" />
+    <Reference Include="System.Data" />
+    <Reference Include="System.Xml" />
+  </ItemGroup>
+  <ItemGroup>
+    <Compile Include="DllImporter.cs" />
+    <Compile Include="Wrappers\Datatypes.cs" />
+    <Compile Include="Wrappers\Graph.cs" />
+    <Compile Include="Wrappers\Matrix.cs" />
+    <Compile Include="Plugin.cs" />
+    <Compile Include="Properties\AssemblyInfo.cs" />
+    <Compile Include="Datatypes.cs" />
+    <Compile Include="Wrappers\Vector.cs" />
+  </ItemGroup>
+  <ItemGroup>
+    <None Include="HeuristicLab.snk" />
+  </ItemGroup>
+  <ItemGroup>
+    <ProjectReference Include="..\..\..\..\HeuristicLab.PluginInfrastructure\3.3\HeuristicLab.PluginInfrastructure-3.3.csproj">
+      <Project>{94186a6a-5176-4402-ae83-886557b53cca}</Project>
+      <Name>HeuristicLab.PluginInfrastructure-3.3</Name>
+      <Private>False</Private>
+    </ProjectReference>
+  </ItemGroup>
+  <ItemGroup>
+    <Content Include="igraph-0.8.0-pre-license.txt">
+      <CopyToOutputDirectory>PreserveNewest</CopyToOutputDirectory>
+    </Content>
+    <Content Include="igraph-0.8.0-pre-x64.dll">
+      <CopyToOutputDirectory>Always</CopyToOutputDirectory>
+    </Content>
+    <Content Include="igraph-0.8.0-pre-x86.dll">
+      <CopyToOutputDirectory>Always</CopyToOutputDirectory>
+    </Content>
+  </ItemGroup>
+  <Import Project="$(MSBuildToolsPath)\Microsoft.CSharp.targets" />
+  <!-- To modify your build process, add your task inside one of the targets below and uncomment it. 
+       Other similar extension points exist, see Microsoft.Common.targets.
+  <Target Name="BeforeBuild">
+  </Target>
+  <Target Name="AfterBuild">
+  </Target>
+  -->
+</Project>
Index: /stable/HeuristicLab.ExtLibs/HeuristicLab.Igraph/0.8.0-pre/HeuristicLab.Igraph-0.8.0-pre/Plugin.cs
===================================================================
--- /stable/HeuristicLab.ExtLibs/HeuristicLab.Igraph/0.8.0-pre/HeuristicLab.Igraph-0.8.0-pre/Plugin.cs	(revision 15130)
+++ /stable/HeuristicLab.ExtLibs/HeuristicLab.Igraph/0.8.0-pre/HeuristicLab.Igraph-0.8.0-pre/Plugin.cs	(revision 15130)
@@ -0,0 +1,32 @@
+﻿#region License Information
+/* HeuristicLab
+ * Copyright (C) 2002-2016 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
+ *
+ * This file is part of HeuristicLab.
+ *
+ * HeuristicLab 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.
+ *
+ * HeuristicLab 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 HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
+ */
+#endregion
+
+using HeuristicLab.PluginInfrastructure;
+
+namespace HeuristicLab.IGraph {
+  [Plugin("HeuristicLab.IGraph", "Provides functionality of igraph in HeuristicLab", "0.8.0.0")]
+  [PluginFile("HeuristicLab.IGraph-0.8.0-pre.dll", PluginFileType.Assembly)]
+  [PluginFile("igraph-0.8.0-pre-x86.dll", PluginFileType.NativeDll)]
+  [PluginFile("igraph-0.8.0-pre-x64.dll", PluginFileType.NativeDll)]
+  [PluginFile("igraph-0.8.0-pre-license.txt", PluginFileType.License)]
+  public class HeuristicLabIGraphPlugin : PluginBase {
+  }
+}
Index: /stable/HeuristicLab.ExtLibs/HeuristicLab.Igraph/0.8.0-pre/HeuristicLab.Igraph-0.8.0-pre/Properties/AssemblyInfo.cs
===================================================================
--- /stable/HeuristicLab.ExtLibs/HeuristicLab.Igraph/0.8.0-pre/HeuristicLab.Igraph-0.8.0-pre/Properties/AssemblyInfo.cs	(revision 15130)
+++ /stable/HeuristicLab.ExtLibs/HeuristicLab.Igraph/0.8.0-pre/HeuristicLab.Igraph-0.8.0-pre/Properties/AssemblyInfo.cs	(revision 15130)
@@ -0,0 +1,56 @@
+﻿#region License Information
+/* HeuristicLab
+ * Copyright (C) 2002-2016 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
+ *
+ * This file is part of HeuristicLab.
+ *
+ * HeuristicLab 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.
+ *
+ * HeuristicLab 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 HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
+ */
+#endregion
+
+using System.Reflection;
+using System.Runtime.InteropServices;
+
+// General Information about an assembly is controlled through the following 
+// set of attributes. Change these attribute values to modify the information
+// associated with an assembly.
+[assembly: AssemblyTitle("HeuristicLab.IGraph-0.8.0-pre")]
+[assembly: AssemblyDescription("Plugin for providing igraph functionality in HeuristicLab")]
+[assembly: AssemblyConfiguration("")]
+[assembly: AssemblyCompany("HEAL")]
+[assembly: AssemblyProduct("HeuristicLab")]
+[assembly: AssemblyCopyright("(c) 2002-2016 HEAL")]
+[assembly: AssemblyTrademark("")]
+[assembly: AssemblyCulture("")]
+
+// Setting ComVisible to false makes the types in this assembly not visible 
+// to COM components.  If you need to access a type in this assembly from 
+// COM, set the ComVisible attribute to true on that type.
+[assembly: ComVisible(false)]
+
+// The following GUID is for the ID of the typelib if this project is exposed to COM
+[assembly: Guid("fa788954-4370-4d95-9f3b-48871fa6df5e")]
+
+// Version information for an assembly consists of the following four values:
+//
+//      Major Version
+//      Minor Version 
+//      Build Number
+//      Revision
+//
+// You can specify all the values or you can default the Build and Revision Numbers 
+// by using the '*' as shown below:
+// [assembly: AssemblyVersion("1.0.*")]
+[assembly: AssemblyVersion("0.8.0.0")]
+[assembly: AssemblyFileVersion("0.8.0.0")]
Index: /stable/HeuristicLab.ExtLibs/HeuristicLab.Igraph/0.8.0-pre/HeuristicLab.Igraph-0.8.0-pre/Wrappers/Datatypes.cs
===================================================================
--- /stable/HeuristicLab.ExtLibs/HeuristicLab.Igraph/0.8.0-pre/HeuristicLab.Igraph-0.8.0-pre/Wrappers/Datatypes.cs	(revision 15130)
+++ /stable/HeuristicLab.ExtLibs/HeuristicLab.Igraph/0.8.0-pre/HeuristicLab.Igraph-0.8.0-pre/Wrappers/Datatypes.cs	(revision 15130)
@@ -0,0 +1,31 @@
+﻿#region License Information
+/* HeuristicLab
+ * Copyright (C) 2002-2016 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
+ *
+ * This file is part of HeuristicLab.
+ *
+ * HeuristicLab 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.
+ *
+ * HeuristicLab 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 HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
+ */
+#endregion
+
+namespace HeuristicLab.IGraph.Wrappers {
+  public delegate bool BreadthFirstHandler(Graph g, int currentVertexId, int previousVertexId, int nextVertexId, int rank, int distance, object tag);
+  public delegate bool DepthFirstHandler(Graph g, int vertexId, int distance, object tag);
+
+  public enum DirectedWalkMode {
+    Outgoing = 1,
+    Incoming = 2,
+    All = 3,
+  }
+}
Index: /stable/HeuristicLab.ExtLibs/HeuristicLab.Igraph/0.8.0-pre/HeuristicLab.Igraph-0.8.0-pre/Wrappers/Graph.cs
===================================================================
--- /stable/HeuristicLab.ExtLibs/HeuristicLab.Igraph/0.8.0-pre/HeuristicLab.Igraph-0.8.0-pre/Wrappers/Graph.cs	(revision 15130)
+++ /stable/HeuristicLab.ExtLibs/HeuristicLab.Igraph/0.8.0-pre/HeuristicLab.Igraph-0.8.0-pre/Wrappers/Graph.cs	(revision 15130)
@@ -0,0 +1,146 @@
+﻿#region License Information
+/* HeuristicLab
+ * Copyright (C) 2002-2016 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
+ *
+ * This file is part of HeuristicLab.
+ *
+ * HeuristicLab 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.
+ *
+ * HeuristicLab 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 HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
+ */
+#endregion
+
+using System;
+using System.Collections.Generic;
+
+namespace HeuristicLab.IGraph.Wrappers {
+  public sealed class Graph : IDisposable {
+    private igraph_t graph;
+    internal igraph_t NativeInstance { get { return graph; } }
+
+    public int Vertices { get { return graph.n; } }
+    public bool IsDirected { get { return graph.directed; } }
+
+    public Graph() : this(0) { }
+    public Graph(int vertices) : this(vertices, false) { }
+    public Graph(int vertices, bool directed) {
+      graph = new igraph_t();
+      DllImporter.igraph_empty(graph, vertices, directed);
+    }
+    public Graph(int vertices, IEnumerable<Tuple<int, int>> edges) : this(vertices, edges, false) { }
+    public Graph(int vertices, IEnumerable<Tuple<int, int>> edges, bool directed) {
+      graph = new igraph_t();
+      DllImporter.igraph_empty(graph, vertices, directed);
+      foreach (var e in edges)
+        DllImporter.igraph_add_edge(graph, e.Item1, e.Item2);
+    }
+    ~Graph() {
+      DllImporter.igraph_destroy(graph);
+    }
+
+    public void Dispose() {
+      if (graph == null) return;
+      DllImporter.igraph_destroy(graph);
+      graph = null;
+      GC.SuppressFinalize(this);
+    }
+
+    public void SetSeed(uint seed) {
+      DllImporter.igraph_rng_seed(seed);
+    }
+
+    public int RandomInteger(int inclLower, int inclUpper) {
+      return DllImporter.igraph_rng_get_integer(inclLower, inclUpper);
+    }
+
+    public double Density() {
+      double density;
+      DllImporter.igraph_density(graph, out density, false);
+      return density;
+    }
+
+    public Vector PageRank(double damping = 0.85, Vector weights = null) {
+      var vec = new Vector(Vertices);
+      var all = new igraph_vs_t();
+      DllImporter.igraph_vs_all(ref all);
+      try {
+        double eigenv = 0;
+        DllImporter.igraph_pagerank(graph, igraph_pagerank_algo_t.IGRAPH_PAGERANK_ALGO_PRPACK, vec.NativeInstance, out eigenv, all, IsDirected, damping, weights != null ? weights.NativeInstance : null);
+      } finally {
+        DllImporter.igraph_vs_destroy(ref all);
+      }
+      return vec;
+    }
+
+    public Matrix LayoutWithFruchtermanReingold(Matrix initialCoords = null) {
+      return LayoutWithFruchtermanReingold(500, Math.Sqrt(Vertices), initialCoords);
+    }
+    public Matrix LayoutWithFruchtermanReingold(int niter, double startTemp, Matrix initialCoords = null) {
+      if (initialCoords != null && (initialCoords.Rows != Vertices || initialCoords.Columns != 2))
+        throw new ArgumentException("Initial coordinate matrix does not contain the required number of rows and columns.", "initialCoords");
+      var coords = initialCoords != null ? new Matrix(initialCoords) : new Matrix(Vertices, 2);
+      DllImporter.igraph_layout_fruchterman_reingold(graph, coords.NativeInstance, initialCoords != null, niter, startTemp, igraph_layout_grid_t.IGRAPH_LAYOUT_AUTOGRID, null, null, null, null, null);
+      return coords;
+    }
+
+    public Matrix LayoutWithKamadaKawai(Matrix initialCoords = null) {
+      return LayoutWithKamadaKawai(50 * Vertices, 0, Vertices, initialCoords);
+    }
+    public Matrix LayoutWithKamadaKawai(int maxiter, double epsilon, double kkconst, Matrix initialCoords = null) {
+      if (initialCoords != null && (initialCoords.Rows != Vertices || initialCoords.Columns != 2))
+        throw new ArgumentException("Initial coordinate matrix does not contain the required number of rows and columns.", "initialCoords");
+      var coords = initialCoords != null ? new Matrix(initialCoords) : new Matrix(Vertices, 2);
+      DllImporter.igraph_layout_kamada_kawai(graph, coords.NativeInstance, initialCoords != null, maxiter, epsilon, kkconst, null, null, null, null, null);
+      return coords;
+    }
+
+    public Matrix LayoutWithDavidsonHarel(Matrix initialCoords = null) {
+      var density = Density();
+      return LayoutWithDavidsonHarel(10, Math.Max(10, (int)Math.Log(Vertices, 2)), 0.75, 1.0, 0.0, density / 10.0, 1.0 - Math.Sqrt(density), 0.2 * (1 - density), initialCoords);
+    }
+    public Matrix LayoutWithDavidsonHarel(int maxiter, int fineiter, double cool_fact, double weight_node_dist, double weight_border, double weight_edge_lengths, double weight_edge_crossings, double weight_node_edge_dist, Matrix initialCoords = null) {
+      if (initialCoords != null && (initialCoords.Rows != Vertices || initialCoords.Columns != 2))
+        throw new ArgumentException("Initial coordinate matrix does not contain the required number of rows and columns.", "initialCoords");
+      var coords = initialCoords != null ? new Matrix(initialCoords) : new Matrix(Vertices, 2);
+      DllImporter.igraph_layout_davidson_harel(graph, coords.NativeInstance, initialCoords != null, maxiter, fineiter, cool_fact, weight_node_dist, weight_border, weight_edge_lengths, weight_edge_crossings, weight_node_edge_dist);
+      return coords;
+    }
+
+    /// <summary>
+    /// Use multi-dimensional scaling to layout vertices. 
+    /// A distance matrix can be used to specify the distances between the vertices.
+    /// Otherwise the distances will be calculated by shortest-path-length.
+    /// </summary>
+    /// <remarks>
+    /// For disconnected graphs, dimension must be 2.
+    /// </remarks>
+    /// <param name="dist">The distance matrix to layout the vertices.</param>
+    /// <param name="dim">How many dimensions should be used.</param>
+    /// <returns>The coordinates matrix of the aligned vertices.</returns>
+    public Matrix LayoutWithMds(Matrix dist = null, int dim = 2) {
+      var coords = new Matrix(Vertices, dim);
+      DllImporter.igraph_layout_mds(graph, coords.NativeInstance, dist != null ? dist.NativeInstance : null, dim);
+      return coords;
+    }
+
+    public void BreadthFirstWalk(BreadthFirstHandler handler, int root, DirectedWalkMode mode, bool includeUnreachableFromRoot = false, object tag = null) {
+      igraph_bfshandler_t wrapper = (t, vid, pred, succ, rank, dist, extra) => handler != null && handler(this, vid, pred, succ, rank, dist, tag);
+      DllImporter.igraph_bfs(graph, root, null, (igraph_neimode_t)mode, includeUnreachableFromRoot, null, null, null, null, null, null, null, wrapper, tag);
+    }
+
+    public void DepthFirstWalk(DepthFirstHandler inHandler, DepthFirstHandler outHandler, int root, DirectedWalkMode mode, bool includeUnreachableFromRoot = false, object tag = null) {
+      igraph_dfshandler_t inWrapper = (t, vid, dist, extra) => inHandler != null && inHandler(this, vid, dist, tag);
+      igraph_dfshandler_t outWrapper = (t, vid, dist, extra) => outHandler != null && outHandler(this, vid, dist, tag);
+      DllImporter.igraph_dfs(graph, root, (igraph_neimode_t)mode, includeUnreachableFromRoot, null, null, null, null, inWrapper, outWrapper, tag);
+    }
+  }
+}
Index: /stable/HeuristicLab.ExtLibs/HeuristicLab.Igraph/0.8.0-pre/HeuristicLab.Igraph-0.8.0-pre/Wrappers/Matrix.cs
===================================================================
--- /stable/HeuristicLab.ExtLibs/HeuristicLab.Igraph/0.8.0-pre/HeuristicLab.Igraph-0.8.0-pre/Wrappers/Matrix.cs	(revision 15130)
+++ /stable/HeuristicLab.ExtLibs/HeuristicLab.Igraph/0.8.0-pre/HeuristicLab.Igraph-0.8.0-pre/Wrappers/Matrix.cs	(revision 15130)
@@ -0,0 +1,97 @@
+﻿#region License Information
+/* HeuristicLab
+ * Copyright (C) 2002-2016 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
+ *
+ * This file is part of HeuristicLab.
+ *
+ * HeuristicLab 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.
+ *
+ * HeuristicLab 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 HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
+ */
+#endregion
+
+using System;
+
+namespace HeuristicLab.IGraph.Wrappers {
+  public sealed class Matrix : IDisposable {
+    igraph_matrix_t matrix;
+    internal igraph_matrix_t NativeInstance { get { return matrix; } }
+    public int Rows { get { return matrix.nrow; } }
+    public int Columns { get { return matrix.ncol; } }
+
+    public Matrix(int nrow, int ncol) {
+      if (nrow < 0 || ncol < 0) throw new ArgumentException("Rows and Columns must be >= 0");
+      matrix = new igraph_matrix_t();
+      DllImporter.igraph_matrix_init(matrix, nrow, ncol);
+    }
+    public Matrix(Matrix other) {
+      if (other == null) throw new ArgumentNullException("other");
+      matrix = new igraph_matrix_t();
+      DllImporter.igraph_matrix_copy(matrix, other.NativeInstance);
+    }
+    public Matrix(double[,] mat) {
+      if (mat == null) throw new ArgumentNullException("mat");
+      matrix = new igraph_matrix_t();
+      var nrows = mat.GetLength(0);
+      var ncols = mat.GetLength(1);
+      DllImporter.igraph_matrix_init(matrix, nrows, ncols);
+      var colwise = new double[ncols * nrows];
+      for (var j = 0; j < ncols; j++)
+        for (var i = 0; i < nrows; i++)
+          colwise[j * nrows + i] = mat[i, j];
+      DllImporter.igraph_vector_init_copy(matrix.data, colwise);
+    }
+    ~Matrix() {
+      DllImporter.igraph_matrix_destroy(matrix);
+    }
+
+    public void Dispose() {
+      if (matrix == null) return;
+      DllImporter.igraph_matrix_destroy(matrix);
+      matrix = null;
+      GC.SuppressFinalize(this);
+    }
+
+    public void Fill(double v) {
+      DllImporter.igraph_matrix_fill(matrix, v);
+    }
+
+    public void Transpose() {
+      DllImporter.igraph_matrix_transpose(matrix);
+    }
+
+    public void Scale(double by) {
+      DllImporter.igraph_matrix_scale(matrix, by);
+    }
+
+    public double this[int row, int col] {
+      get {
+        if (row < 0 || row > Rows || col < 0 || col > Columns) throw new IndexOutOfRangeException("Trying to get cell(" + row + ";" + col + ") of matrix(" + Rows + ";" + Columns + ").");
+        return DllImporter.igraph_matrix_e(matrix, row, col);
+      }
+      set {
+        if (row < 0 || row > Rows || col < 0 || col > Columns) throw new IndexOutOfRangeException("Trying to set cell(" + row + ";" + col + ") of matrix(" + Rows + ";" + Columns + ").");
+        DllImporter.igraph_matrix_set(matrix, row, col, value);
+      }
+    }
+
+    public double[,] ToMatrix() {
+      var result = new double[Rows, Columns];
+      for (var i = 0; i < Rows; i++) {
+        for (var j = 0; j < Columns; j++) {
+          result[i, j] = DllImporter.igraph_matrix_e(matrix, i, j);
+        }
+      }
+      return result;
+    }
+  }
+}
Index: /stable/HeuristicLab.ExtLibs/HeuristicLab.Igraph/0.8.0-pre/HeuristicLab.Igraph-0.8.0-pre/Wrappers/Vector.cs
===================================================================
--- /stable/HeuristicLab.ExtLibs/HeuristicLab.Igraph/0.8.0-pre/HeuristicLab.Igraph-0.8.0-pre/Wrappers/Vector.cs	(revision 15130)
+++ /stable/HeuristicLab.ExtLibs/HeuristicLab.Igraph/0.8.0-pre/HeuristicLab.Igraph-0.8.0-pre/Wrappers/Vector.cs	(revision 15130)
@@ -0,0 +1,96 @@
+﻿#region License Information
+/* HeuristicLab
+ * Copyright (C) 2002-2016 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
+ *
+ * This file is part of HeuristicLab.
+ *
+ * HeuristicLab 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.
+ *
+ * HeuristicLab 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 HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
+ */
+#endregion
+
+using System;
+using System.Collections.Generic;
+using System.Linq;
+
+namespace HeuristicLab.IGraph.Wrappers {
+  public sealed class Vector : IDisposable {
+    private igraph_vector_t vector;
+
+    internal igraph_vector_t NativeInstance {
+      get { return vector; }
+    }
+
+    public int Length {
+      get { return DllImporter.igraph_vector_size(vector); }
+    }
+
+    public Vector(int length) {
+      if (length < 0) throw new ArgumentException("Rows and Columns must be >= 0");
+      vector = new igraph_vector_t();
+      DllImporter.igraph_vector_init(vector, length);
+    }
+    public Vector(IEnumerable<double> data) {
+      if (data == null) throw new ArgumentNullException("data");
+      var vec = data.ToArray();
+      vector = new igraph_vector_t();
+      DllImporter.igraph_vector_init_copy(vector, vec);
+    }
+    public Vector(Vector other) {
+      if (other == null) throw new ArgumentNullException("other");
+      vector = new igraph_vector_t();
+      DllImporter.igraph_vector_copy(vector, other.NativeInstance);
+    }
+    ~Vector() {
+      DllImporter.igraph_vector_destroy(vector);
+    }
+
+    public void Dispose() {
+      if (vector == null) return;
+      DllImporter.igraph_vector_destroy(vector);
+      vector = null;
+      GC.SuppressFinalize(this);
+    }
+
+    public void Fill(double v) {
+      DllImporter.igraph_vector_fill(vector, v);
+    }
+
+    public void Reverse() {
+      DllImporter.igraph_vector_reverse(vector);
+    }
+
+    public void Shuffle() {
+      DllImporter.igraph_vector_shuffle(vector);
+    }
+
+    public void Scale(double by) {
+      DllImporter.igraph_vector_scale(vector, by);
+    }
+
+    public double this[int index] {
+      get {
+        if (index < 0 || index > Length) throw new IndexOutOfRangeException("Trying to get index(" + index + ") of vector(" + Length + ").");
+        return DllImporter.igraph_vector_e(vector, index);
+      }
+      set {
+        if (index < 0 || index > Length) throw new IndexOutOfRangeException("Trying to set index(" + index + ") of vector(" + Length + ").");
+        DllImporter.igraph_vector_set(vector, index, value);
+      }
+    }
+
+    public double[] ToArray() {
+      return DllImporter.igraph_vector_to_array(vector);
+    }
+  }
+}
Index: /stable/HeuristicLab.ExtLibs/HeuristicLab.Igraph/0.8.0-pre/HeuristicLab.Igraph-0.8.0-pre/igraph-0.8.0-pre-license.txt
===================================================================
--- /stable/HeuristicLab.ExtLibs/HeuristicLab.Igraph/0.8.0-pre/HeuristicLab.Igraph-0.8.0-pre/igraph-0.8.0-pre-license.txt	(revision 15130)
+++ /stable/HeuristicLab.ExtLibs/HeuristicLab.Igraph/0.8.0-pre/HeuristicLab.Igraph-0.8.0-pre/igraph-0.8.0-pre-license.txt	(revision 15130)
@@ -0,0 +1,139 @@
+﻿1. THE GNU GENERAL PUBLIC LICENSE
+
+Copyright © 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.
+
+1.1. Preamble
+1.2. GNU GENERAL PUBLIC LICENSE
+1.3. How to Apply These Terms to Your New Programs
+
+1.1. 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.
+1.2. 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:
+
+    You must cause the modified files to carry prominent notices stating that you changed the files and the date of any change.
+
+    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.
+
+    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:
+
+    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,
+
+    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,
+
+    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
+1.3. 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., 59 Temple Place, Suite 330, Boston, MA  02111-1307  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.
Index: /stable/HeuristicLab.Tests/Builder.testsettings
===================================================================
--- /stable/HeuristicLab.Tests/Builder.testsettings	(revision 15129)
+++ /stable/HeuristicLab.Tests/Builder.testsettings	(revision 15130)
@@ -3,5 +3,4 @@
   <Description>Test settings to run unit tests on the HL build server.</Description>
   <Deployment>
-    <DeploymentItem filename="HeuristicLab.Tests\HeuristicLab-3.3\Resources\" />
     <DeploymentItem filename="bin\" />
   </Deployment>
@@ -27,3 +26,4 @@
     </AgentRule>
   </Execution>
+  <Properties />
 </TestSettings>
Index: /stable/HeuristicLab.Tests/HeuristicLab.IGraph/IGraphLayoutTest.cs
===================================================================
--- /stable/HeuristicLab.Tests/HeuristicLab.IGraph/IGraphLayoutTest.cs	(revision 15130)
+++ /stable/HeuristicLab.Tests/HeuristicLab.IGraph/IGraphLayoutTest.cs	(revision 15130)
@@ -0,0 +1,85 @@
+﻿#region License Information
+/* HeuristicLab
+ * Copyright (C) 2002-2016 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
+ *
+ * This file is part of HeuristicLab.
+ *
+ * HeuristicLab 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.
+ *
+ * HeuristicLab 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 HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
+ */
+#endregion
+
+using System;
+using HeuristicLab.Common;
+using HeuristicLab.IGraph.Wrappers;
+using Microsoft.VisualStudio.TestTools.UnitTesting;
+
+namespace HeuristicLab.Tests {
+  [TestClass]
+  public class IGraphLayoutTest {
+    [TestMethod]
+    [TestCategory("ExtLibs")]
+    [TestCategory("ExtLibs.igraph")]
+    [TestProperty("Time", "short")]
+    public void IGraphWrappersLayoutFruchtermanReingoldTest() {
+      var graph = new Graph(5, new[] {
+        Tuple.Create(0, 1),
+        Tuple.Create(0, 2),
+        Tuple.Create(1, 2),
+        Tuple.Create(2, 3),
+        Tuple.Create(2, 4),
+        Tuple.Create(3, 4),
+      });
+      Assert.AreEqual(5, graph.Vertices);
+      try {
+        using (var matrix = graph.LayoutWithFruchtermanReingold()) {
+          Assert.AreEqual(5, matrix.Rows);
+          Assert.AreEqual(2, matrix.Columns);
+        }
+      } catch { Assert.Fail("Layouting with fruchterman-reingold using default parameters failed."); }
+
+      try {
+        using (var matrix = new Matrix(1, 1)) {
+          graph.LayoutWithFruchtermanReingold(50, 2, matrix);
+        }
+        Assert.Fail("Layouting with fruchterman-reingold using too little pre-initialized coordinates failed.");
+      } catch (ArgumentException) { }
+
+      try {
+        using (var matrix = new Matrix(7, 3)) {
+          graph.LayoutWithFruchtermanReingold(50, 2, matrix);
+          Assert.Fail("Layouting with fruchterman-reingold using too many pre-initialized coordinates failed.");
+        }
+      } catch (ArgumentException) { }
+
+      try {
+        using (var matrix = new Matrix(5, 2)) {
+          matrix[0, 0] = matrix[0, 1] = 1;
+          matrix[1, 0] = matrix[1, 1] = 2;
+          matrix[2, 0] = matrix[2, 1] = 3;
+          matrix[3, 0] = matrix[3, 1] = 4;
+          matrix[4, 0] = matrix[4, 1] = 5;
+          graph.LayoutWithFruchtermanReingold(50, 2, matrix);
+          Assert.AreEqual(5, matrix.Rows);
+          Assert.AreEqual(2, matrix.Columns);
+          Assert.IsFalse(
+               matrix[0, 0].IsAlmost(1) && matrix[0, 1].IsAlmost(1)
+            && matrix[1, 0].IsAlmost(2) && matrix[1, 1].IsAlmost(2)
+            && matrix[2, 0].IsAlmost(2) && matrix[2, 1].IsAlmost(2)
+            && matrix[3, 0].IsAlmost(2) && matrix[3, 1].IsAlmost(2)
+            && matrix[4, 0].IsAlmost(2) && matrix[4, 1].IsAlmost(2));
+        }
+      } catch { Assert.Fail("Layouting with fruchterman-reingold using pre-initialized coordinates failed."); }
+    }
+  }
+}
Index: /stable/HeuristicLab.Tests/HeuristicLab.IGraph/IGraphWrappersGraphTest.cs
===================================================================
--- /stable/HeuristicLab.Tests/HeuristicLab.IGraph/IGraphWrappersGraphTest.cs	(revision 15130)
+++ /stable/HeuristicLab.Tests/HeuristicLab.IGraph/IGraphWrappersGraphTest.cs	(revision 15130)
@@ -0,0 +1,190 @@
+﻿#region License Information
+/* HeuristicLab
+ * Copyright (C) 2002-2016 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
+ *
+ * This file is part of HeuristicLab.
+ *
+ * HeuristicLab 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.
+ *
+ * HeuristicLab 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 HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
+ */
+#endregion
+
+using System;
+using System.Collections.Generic;
+using HeuristicLab.Common;
+using HeuristicLab.IGraph.Wrappers;
+using Microsoft.VisualStudio.TestTools.UnitTesting;
+
+namespace HeuristicLab.Tests {
+  [TestClass]
+  [DeploymentItem("igraph-0.8.0-pre-x86.dll")]
+  [DeploymentItem("igraph-0.8.0-pre-x64.dll")]
+  public class IGraphWrappersGraphTest {
+    [TestMethod]
+    [TestCategory("ExtLibs")]
+    [TestCategory("ExtLibs.igraph")]
+    [TestProperty("Time", "short")]
+    public void IGraphWrappersGraphConstructionAndFinalizationTest() {
+      var graph = new Graph(5, new[] {
+        Tuple.Create(0, 1),
+        Tuple.Create(0, 2),
+        Tuple.Create(1, 2),
+        Tuple.Create(2, 3),
+        Tuple.Create(2, 4),
+        Tuple.Create(3, 4),
+      });
+      Assert.AreEqual(5, graph.Vertices);
+      Assert.IsFalse(graph.IsDirected);
+
+      graph = new Graph(3, new[] {
+        Tuple.Create(0, 1),
+        Tuple.Create(0, 2),
+        Tuple.Create(1, 2),
+      }, directed: true);
+      Assert.AreEqual(3, graph.Vertices);
+      Assert.IsTrue(graph.IsDirected);
+    }
+
+    [TestMethod]
+    [TestCategory("ExtLibs")]
+    [TestCategory("ExtLibs.igraph")]
+    [TestProperty("Time", "short")]
+    public void IGraphWrappersGraphDensityTest() {
+      var graph = new Graph(5, new[] {
+        Tuple.Create(0, 1),
+        Tuple.Create(0, 2),
+        Tuple.Create(1, 2),
+        Tuple.Create(2, 3),
+        Tuple.Create(2, 4),
+        Tuple.Create(3, 4),
+      });
+
+      var density = graph.Density();
+      // in un-directed graphs edges count twice
+      Assert.IsTrue(density.IsAlmost(12 / 20.0));
+
+      graph.Dispose();
+
+      graph = new Graph(5, new[] {
+        Tuple.Create(0, 1),
+        Tuple.Create(0, 2),
+        Tuple.Create(1, 2),
+        Tuple.Create(2, 3),
+        Tuple.Create(2, 4),
+        Tuple.Create(3, 4),
+      }, directed: true);
+
+      density = graph.Density();
+      // in directed graphs edges count twice
+      Assert.IsTrue(density.IsAlmost(6 / 20.0));
+    }
+
+    [TestMethod]
+    [TestCategory("ExtLibs")]
+    [TestCategory("ExtLibs.igraph")]
+    [TestProperty("Time", "short")]
+    public void IGraphWrappersGraphPageRankTest() {
+      var graph = new Graph(4, new[] {
+        Tuple.Create(0, 1),
+        Tuple.Create(0, 2),
+        Tuple.Create(1, 2),
+        Tuple.Create(2, 0),
+        Tuple.Create(3, 2),
+      }, directed: true);
+      var ranks = graph.PageRank();
+      Assert.AreEqual(4, ranks.Length);
+      Assert.AreEqual(0.372, ranks[0], 0.01);
+      Assert.AreEqual(0.195, ranks[1], 0.01);
+      Assert.AreEqual(0.394, ranks[2], 0.01);
+      Assert.AreEqual(0.037, ranks[3], 0.01);
+
+      graph = new Graph(4, new[] {
+        Tuple.Create(0, 1),
+        Tuple.Create(1, 2),
+        Tuple.Create(2, 3),
+        Tuple.Create(3, 0),
+      }, directed: true);
+      ranks = graph.PageRank();
+      Assert.AreEqual(4, ranks.Length);
+      Assert.AreEqual(0.250, ranks[0], 0.01);
+      Assert.AreEqual(0.250, ranks[1], 0.01);
+      Assert.AreEqual(0.250, ranks[2], 0.01);
+      Assert.AreEqual(0.250, ranks[3], 0.01);
+
+      graph = new Graph(4, new[] {
+        Tuple.Create(0, 1),
+        Tuple.Create(0, 2),
+        Tuple.Create(0, 3),
+        Tuple.Create(1, 0),
+        Tuple.Create(2, 0),
+        Tuple.Create(3, 0),
+      }, directed: true);
+      ranks = graph.PageRank();
+      Assert.AreEqual(4, ranks.Length);
+      Assert.AreEqual(0.480, ranks[0], 0.01);
+      Assert.AreEqual(0.173, ranks[1], 0.01);
+      Assert.AreEqual(0.173, ranks[2], 0.01);
+      Assert.AreEqual(0.173, ranks[3], 0.01);
+    }
+
+    [TestMethod]
+    [TestCategory("ExtLibs")]
+    [TestCategory("ExtLibs.igraph")]
+    [TestProperty("Time", "short")]
+    public void IGraphWrappersGraphBreadthFirstWalkTest() {
+      var graph = new Graph(4, new[] {
+        Tuple.Create(0, 1),
+        Tuple.Create(0, 2),
+        Tuple.Create(1, 2),
+        Tuple.Create(2, 0),
+        Tuple.Create(3, 2),
+      }, directed: true);
+      var visited = new HashSet<int>();
+      BreadthFirstHandler handler = (graph1, currentVertexId, previousVertexId, nextVertexId, rank, distance, tag) => {
+        visited.Add(currentVertexId);
+        return false;
+      };
+      graph.BreadthFirstWalk(handler, 0, DirectedWalkMode.All, true, null);
+      Assert.AreEqual(4, visited.Count);
+      Assert.IsTrue(visited.Contains(0));
+      Assert.IsTrue(visited.Contains(1));
+      Assert.IsTrue(visited.Contains(2));
+      Assert.IsTrue(visited.Contains(3));
+    }
+
+    [TestMethod]
+    [TestCategory("ExtLibs")]
+    [TestCategory("ExtLibs.igraph")]
+    [TestProperty("Time", "short")]
+    public void IGraphWrappersGraphDepthFirstWalkTest() {
+      var graph = new Graph(4, new[] {
+        Tuple.Create(0, 1),
+        Tuple.Create(0, 2),
+        Tuple.Create(1, 2),
+        Tuple.Create(2, 0),
+        Tuple.Create(3, 2),
+      }, directed: true);
+      var visited = new HashSet<int>();
+      DepthFirstHandler handler = (graph1, vertexId, distance, tag) => {
+        visited.Add(vertexId);
+        return false;
+      };
+      graph.DepthFirstWalk(handler, handler, 0, DirectedWalkMode.All, true, null);
+      Assert.AreEqual(4, visited.Count);
+      Assert.IsTrue(visited.Contains(0));
+      Assert.IsTrue(visited.Contains(1));
+      Assert.IsTrue(visited.Contains(2));
+      Assert.IsTrue(visited.Contains(3));
+    }
+  }
+}
Index: /stable/HeuristicLab.Tests/HeuristicLab.IGraph/IGraphWrappersMatrixTest.cs
===================================================================
--- /stable/HeuristicLab.Tests/HeuristicLab.IGraph/IGraphWrappersMatrixTest.cs	(revision 15130)
+++ /stable/HeuristicLab.Tests/HeuristicLab.IGraph/IGraphWrappersMatrixTest.cs	(revision 15130)
@@ -0,0 +1,130 @@
+﻿#region License Information
+/* HeuristicLab
+ * Copyright (C) 2002-2016 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
+ *
+ * This file is part of HeuristicLab.
+ *
+ * HeuristicLab 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.
+ *
+ * HeuristicLab 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 HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
+ */
+#endregion
+
+using HeuristicLab.IGraph.Wrappers;
+using Microsoft.VisualStudio.TestTools.UnitTesting;
+
+namespace HeuristicLab.Tests {
+  [TestClass]
+  public class IGraphWrappersMatrixTest {
+    [TestMethod]
+    [TestCategory("ExtLibs")]
+    [TestCategory("ExtLibs.igraph")]
+    [TestProperty("Time", "short")]
+    public void IGraphWrappersMatrixConstructionAndFinalizationTest() {
+      var matrix = new Matrix(3, 2);
+      Assert.AreEqual(3, matrix.Rows);
+      Assert.AreEqual(2, matrix.Columns);
+      Assert.AreEqual(0, matrix[0, 0]);
+      matrix[0, 0] = 4;
+      var other = new Matrix(matrix);
+      Assert.AreEqual(3, other.Rows);
+      Assert.AreEqual(2, other.Columns);
+      Assert.AreEqual(4, other[0, 0]);
+
+      var mat = new double[,] {
+        { 1, 2, 3 },
+        { 4, 5, 6}
+      };
+      matrix = new Matrix(mat);
+      Assert.AreEqual(2, matrix.Rows);
+      Assert.AreEqual(3, matrix.Columns);
+      var test = matrix.ToMatrix();
+      for (var i = 0; i < matrix.Rows; i++)
+        for (var j = 0; j < matrix.Columns; j++) {
+          Assert.AreEqual(mat[i, j], matrix[i, j]);
+          Assert.AreEqual(mat[i, j], test[i, j]);
+        }
+    }
+
+    [TestMethod]
+    [TestCategory("ExtLibs")]
+    [TestCategory("ExtLibs.igraph")]
+    [TestProperty("Time", "short")]
+    public void IGraphWrappersMatrixGetSetTest() {
+      var matrix = new Matrix(3, 2);
+      matrix[0, 0] = matrix[0, 1] = 4;
+      matrix[1, 0] = 3;
+      matrix[1, 1] = 2;
+      matrix[2, 0] = 1.5;
+      matrix[2, 1] = -0.5;
+      Assert.AreEqual(4, matrix[0, 0]);
+      Assert.AreEqual(4, matrix[0, 1]);
+      Assert.AreEqual(3, matrix[1, 0]);
+      Assert.AreEqual(2, matrix[1, 1]);
+      Assert.AreEqual(1.5, matrix[2, 0]);
+      Assert.AreEqual(-0.5, matrix[2, 1]);
+
+      var netmat = matrix.ToMatrix();
+      Assert.AreEqual(3, netmat.GetLength(0));
+      Assert.AreEqual(2, netmat.GetLength(1));
+      for (var i = 0; i < netmat.GetLength(0); i++)
+        for (var j = 0; j < netmat.GetLength(1); j++)
+          Assert.AreEqual(matrix[i, j], netmat[i, j]);
+    }
+
+    [TestMethod]
+    [TestCategory("ExtLibs")]
+    [TestCategory("ExtLibs.igraph")]
+    [TestProperty("Time", "short")]
+    public void IGraphWrappersMatrixFillTest() {
+      var matrix = new Matrix(3, 2);
+      matrix.Fill(2.6);
+      Assert.AreEqual(2.6, matrix[0, 0]);
+      Assert.AreEqual(2.6, matrix[0, 1]);
+      Assert.AreEqual(2.6, matrix[1, 0]);
+      Assert.AreEqual(2.6, matrix[1, 1]);
+      Assert.AreEqual(2.6, matrix[2, 0]);
+      Assert.AreEqual(2.6, matrix[2, 1]);
+    }
+
+    [TestMethod]
+    [TestCategory("ExtLibs")]
+    [TestCategory("ExtLibs.igraph")]
+    [TestProperty("Time", "short")]
+    public void IGraphWrappersMatrixTransposeTest() {
+      var matrix = new Matrix(3, 2);
+      matrix.Transpose();
+      Assert.AreEqual(2, matrix.Rows);
+      Assert.AreEqual(3, matrix.Columns);
+    }
+
+    [TestMethod]
+    [TestCategory("ExtLibs")]
+    [TestCategory("ExtLibs.igraph")]
+    [TestProperty("Time", "short")]
+    public void IGraphWrappersMatrixScaleTest() {
+      var matrix = new Matrix(3, 2);
+      matrix[0, 0] = matrix[0, 1] = 4;
+      matrix[1, 0] = 3;
+      matrix[1, 1] = 2;
+      matrix[2, 0] = 1.5;
+      matrix[2, 1] = -0.5;
+      matrix.Scale(2);
+      Assert.AreEqual(8, matrix[0, 0]);
+      Assert.AreEqual(8, matrix[0, 1]);
+      Assert.AreEqual(6, matrix[1, 0]);
+      Assert.AreEqual(4, matrix[1, 1]);
+      Assert.AreEqual(3, matrix[2, 0]);
+      Assert.AreEqual(-1, matrix[2, 1]);
+    }
+  }
+}
Index: /stable/HeuristicLab.Tests/HeuristicLab.IGraph/IGraphWrappersVectorTest.cs
===================================================================
--- /stable/HeuristicLab.Tests/HeuristicLab.IGraph/IGraphWrappersVectorTest.cs	(revision 15130)
+++ /stable/HeuristicLab.Tests/HeuristicLab.IGraph/IGraphWrappersVectorTest.cs	(revision 15130)
@@ -0,0 +1,125 @@
+﻿#region License Information
+/* HeuristicLab
+ * Copyright (C) 2002-2016 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
+ *
+ * This file is part of HeuristicLab.
+ *
+ * HeuristicLab 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.
+ *
+ * HeuristicLab 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 HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
+ */
+#endregion
+
+using System.Linq;
+using HeuristicLab.IGraph.Wrappers;
+using Microsoft.VisualStudio.TestTools.UnitTesting;
+
+namespace HeuristicLab.Tests {
+  [TestClass]
+  public class IGraphWrappersVectorTest {
+    [TestMethod]
+    [TestCategory("ExtLibs")]
+    [TestCategory("ExtLibs.igraph")]
+    [TestProperty("Time", "short")]
+    public void IGraphWrappersVectorConstructionAndFinalizationTest() {
+      var vector = new Vector(7);
+      Assert.AreEqual(7, vector.Length);
+      Assert.AreEqual(0, vector[0]);
+      vector[0] = 4;
+      var other = new Vector(vector);
+      Assert.AreEqual(7, other.Length);
+      Assert.AreEqual(4, other[0]);
+
+      var myvec = new double[] { 1, 2, 3 };
+      vector = new Vector(myvec);
+      Assert.AreEqual(3, vector.Length);
+      Assert.AreEqual(myvec[0], vector[0]);
+      Assert.AreEqual(myvec[1], vector[1]);
+      Assert.AreEqual(myvec[2], vector[2]);
+    }
+
+    [TestMethod]
+    [TestCategory("ExtLibs")]
+    [TestCategory("ExtLibs.igraph")]
+    [TestProperty("Time", "short")]
+    public void IGraphWrappersVectorGetSetTest() {
+      var vector = new Vector(5);
+      vector[0] = vector[1] = 4;
+      vector[2] = 3;
+      vector[3] = 1.5;
+      vector[4] = -0.5;
+      Assert.AreEqual(4, vector[0]);
+      Assert.AreEqual(4, vector[1]);
+      Assert.AreEqual(3, vector[2]);
+      Assert.AreEqual(1.5, vector[3]);
+      Assert.AreEqual(-0.5, vector[4]);
+
+      var netmat = vector.ToArray();
+      Assert.AreEqual(5, netmat.Length);
+      for (var i = 0; i < netmat.Length; i++)
+        Assert.AreEqual(vector[i], netmat[i]);
+    }
+
+    [TestMethod]
+    [TestCategory("ExtLibs")]
+    [TestCategory("ExtLibs.igraph")]
+    [TestProperty("Time", "short")]
+    public void IGraphWrappersVectorFillTest() {
+      var vector = new Vector(5);
+      vector.Fill(2.3);
+      Assert.IsTrue(new[] { 2.3, 2.3, 2.3, 2.3, 2.3 }.SequenceEqual(vector.ToArray()));
+    }
+
+    [TestMethod]
+    [TestCategory("ExtLibs")]
+    [TestCategory("ExtLibs.igraph")]
+    [TestProperty("Time", "short")]
+    public void IGraphWrappersVectorReverseTest() {
+      var vector = new Vector(5);
+      vector[0] = vector[1] = 4;
+      vector[2] = 3;
+      vector[3] = 1.5;
+      vector[4] = -0.5;
+      vector.Reverse();
+      Assert.IsTrue(new[] { -0.5, 1.5, 3, 4, 4 }.SequenceEqual(vector.ToArray()));
+    }
+
+    [TestMethod]
+    [TestCategory("ExtLibs")]
+    [TestCategory("ExtLibs.igraph")]
+    [TestProperty("Time", "short")]
+    public void IGraphWrappersVectorShuffleTest() {
+      var vector = new Vector(5);
+      vector[0] = vector[1] = 4;
+      vector[2] = 3;
+      vector[3] = 1.5;
+      vector[4] = -0.5;
+      vector.Shuffle();
+      Assert.IsFalse(new[] { -0.5, 1.5, 3, 4, 4 }.SequenceEqual(vector.ToArray()));
+      Assert.IsFalse(new[] { 4, 4, 3, 1.5, -0.5 }.SequenceEqual(vector.ToArray()));
+    }
+
+    [TestMethod]
+    [TestCategory("ExtLibs")]
+    [TestCategory("ExtLibs.igraph")]
+    [TestProperty("Time", "short")]
+    public void IGraphWrappersVectorScaleTest() {
+      var vector = new Vector(5);
+      vector[0] = vector[1] = 4;
+      vector[2] = 3;
+      vector[3] = 1.5;
+      vector[4] = -0.5;
+      vector.Scale(2);
+      Assert.IsTrue(new double[] { 8, 8, 6, 3, -1 }.SequenceEqual(vector.ToArray()));
+    }
+  }
+}
Index: /stable/HeuristicLab.Tests/HeuristicLab.Tests.csproj
===================================================================
--- /stable/HeuristicLab.Tests/HeuristicLab.Tests.csproj	(revision 15129)
+++ /stable/HeuristicLab.Tests/HeuristicLab.Tests.csproj	(revision 15130)
@@ -217,4 +217,9 @@
     <Reference Include="HeuristicLab.Encodings.SymbolicExpressionTreeEncoding-3.4">
       <HintPath>..\bin\HeuristicLab.Encodings.SymbolicExpressionTreeEncoding-3.4.dll</HintPath>
+      <Private>False</Private>
+    </Reference>
+    <Reference Include="HeuristicLab.IGraph-0.8.0-pre, Version=0.8.0.0, Culture=neutral, PublicKeyToken=ba48961d6f65dcec, processorArchitecture=MSIL">
+      <SpecificVersion>False</SpecificVersion>
+      <HintPath>..\bin\HeuristicLab.IGraph-0.8.0-pre.dll</HintPath>
       <Private>False</Private>
     </Reference>
@@ -680,4 +685,5 @@
     </EmbeddedResource>
   </ItemGroup>
+  <ItemGroup />
   <Import Project="$(MSBuildBinPath)\Microsoft.CSharp.targets" />
   <!-- To modify your build process, add your task inside one of the targets below and uncomment it. 
