1f7c36a | cls | 22 August 2014, 14:54:11 UTC | merge Dev -> default | 22 August 2014, 14:54:11 UTC |
b6de309 | maxv | 22 August 2014, 14:37:05 UTC | updated download url in package info | 22 August 2014, 14:37:05 UTC |
feff109 | maxv | 22 August 2014, 14:36:18 UTC | updated version number to 3.3 | 22 August 2014, 14:36:18 UTC |
c799cea | maxv | 22 August 2014, 14:36:05 UTC | fixed notebooks | 22 August 2014, 14:36:05 UTC |
91bfcd4 | maxv | 22 August 2014, 14:13:36 UTC | updated pdfs | 22 August 2014, 14:13:36 UTC |
591fb5d | maxv | 22 August 2014, 13:58:33 UTC | next attempt to hide compilation output; added pip section to Readme | 22 August 2014, 13:58:33 UTC |
e64b5c9 | cls | 22 August 2014, 14:12:07 UTC | fixed user guide | 22 August 2014, 14:12:07 UTC |
8c1024d | cls | 22 August 2014, 13:50:53 UTC | imported workflows module | 22 August 2014, 13:50:53 UTC |
95cbaff | maxv | 22 August 2014, 13:42:57 UTC | README.rst not necessary in repository; minor fixes | 22 August 2014, 13:42:57 UTC |
ecd4784 | maxv | 22 August 2014, 13:36:40 UTC | removed PartitionProduct | 22 August 2014, 13:36:40 UTC |
a0d7b6b | maxv | 22 August 2014, 13:35:28 UTC | added nbviewer link to module description; hide test compilation output in setup.py | 22 August 2014, 13:35:28 UTC |
c122030 | maxv | 22 August 2014, 12:26:51 UTC | always delete _NetworKit.cpp, print warnings for missing packages | 22 August 2014, 12:26:51 UTC |
dab9a94 | Michael Hamann | 22 August 2014, 12:41:59 UTC | Fix compilation on GCC 4.7 This simply avoids name clashes between template parameters and members. | 22 August 2014, 12:41:59 UTC |
47e6add | cls | 22 August 2014, 12:41:26 UTC | merge | 22 August 2014, 12:41:26 UTC |
110b65f | cls | 22 August 2014, 12:34:56 UTC | updated Readme | 22 August 2014, 12:34:56 UTC |
14f3ecd | maxv | 22 August 2014, 12:16:33 UTC | setup.py: don't pass compiler to SCons when build.conf exists | 22 August 2014, 12:16:33 UTC |
ede912a | maxv | 22 August 2014, 11:28:18 UTC | changed gcc detection | 22 August 2014, 11:28:18 UTC |
8387a90 | cls | 22 August 2014, 11:27:10 UTC | sequential ConnectedComponents is now the default because ParallelConnectedComponents has problematic worst case performance | 22 August 2014, 11:27:10 UTC |
0321dc0 | Marvin Ritter | 21 August 2014, 21:21:15 UTC | updated test.py to use new source directory | 21 August 2014, 21:21:15 UTC |
b5367e4 | Marvin Ritter | 21 August 2014, 21:19:17 UTC | merge | 21 August 2014, 21:19:17 UTC |
8614fc6 | Marvin Ritter | 21 August 2014, 21:18:11 UTC | parallelised Graph.numberOfSelfLoops(); | 21 August 2014, 21:18:11 UTC |
5a55ef8 | maxv | 21 August 2014, 13:38:49 UTC | fixed minor issues | 21 August 2014, 13:38:49 UTC |
05e36b2 | maxv | 21 August 2014, 13:38:41 UTC | added files for python packaging | 21 August 2014, 13:38:41 UTC |
537c9fd | maxv | 21 August 2014, 13:15:35 UTC | repository restructured; setup.py supports packaging/pip | 21 August 2014, 13:15:35 UTC |
0bf2de9 | Moritz von Looz | 21 August 2014, 11:20:31 UTC | moved result declaration in GraphBuilder toGraph, allowing return value optimization and less copying | 21 August 2014, 11:20:31 UTC |
0d68a18 | Michael Hamann | 21 August 2014, 09:07:22 UTC | Make NMI test case deterministic | 21 August 2014, 09:07:22 UTC |
87a0937 | Michael Hamann | 21 August 2014, 09:06:45 UTC | Fix double comparisons in assertions in NMIDistance | 21 August 2014, 09:06:45 UTC |
37fb238 | Michael Hamann | 20 August 2014, 16:35:46 UTC | Revert "implemented function to intersect partitions" This functionality was already present in PartitionProduct and has now been renamed to PartitionIntersection in order to make it more obvious. | 20 August 2014, 16:35:46 UTC |
b3963c9 | Michael Hamann | 20 August 2014, 16:34:06 UTC | Renamed PartitionProduct to PartitionIntersection | 20 August 2014, 16:34:06 UTC |
4ed5ef4 | Michael Hamann | 20 August 2014, 16:14:45 UTC | Fix Graph::edgeId() to handle missing edges with an exception | 20 August 2014, 16:14:45 UTC |
8fd379c | cls | 20 August 2014, 11:20:33 UTC | merge edgeids -> Dev | 20 August 2014, 11:20:33 UTC |
2c90d91 | Marvin Ritter | 20 August 2014, 10:04:21 UTC | fixed typos | 20 August 2014, 10:04:21 UTC |
7c1b4d0 | Moritz von Looz | 20 August 2014, 09:16:48 UTC | optimization in direct swap: counting selfloops as they occur instead of iterating over edges afterwards | 20 August 2014, 09:16:48 UTC |
4213da3 | Moritz von Looz | 20 August 2014, 08:37:49 UTC | moved usedirectswap to constructor parameter | 20 August 2014, 08:37:49 UTC |
c5b34c8 | Moritz von Looz | 20 August 2014, 08:00:51 UTC | made loops parallel, replaced assert with throw of runtime error | 20 August 2014, 08:00:51 UTC |
af210ae | Moritz von Looz | 19 August 2014, 16:52:30 UTC | fixed typo | 19 August 2014, 16:52:30 UTC |
5211ee3 | Moritz von Looz | 19 August 2014, 16:45:42 UTC | added GraphBuilder.directSwap() + unit tests | 19 August 2014, 16:45:42 UTC |
3402e5b | cls | 19 August 2014, 11:26:43 UTC | docstring for dynamic.graphFromStream | 19 August 2014, 11:26:43 UTC |
8345b3f | cls | 19 August 2014, 11:18:14 UTC | docstring for dynamic.GraphUpdater | 19 August 2014, 11:18:14 UTC |
c98b67c | cls | 19 August 2014, 10:54:01 UTC | merge | 19 August 2014, 10:54:01 UTC |
000a29d | cls | 19 August 2014, 10:53:29 UTC | properties.degreeSequence | 19 August 2014, 10:53:29 UTC |
dcc2e10 | Marvin Ritter | 18 August 2014, 22:16:01 UTC | better variable naming in Graph.checkConsistency | 18 August 2014, 22:16:01 UTC |
a0a434c | cls | 18 August 2014, 15:03:45 UTC | merge | 18 August 2014, 15:03:45 UTC |
6db7eb6 | cls | 18 August 2014, 15:03:08 UTC | pythonized Graph.setWeight | 18 August 2014, 15:03:08 UTC |
c790765 | Michael Hamann | 18 August 2014, 14:31:52 UTC | Fix ParallelConnectedComponents to work for graphs with deleted nodes | 18 August 2014, 14:31:52 UTC |
8dc15d8 | cls | 18 August 2014, 14:17:20 UTC | workflows.extractLargestComponent | 18 August 2014, 14:17:20 UTC |
cdf4130 | Gerd Lindner | 18 August 2014, 13:34:01 UTC | Significant performance improvement in gephi streaming by sending json messages in bulk | 18 August 2014, 13:34:01 UTC |
33fa33d | Gerd Lindner | 18 August 2014, 13:24:57 UTC | Using edge ids in gephi streaming, notebook updated accordingly | 18 August 2014, 13:24:57 UTC |
5edf80a | Michael Hamann | 18 August 2014, 09:40:09 UTC | Revert changes to BFS handlers as they are no longer necessary | 18 August 2014, 09:40:09 UTC |
3861a63 | Michael Hamann | 18 August 2014, 08:38:48 UTC | Support BFS handles with one or two parameters | 18 August 2014, 08:38:48 UTC |
7c2d1d4 | Michael Hamann | 18 August 2014, 08:57:03 UTC | Fix return value of Partition::extend() in Python | 18 August 2014, 08:57:03 UTC |
23e951a | Marvin Ritter | 17 August 2014, 16:24:47 UTC | added argument parsing and some documentation to continuous testing script | 17 August 2014, 16:24:47 UTC |
a2ddf2f | Marvin Ritter | 17 August 2014, 14:55:44 UTC | forgot to undo change in testParallelPartitionCoarsening | 17 August 2014, 14:55:44 UTC |
4063dcc | Marvin Ritter | 17 August 2014, 14:26:25 UTC | made GraphBuilder.toGraph a bit more readible | 17 August 2014, 14:26:25 UTC |
1e724b2 | Marvin Ritter | 17 August 2014, 13:00:19 UTC | merge, sorry was on the wrong branch | 17 August 2014, 13:00:19 UTC |
a6453f7 | Marvin Ritter | 17 August 2014, 12:48:12 UTC | GraphBuilder documentation | 17 August 2014, 12:48:12 UTC |
66a9cff | Marvin Ritter | 17 August 2014, 12:03:29 UTC | ParallelPartition using GraphBuilder, please review and if it's correct remove old code and friend class | 17 August 2014, 12:03:29 UTC |
06bc74f | cls | 17 August 2014, 10:50:34 UTC | fixed typo in ParallelPartitionCoarsening | 17 August 2014, 10:50:34 UTC |
f946125 | Marvin Ritter | 16 August 2014, 22:11:33 UTC | little code cleanup | 16 August 2014, 22:11:33 UTC |
9683689 | Marvin Ritter | 16 August 2014, 20:06:04 UTC | Removed Graph.treatAsUndirected(), it was not used and terrible wrong | 16 August 2014, 20:06:04 UTC |
b33751c | Marvin Ritter | 16 August 2014, 19:51:40 UTC | merged graphbuilder into Dev, GraphBuilder can be used now, I will try to add some documenation the next days | 16 August 2014, 19:51:40 UTC |
be9e31e | Marvin Ritter | 16 August 2014, 19:50:19 UTC | fixed some compiler warnings | 16 August 2014, 19:50:19 UTC |
bf002ff | Marvin Ritter | 16 August 2014, 19:50:02 UTC | fixed wrong number of edges in case of self-loops | 16 August 2014, 19:50:02 UTC |
6f79766 | Marvin Ritter | 16 August 2014, 19:28:56 UTC | adjusted continous build script | 16 August 2014, 19:28:56 UTC |
7e33b72 | Marvin Ritter | 16 August 2014, 16:30:53 UTC | merge with Dev | 16 August 2014, 16:30:53 UTC |
08c8002 | Marvin Ritter | 16 August 2014, 16:28:48 UTC | fixed Graph.consistencyCheck(), write serious test cases next time ;) | 16 August 2014, 16:28:48 UTC |
ff23843 | Marvin Ritter | 15 August 2014, 22:55:55 UTC | more test cases for GraphBuilder | 15 August 2014, 22:55:55 UTC |
307839b | Marvin Ritter | 15 August 2014, 21:54:43 UTC | more test case for GraphBuilder | 15 August 2014, 21:54:43 UTC |
a95aad4 | Marvin Ritter | 15 August 2014, 20:59:27 UTC | fixed double creation of self loops | 15 August 2014, 20:59:27 UTC |
fe93154 | Marvin Ritter | 14 August 2014, 22:23:13 UTC | test cases for GraphBuilder | 14 August 2014, 22:23:13 UTC |
82778ff | Marvin Ritter | 14 August 2014, 22:22:44 UTC | added GraphBuilder.setWeight() and some documentation, fixed behaviour of increaseWeight | 14 August 2014, 22:22:44 UTC |
730bc5b | Michael Hamann | 13 August 2014, 15:00:17 UTC | Add hub dominance measure for partitions and covers The hub dominance of a single cluster is defined as the maximum cluster-internal degree of a node in that cluster divided by the maximum cluster-internal degree, i.e. the number of nodes in the cluster minus one. The value for all clusters is defined as the average of all clusters. For more information about this property in complex networks see Lancichinetti A, Kivel? M, Saram?ki J, Fortunato S (2010) Characterizing the Community Structure of Complex Networks PLoS ONE 5(8): e11976. doi: 10.1371/journal.pone.0011976 http://www.plosone.org/article/info%3Adoi%2F10.1371%2Fjournal.pone.0011976 | 13 August 2014, 15:00:17 UTC |
c1b1126 | Michael Hamann | 13 August 2014, 14:20:44 UTC | Fix Partition::compact() for partitions with none values Previously, nodes that were in the "none" subset were erroneously assigned to the "0" subset. Furthermore this caused a write access to a set in the parallel loop which caused a segfault sometimes. | 13 August 2014, 14:20:44 UTC |
10f16d5 | Michael Hamann | 13 August 2014, 15:28:40 UTC | Make it possible to copy Graph objects in Python using copy.copy | 13 August 2014, 15:28:40 UTC |
a77c96f | cls | 13 August 2014, 09:57:49 UTC | test for StochasticBlockmodel generator | 13 August 2014, 09:57:49 UTC |
bd2635a | cls | 13 August 2014, 09:41:14 UTC | created class for generators.StochasticBlockmodel | 13 August 2014, 09:41:14 UTC |
913e9eb | maxv | 11 August 2014, 20:14:36 UTC | cleaned up redundant code from BFS and Dijkstra | 11 August 2014, 20:14:36 UTC |
ed7bfe5 | ebergamini | 11 August 2014, 16:35:14 UTC | fixed bug in Dijkstra: distance vector was not initialized to 0 for the source before constructing the priority queue | 11 August 2014, 16:35:14 UTC |
21a29fe | cls | 11 August 2014, 13:48:53 UTC | updated credits | 11 August 2014, 13:48:53 UTC |
0c3663f | Simon Bischof | 11 August 2014, 13:29:07 UTC | removed tracking of unnecessary files | 11 August 2014, 13:29:07 UTC |
56b4f4f | Simon Bischof | 11 August 2014, 13:18:28 UTC | Added ForestFire and WattsStrogatz generator, fixed bug in DynamicDorogovtsevMendesGenerator | 11 August 2014, 13:18:28 UTC |
dac98f0 | Simon Bischof | 11 August 2014, 13:18:17 UTC | Added ForestFire and WattsStrogatz generator, fixed bug in DynamicDorogovtsevMendesGenerator | 11 August 2014, 13:18:17 UTC |
e5e3926 | cls | 11 August 2014, 11:57:08 UTC | updated notebooks for spectral methods | 11 August 2014, 11:57:08 UTC |
b87448d | mail | 11 August 2014, 11:48:36 UTC | Renaming "PythonNative" -> "SciPy" | 11 August 2014, 11:48:36 UTC |
45b460e | cls | 11 August 2014, 11:33:24 UTC | ran spectral notebooks | 11 August 2014, 11:33:24 UTC |
5b58568 | mail | 11 August 2014, 10:26:24 UTC | Lots of documentation | 11 August 2014, 10:26:24 UTC |
88a27df | Michael Hamann | 08 August 2014, 16:26:50 UTC | Support edge iterators with weight and id, update documentation | 08 August 2014, 16:26:50 UTC |
1a682f9 | Michael Hamann | 08 August 2014, 15:58:57 UTC | Simplify the static assert for the wrong lambda | 08 August 2014, 15:58:57 UTC |
492a0ae | Michael Hamann | 08 August 2014, 15:52:29 UTC | Remove redundant edge iterator implementations and use templates instead | 08 August 2014, 15:52:29 UTC |
f45d81e | Michael Hamann | 08 August 2014, 12:44:22 UTC | Merge branch 'branches/Dev' into branches/edgeids | 08 August 2014, 12:44:22 UTC |
9653923 | cls | 08 August 2014, 11:45:48 UTC | fixed test cases for Matchers | 08 August 2014, 11:45:48 UTC |
31dbf94 | Michael Hamann | 08 August 2014, 09:20:31 UTC | Remove _graphio33, add compatibility code to graphio This removes the need to maintain two copies of the same code by reducing the duplicated to code to the required minimum. This fixes differences in parameter names and a broken readMat-function in Python 3.3. | 08 August 2014, 09:20:31 UTC |
c10e05a | Michael Hamann | 08 August 2014, 08:50:56 UTC | Fix edge iterator usage | 08 August 2014, 08:50:56 UTC |
4f6fb1b | Michael Hamann | 08 August 2014, 09:41:38 UTC | Merge branch 'branches/Dev' into branches/edgeids Conflicts: src/cpp/community/CoverageSequential.cpp src/cpp/community/PLMOld.cpp src/cpp/graph/Dijkstra.cpp src/cpp/graph/Graph.h | 08 August 2014, 09:41:38 UTC |
84acb7f | Michael Hamann | 08 August 2014, 08:49:05 UTC | Fix edge ids for graphs with deleted nodes and edges | 08 August 2014, 08:49:05 UTC |
25ac572 | Michael Hamann | 08 August 2014, 08:47:54 UTC | Do not re-index edges unless explicitly requested | 08 August 2014, 08:47:54 UTC |
810021a | cls | 07 August 2014, 13:25:26 UTC | fixed typo | 07 August 2014, 13:25:26 UTC |
81344bb | cls | 07 August 2014, 13:08:25 UTC | merge | 07 August 2014, 13:08:25 UTC |
47c1b39 | cls | 07 August 2014, 13:08:09 UTC | parallel coarsening in ParallelConnectedComponents | 07 August 2014, 13:08:09 UTC |
f887334 | cls | 07 August 2014, 10:09:19 UTC | added graph.SpanningForest: generates a spanning forest (spanning tree for connected graphs) by breadth-first search | 07 August 2014, 10:09:19 UTC |