| eca06a7 | Kolja Esders | 05 September 2017, 21:32:26 UTC | Merge branch 'Dev' * Dev: Updated version to 4.4 | 05 September 2017, 21:32:26 UTC |
| b15b3d3 | Kolja Esders | 05 September 2017, 21:32:05 UTC | Updated version to 4.4 | 05 September 2017, 21:32:05 UTC |
| aa97001 | Kolja Esders | 05 September 2017, 21:18:22 UTC | Merge branch 'Dev' * Dev: (41 commits) New feature: weakly connected components Ensure defined state of node vector after move More precise formulation for tie docs Docs regarding tie-breaks and call conventions getStack -> getNodesSortedByDistance and a bunch of doc fixes Bug fix. New feature: dynamic connected components. Fixed definition of restoreNode Exposing restoreNode on python layer tutorial brought to current release state Distance file updated. All simple paths class and test suite. Diameter: Avoid duplicate BFS LFRGenerator: add small constants to the parameters for the reference implementation LFRGenerator: fit correct mu value, adjust max. community size if necessary LFRGenerator: fix infinte loop in degree adjustment (Re-)Add the BTER wrapper class R-MAT fitting: use symmetric directed graph, fix calling of kronfit R-MAT generator: generate graphs without deleted nodes and exactly as many edges as requested EdgeListWriter: support writing edges in both directions ... | 05 September 2017, 21:18:22 UTC |
| 51c3a0e | Kolja Esders | 05 September 2017, 20:38:02 UTC | Merge pull request #68 from kit-parco/feature/weakly-connected-components New feature: weakly connected components | 05 September 2017, 20:38:02 UTC |
| cfa7714 | eug93 | 01 September 2017, 16:34:18 UTC | New feature: weakly connected components | 05 September 2017, 16:51:17 UTC |
| 141a8e0 | Kolja Esders | 05 September 2017, 16:33:39 UTC | Merge pull request #64 from kit-parco/feature/dyn-connected-components Feature/dyn connected components | 05 September 2017, 16:33:39 UTC |
| 10b9ffc | Kolja Esders | 05 September 2017, 16:27:11 UTC | Merge pull request #51 from kit-parco/feature/deprecate-SSSP-getStack Deprecate SSSP::getStack and replace with getDistanceVector | 05 September 2017, 16:27:11 UTC |
| c1b2986 | Kolja Esders | 05 September 2017, 16:20:51 UTC | Merge pull request #66 from kit-parco/revert-58-master Revert "SConstruct: Improved reading external library paths from build.conf" | 05 September 2017, 16:20:51 UTC |
| 7df0ed7 | Kolja Esders | 05 September 2017, 16:20:29 UTC | Revert "SConstruct: Improved reading external library paths from build.conf" | 05 September 2017, 16:20:29 UTC |
| ed35cff | Kolja Esders | 05 September 2017, 15:26:12 UTC | Merge pull request #54 from michitux/upstream/BTERReplicator (Re-)Add the BTER wrapper class | 05 September 2017, 15:26:12 UTC |
| 267f4cb | Kolja Esders | 05 September 2017, 15:24:54 UTC | Merge pull request #58 from pskopnik/master SConstruct: Improved reading external library paths from build.conf | 05 September 2017, 15:24:54 UTC |
| 24b4742 | Kolja Esders | 05 September 2017, 14:49:31 UTC | Merge pull request #52 from kit-parco/feature/scons-shared-library-build Shared library build in SCons | 05 September 2017, 14:49:31 UTC |
| c297f30 | Kolja Esders | 05 September 2017, 14:48:39 UTC | Merge pull request #55 from michitux/upstream/LFR-fixes Several fixes for the LFR generator | 05 September 2017, 14:48:39 UTC |
| e90d018 | Kolja Esders | 05 September 2017, 12:40:50 UTC | Ensure defined state of node vector after move | 05 September 2017, 12:40:50 UTC |
| 9875b4a | Kolja Esders | 04 September 2017, 22:12:23 UTC | Merge pull request #53 from michitux/upstream/RMAT-fixes R-MAT generator: several fixes and improvements | 04 September 2017, 22:12:23 UTC |
| 9335d33 | Kolja Esders | 04 September 2017, 22:12:00 UTC | Merge pull request #56 from michitux/upstream/diameter-opt Diameter: Avoid duplicate BFS | 04 September 2017, 22:12:00 UTC |
| eabe252 | Kolja Esders | 04 September 2017, 22:11:37 UTC | Merge pull request #61 from kit-parco/feature/expose-restore-node Expose restoreNode to Python | 04 September 2017, 22:11:37 UTC |
| e1fb6c5 | Kolja Esders | 04 September 2017, 22:11:19 UTC | Merge pull request #57 from kit-parco/feature/all-simple-paths Feature/all simple paths | 04 September 2017, 22:11:19 UTC |
| ad5fd6d | Paul Skopnik | 04 September 2017, 15:29:12 UTC | SConstruct: Added DefaultConfigParser | 04 September 2017, 15:29:12 UTC |
| dc9ec5c | Kolja Esders | 01 September 2017, 17:19:25 UTC | More precise formulation for tie docs | 01 September 2017, 17:19:25 UTC |
| b45324a | Kolja Esders | 01 September 2017, 17:12:32 UTC | Merge pull request #19 from michitux/upstream/weighted-PRN PageRankNibble adjusted for weighted graphs | 01 September 2017, 17:12:32 UTC |
| b4eda21 | Kolja Esders | 01 September 2017, 17:08:32 UTC | Docs regarding tie-breaks and call conventions | 01 September 2017, 17:08:32 UTC |
| 05b9a10 | Kolja Esders | 01 September 2017, 16:55:48 UTC | getStack -> getNodesSortedByDistance and a bunch of doc fixes | 01 September 2017, 16:55:48 UTC |
| cb42fc9 | eug93 | 01 September 2017, 15:42:37 UTC | Bug fix. | 01 September 2017, 15:42:37 UTC |
| 3759e6f | eug93 | 31 August 2017, 15:27:57 UTC | New feature: dynamic connected components. | 31 August 2017, 15:27:57 UTC |
| 5addccc | Kolja Esders | 30 August 2017, 21:49:28 UTC | Fixed definition of restoreNode | 30 August 2017, 21:49:28 UTC |
| c54b7fa | Kolja Esders | 30 August 2017, 21:27:22 UTC | Exposing restoreNode on python layer | 30 August 2017, 21:27:22 UTC |
| 6031a23 | Paul Skopnik | 29 August 2017, 12:07:32 UTC | SConstruct: Improved reading external library paths from build.conf | 29 August 2017, 12:07:32 UTC |
| 8704751 | Henning Meyerhenke | 29 August 2017, 08:51:57 UTC | tutorial brought to current release state | 29 August 2017, 08:51:57 UTC |
| 951bce2 | eug93 | 28 July 2017, 16:32:04 UTC | Distance file updated. | 28 July 2017, 16:32:04 UTC |
| b8d2eb6 | eug93 | 28 July 2017, 16:31:20 UTC | All simple paths class and test suite. | 28 July 2017, 16:31:20 UTC |
| 0a65467 | Michael Hamann | 17 July 2017, 16:36:34 UTC | Diameter: Avoid duplicate BFS This avoids some duplicate BFS by ensuring that the BFS from more central nodes start from nodes that have a positive distance from the last start node. If the previous start node is a degree-1-node, this also ensures that the next start node is away from the first node with a higher degree as otherwise we also would not get any new information. | 28 July 2017, 13:08:29 UTC |
| ee213d2 | Michael Hamann | 28 July 2017, 10:41:04 UTC | LFRGenerator: add small constants to the parameters for the reference implementation This avoids that the reference implementation says that the average degree is too low. | 28 July 2017, 11:40:21 UTC |
| 001b204 | Michael Hamann | 14 July 2017, 16:11:08 UTC | LFRGenerator: fit correct mu value, adjust max. community size if necessary | 28 July 2017, 11:40:21 UTC |
| cac903d | Michael Hamann | 14 July 2017, 16:09:19 UTC | LFRGenerator: fix infinte loop in degree adjustment In some cases, the intra-cluster degrees just cannot be changed to be even. This limits the number of attempts to the number of nodes in the cluster. | 28 July 2017, 11:40:21 UTC |
| 092d971 | Michael Hamann | 28 July 2017, 11:37:43 UTC | (Re-)Add the BTER wrapper class This provides a wrapper class for the BTER implementation FEASTPACK (http://www.sandia.gov/~tgkolda/feastpack/) | 28 July 2017, 11:37:43 UTC |
| b3d7d5b | Michael Hamann | 28 July 2017, 11:10:32 UTC | R-MAT fitting: use symmetric directed graph, fix calling of kronfit This changes the input of kronfit to be a symmetric directed edge list as kronfit reads directed graphs. Further, an explicit output file is given to kronfit and a proper temporary directory is used. | 28 July 2017, 11:10:32 UTC |
| af51cfe | Michael Hamann | 28 July 2017, 11:04:53 UTC | R-MAT generator: generate graphs without deleted nodes and exactly as many edges as requested This modifies the R-MAT generator in the following ways: - undirected graphs will contain exactly the number of (simple) edges to reach the given average degree. - in the output there will be no deleted nodes even if removeNodes is positives (the id range is compressed). - for weighted graphs, the number of edges to generate is estimated such that even with the deleted nodes from removeNodes, the total average weighted degree will be the given average degree. | 28 July 2017, 11:04:53 UTC |
| ece5452 | Michael Hamann | 28 July 2017, 11:03:28 UTC | EdgeListWriter: support writing edges in both directions | 28 July 2017, 11:03:28 UTC |
| a8db7b0 | Kolja Esders | 26 July 2017, 11:00:55 UTC | Linking correct library paths on all platforms | 26 July 2017, 11:00:55 UTC |
| 05cec46 | Kolja Esders | 26 July 2017, 10:59:32 UTC | Added build dbg folder and libs to gitignore | 26 July 2017, 10:59:32 UTC |
| 8d8e4aa | Kolja Esders | 26 July 2017, 01:15:12 UTC | Be more explicit regarding library creation | 26 July 2017, 01:15:12 UTC |
| 44d40c8 | Kolja Esders | 26 July 2017, 01:12:56 UTC | Added shared library option to SCons | 26 July 2017, 01:12:56 UTC |
| d716e23 | Kolja Esders | 26 July 2017, 00:07:09 UTC | stack include is no longer needed | 26 July 2017, 00:07:09 UTC |
| 450b36d | Kolja Esders | 25 July 2017, 23:52:34 UTC | Update python layer and add docs | 25 July 2017, 23:52:34 UTC |
| 89dcb58 | Kolja Esders | 25 July 2017, 23:52:24 UTC | Deprecate getStack in CPP layer and update docs | 25 July 2017, 23:52:24 UTC |
| 465a243 | Henning Meyerhenke | 18 July 2017, 15:11:27 UTC | Merge branch 'Dev' of https://github.com/kit-parco/networkit into Dev | 18 July 2017, 15:11:27 UTC |
| 8f927bb | Henning Meyerhenke | 18 July 2017, 15:09:18 UTC | doc fix for parallel conn comps | 18 July 2017, 15:09:18 UTC |
| f01f8c9 | Kolja Esders | 17 July 2017, 20:05:35 UTC | Merge pull request #47 from michitux/upstream/dealloc Cython: add two missing destructors | 17 July 2017, 20:05:35 UTC |
| 9650d77 | Kolja Esders | 17 July 2017, 20:04:43 UTC | Merge pull request #45 from michitux/upstream/unused-graph-parameters Graph: remove unused parameters | 17 July 2017, 20:04:43 UTC |
| d7a63e5 | Kolja Esders | 17 July 2017, 20:04:04 UTC | Merge pull request #46 from michitux/upstream/parallel-include auxiliary/Parallel.h: add missing include | 17 July 2017, 20:04:04 UTC |
| bb009b7 | Michael Hamann | 17 July 2017, 16:23:28 UTC | Cython: add two missing destructors | 17 July 2017, 16:23:28 UTC |
| cd9941f | Elisabetta Bergamini | 17 July 2017, 06:48:55 UTC | fixed wrong modules in documentation | 17 July 2017, 06:48:55 UTC |
| e085147 | Matteo Riondato | 14 July 2017, 13:31:00 UTC | Exit with non-zero status on errors. | 14 July 2017, 13:31:00 UTC |
| 387f33b | Matteo Riondato | 13 July 2017, 22:20:03 UTC | Add an option '--defines' to SConstruct, to allow passing defines on the command line. | 13 July 2017, 22:20:03 UTC |
| 804bbcb | Michael Hamann | 13 July 2017, 11:56:11 UTC | Graph: remove unused parameters This prevents some compiler warnings for unused parameters by removing their names. | 13 July 2017, 12:01:54 UTC |
| 75a5d6d | Michael Hamann | 13 July 2017, 11:58:25 UTC | auxiliary/Parallel.h: add missing include | 13 July 2017, 12:00:05 UTC |
| 01b5a3b | Matteo Riondato | 13 July 2017, 02:50:30 UTC | Mark DynAPSP::run() as override, to fix a warning. | 13 July 2017, 02:50:30 UTC |
| f952b95 | Matteo Riondato | 13 July 2017, 02:46:44 UTC | Make detection of GNU C++ compiler more robust. This change fixes the compilation of `scons --target=Lib --optimize=Core --std=c++1z` when the compiler is Clang/LLVM. | 13 July 2017, 02:46:44 UTC |
| 651d76e | Kolja Esders | 23 June 2017, 09:42:14 UTC | Merge pull request #42 from timostrunk/unsigned_zero_fix_in_octree Signed 0 default in Octree | 23 June 2017, 09:42:14 UTC |
| b2a1469 | Kolja Esders | 22 June 2017, 12:53:53 UTC | Merge pull request #41 from timostrunk/fix_unused_warnings Fixes many different unused warnings. | 22 June 2017, 12:53:53 UTC |
| 60fed10 | Timo Strunk | 12 June 2017, 15:50:47 UTC | 0 is signed by default, therefore ~0 is not (signed 0) and implementation specific. The intended value here, if I understand correctly, is UINT_MAX or 0xffffffff, therefore it should be 0U, however in the bitness of index: therefore static_cast<index>(0). Thoroughly check this commit before merging. | 12 June 2017, 15:50:47 UTC |
| a628af9 | Timo Strunk | 12 June 2017, 15:15:53 UTC | Fixes many different unused warnings by simply commenting the variable name. | 12 June 2017, 15:15:53 UTC |
| 84ad500 | Michael Hamann | 08 June 2017, 14:03:42 UTC | PageRankNibble: fix compilation errors | 08 June 2017, 14:03:42 UTC |
| c68d37d | Kolja Esders | 07 June 2017, 20:32:36 UTC | Added dist/ to .gitignore | 07 June 2017, 20:32:36 UTC |
| 6e23cb4 | Kolja Esders | 07 June 2017, 20:15:15 UTC | Added g++-7 to compiler candidates to test during installation | 07 June 2017, 20:15:15 UTC |
| 4ee8d2f | Kolja Esders | 07 June 2017, 19:43:20 UTC | Added MANIFEST.in back for python package deployment | 07 June 2017, 19:43:20 UTC |
| 59c2660 | Kolja Esders | 07 June 2017, 18:38:30 UTC | Merge branch 'Dev' * Dev: (152 commits) Updated version to 4.3 changed messages in deprecation warnings added messages to deprecated classes marked MaxClique as deprecated Revert "Revert "Faster GCE, also for weighted graphs"" Revert "Faster GCE, also for weighted graphs" fixed seeds for several unit tests replaced signed/unsigned comparison with signed/signed set seed for dynamic hyperbolic generator test case, fixes issue #11 fixed bug in parallel TopCloseness removeNode test adapted for new behaviour Export Graph::randomEdge(s) to Python Added requirements.txt back Update publications.rst Update publications.rst Update publications.rst MaximalCliques: add signal handling MaximalCliques: adapt include guard to class name added dynamic APSP MaximalCliques: added two more comments explaining the algorithm ... | 07 June 2017, 18:38:30 UTC |
| 11ea3d0 | Kolja Esders | 07 June 2017, 18:34:41 UTC | Merge branch 'Dev' of github.com:kit-parco/networkit into Dev * 'Dev' of github.com:kit-parco/networkit: changed messages in deprecation warnings | 07 June 2017, 18:34:41 UTC |
| f89a74a | Kolja Esders | 07 June 2017, 18:33:51 UTC | Updated version to 4.3 | 07 June 2017, 18:33:51 UTC |
| 91120f6 | Elisabetta Bergamini | 07 June 2017, 15:52:46 UTC | changed messages in deprecation warnings | 07 June 2017, 15:52:46 UTC |
| 7488a08 | Elisabetta Bergamini | 07 June 2017, 15:48:17 UTC | added messages to deprecated classes | 07 June 2017, 15:48:17 UTC |
| 3a80369 | Elisabetta Bergamini | 07 June 2017, 14:36:21 UTC | marked MaxClique as deprecated | 07 June 2017, 14:36:21 UTC |
| 7a35bd8 | Kolja Esders | 07 June 2017, 13:07:45 UTC | Merge pull request #34 from michitux/upstream/randomEdges Export Graph::randomEdge(s) to Python | 07 June 2017, 13:07:45 UTC |
| bc87c68 | Kolja Esders | 07 June 2017, 12:39:31 UTC | Merge pull request #40 from kit-parco/revert-39-revert-18-upstream/better-GCE Faster GCE, also for weighted graphs (added back after revert) | 07 June 2017, 12:39:31 UTC |
| 073e7c2 | Kolja Esders | 07 June 2017, 12:38:51 UTC | Revert "Revert "Faster GCE, also for weighted graphs"" | 07 June 2017, 12:38:51 UTC |
| 724560d | Kolja Esders | 07 June 2017, 12:21:11 UTC | Merge pull request #39 from kit-parco/revert-18-upstream/better-GCE Revert "Faster GCE, also for weighted graphs" | 07 June 2017, 12:21:11 UTC |
| 6fd9430 | Kolja Esders | 07 June 2017, 12:20:48 UTC | Revert "Faster GCE, also for weighted graphs" | 07 June 2017, 12:20:48 UTC |
| 6e2a88a | Kolja Esders | 07 June 2017, 12:19:40 UTC | Merge pull request #18 from michitux/upstream/better-GCE Faster GCE, also for weighted graphs | 07 June 2017, 12:19:40 UTC |
| 4d53f1c | Kolja Esders | 07 June 2017, 12:02:15 UTC | Merge pull request #28 from kit-parco/fix/approx-betweeness2-deprecation ApproxBetweeness2 deprecation | 07 June 2017, 12:02:15 UTC |
| a060e0c | ebergamini | 07 June 2017, 12:00:40 UTC | Merge pull request #16 from michitux/upstream/fix-gephi-export-node-attribute-deleted-nodes Gephi: Fix exporting node attributes with deleted nodes | 07 June 2017, 12:00:40 UTC |
| 26a5964 | ebergamini | 07 June 2017, 11:55:37 UTC | Merge pull request #32 from michitux/upstream/clique Add maximal clique listing algorithm | 07 June 2017, 11:55:37 UTC |
| 227ce8c | Moritz von Looz | 07 June 2017, 10:36:32 UTC | fixed seeds for several unit tests | 07 June 2017, 10:39:16 UTC |
| aff610d | Kolja Esders | 07 June 2017, 09:38:40 UTC | Merge pull request #5 from kit-parco/feature/clean-root-dir Clean root dir | 07 June 2017, 09:38:40 UTC |
| c9329f1 | Moritz von Looz | 07 June 2017, 09:11:22 UTC | replaced signed/unsigned comparison with signed/signed | 07 June 2017, 09:11:22 UTC |
| c8b9675 | Moritz von Looz | 07 June 2017, 09:10:31 UTC | set seed for dynamic hyperbolic generator test case, fixes issue #11 | 07 June 2017, 09:10:31 UTC |
| b988d5b | Elisabetta Bergamini | 07 June 2017, 08:53:13 UTC | fixed bug in parallel TopCloseness | 07 June 2017, 08:53:13 UTC |
| d06fccb | Elisabetta Bergamini | 06 June 2017, 13:06:23 UTC | updated publications | 06 June 2017, 13:06:23 UTC |
| ecbc4be | Kolja Esders | 01 June 2017, 20:21:21 UTC | Merge branch 'Dev' of github.com:kit-parco/networkit into fix/approx-betweeness2-deprecation * 'Dev' of github.com:kit-parco/networkit: removeNode test adapted for new behaviour | 01 June 2017, 20:21:21 UTC |
| 38fa45b | Kolja Esders | 01 June 2017, 20:16:42 UTC | Merge pull request #37 from kit-parco/fix/remove-nodes-test removeNode test adapted for new behaviour | 01 June 2017, 20:16:42 UTC |
| d9c3c3f | Kolja Esders | 01 June 2017, 00:02:13 UTC | removeNode test adapted for new behaviour | 01 June 2017, 00:02:13 UTC |
| 42a9de6 | Michael Hamann | 31 May 2017, 11:44:57 UTC | Export Graph::randomEdge(s) to Python | 31 May 2017, 11:44:57 UTC |
| 420f827 | Kolja Esders | 28 May 2017, 12:45:35 UTC | Merge branch 'Dev' into fix/approx-betweeness2-deprecation | 28 May 2017, 12:45:35 UTC |
| 6da750e | Kolja Esders | 28 May 2017, 12:41:21 UTC | Merge pull request #30 from kit-parco/feature/auto-remove-adjacent-edges Automatically remove incident edges on removeNode | 28 May 2017, 12:41:21 UTC |
| ffed3b5 | Kolja Esders | 28 May 2017, 12:39:26 UTC | Merge pull request #31 from kit-parco/fix/overview-for-directed-graphs Not showing clustering coefficient for unsuited graphs in overview(G) | 28 May 2017, 12:39:26 UTC |
| f096bf2 | Kolja Esders | 28 May 2017, 12:32:22 UTC | Added requirements.txt back | 28 May 2017, 12:32:22 UTC |
| 4b3a6a3 | Kolja Esders | 28 May 2017, 12:20:30 UTC | Merge pull request #15 from michitux/closeness-fixes Closeness fixes | 28 May 2017, 12:20:30 UTC |
| ab31c1b | hmeyerhenke | 26 May 2017, 11:41:22 UTC | Update publications.rst | 26 May 2017, 11:41:22 UTC |
| 4a37c32 | hmeyerhenke | 26 May 2017, 11:40:08 UTC | Update publications.rst | 26 May 2017, 11:40:08 UTC |
| 986fabf | hmeyerhenke | 26 May 2017, 11:36:07 UTC | Update publications.rst | 26 May 2017, 11:36:07 UTC |
