https://github.com/kit-parco/networkit

sort by:
Revision Author Date Message Commit Date
f00fd4c Bumped version to 4.6 25 June 2018, 11:28:51 UTC
5cc74b4 Merge pull request #182 from eug93/update-readme Updated readme 25 June 2018, 09:01:08 UTC
7dcfe02 Merge pull request #180 from eug93/feature/dyn-katz Feature/dyn katz 25 June 2018, 08:59:52 UTC
5c012cd Updated readme Signed-off-by: Eugenio Angriman <angriman@informatik.uni-koeln.de> 25 June 2018, 08:12:39 UTC
8caecf7 Partial Python interface for DynKatz Signed-off-by: Eugenio Angriman <angriman@informatik.uni-koeln.de> 25 June 2018, 07:38:25 UTC
cd35b49 Fixed python interface Signed-off-by: Eugenio Angriman <angriman@informatik.uni-koeln.de> 25 June 2018, 07:38:15 UTC
4ccb520 Partial Python interface for DynKatz Signed-off-by: Eugenio Angriman <angriman@informatik.uni-koeln.de> 25 June 2018, 07:36:28 UTC
9e8584b Merge pull request #177 from kit-parco/feature/esa18-katz Katz centrality ranking from ESA'18 25 June 2018, 07:24:44 UTC
55617d9 Merge pull request #174 from manpen/feature_curveball Feature curveball 25 June 2018, 07:24:30 UTC
a1d0333 Reduce test size for faster execution 22 June 2018, 19:08:44 UTC
c4c7ee8 Merge remote-tracking branch 'upstream/Dev' into feature_curveball_github 22 June 2018, 18:30:37 UTC
d7e02a0 Updates as requested by @avdgrinten 22 June 2018, 18:20:18 UTC
b2378db Add Python Tests 22 June 2018, 18:00:39 UTC
86d56e1 Add Curveball 22 June 2018, 18:00:39 UTC
d2a75ca Katz centrality: Inherit from DynAlgorithm 22 June 2018, 13:13:27 UTC
efc46a0 Merge pull request #178 from eug93/Dev ApproxGroupBetweenness and other minor changes 22 June 2018, 13:12:33 UTC
0f95e45 centrality: Move DynamicKatz -> DynKatzCentrality This name better matches existing precedent. 22 June 2018, 13:06:29 UTC
d961aa1 Group betweenness test fixes Signed-off-by: Eugenio Angriman <angriman@informatik.uni-koeln.de> 22 June 2018, 12:51:01 UTC
d1e5ee6 Indentation Signed-off-by: Eugenio Angriman <angriman@informatik.uni-koeln.de> 22 June 2018, 12:51:01 UTC
d45c8a8 Added g++-8 option Signed-off-by: Eugenio Angriman <angriman@informatik.uni-koeln.de> 22 June 2018, 12:51:01 UTC
58d817a Credits Signed-off-by: Eugenio Angriman <angriman@informatik.uni-koeln.de> 22 June 2018, 12:50:56 UTC
05fae00 Python interface and minor changes Signed-off-by: Eugenio Angriman <angriman@informatik.uni-koeln.de> 22 June 2018, 12:48:18 UTC
157c358 Renaming of approx group betweenness + GTests Signed-off-by: Eugenio Angriman <angriman@informatik.uni-koeln.de> 22 June 2018, 12:48:18 UTC
24a125d Katz centrality: Remove unused maxIter constant 22 June 2018, 09:13:34 UTC
0cbd412 PrioQueue: Change signature of peekMin() to size_t This avoids a signed/unsigned comparison. 22 June 2018, 09:11:55 UTC
23b99ac Katz centrality: Fix compilation on 32-bit ISAs 22 June 2018, 08:53:45 UTC
8618c38 Katz centrality: Commit ESA submission version This includes a PrioQueue based approach that was not actually used in the paper. Still, commit it for historical reference. 22 June 2018, 08:19:58 UTC
b23cd02 Katz centrality: Convert INFO() to DEBUG() logs 22 June 2018, 08:19:57 UTC
8df594c Katz centrality: Fix graph building test The test incorrectly failed when nodes were only ranked correctly up to the tolerance. Fix this by taking non-distinguished nodes into account. 22 June 2018, 08:19:57 UTC
d3122ad Katz centrality: Fix dyn. updates in directed case Until now, the updated code assumed that edges were undirected. In particular, it started its update iteration from both endpoints. Fix that by only starting from the target node of the edge. 22 June 2018, 08:15:08 UTC
5d2f9b9 Katz centrality: Support batch updates 22 June 2018, 08:14:26 UTC
534e4ea Rework Elisabetta's top-k Katz centrality code 22 June 2018, 08:14:26 UTC
e1d1d9b Centrality test: Dynamic Katz while building graph Add a test that incrementally builds a graph and computes the Katz centrality after each node addition. 22 June 2018, 08:09:05 UTC
c5a4285 Centrality test: Test Katz top-k vs. exact algo 22 June 2018, 08:06:47 UTC
ce1a017 Import dyn. Katz code from Elisabetta The code was written by Elisabetta Bergamini and pushed to a private NetworKit repository. Import it into the main repository. 22 June 2018, 07:53:04 UTC
ae5ce34 Merge pull request #168 from rbange/fix/fast-snap-reader Faster SNAPGraphReader implementation 21 June 2018, 18:42:24 UTC
4ef3f06 Merge pull request #169 from rbange/feature/fast-KONECT-reader Faster KONECTGraphReader implementation 21 June 2018, 18:42:09 UTC
506241b add old constructor with deprecation warning 21 June 2018, 15:56:19 UTC
7b16d4c refactor MultipleEdgesHandling enum 21 June 2018, 15:22:42 UTC
6b3619a replace regular KONECTReader by FastKONECT / exposing new reader to Python 21 June 2018, 15:19:37 UTC
c26a902 fix issues raised in PR fix misleading handling if number of nodes is stated wrong 21 June 2018, 15:16:48 UTC
1692cb6 remapNodes parameter added which offers the possibility to read in graphs with non-consecutive node ids set log level of many messages to "DEBUG" instead of "INFO" 21 June 2018, 15:16:48 UTC
2aea417 refactor multipleEdgesHandling enum 21 June 2018, 15:16:48 UTC
3faad98 just declare a positive graph weighted when sumWeightsUp is selected as method 21 June 2018, 15:16:47 UTC
97c37c6 simplify handleEdge function / refactor 21 June 2018, 15:16:47 UTC
00069c3 add multipleEdgesHandling support / safe mapNode function is numberOfNodes is not correctly specified in file 21 June 2018, 15:16:47 UTC
07da989 io: implement fast and working mmap()-based KONECT reader 21 June 2018, 15:16:47 UTC
5734d6b replace SNAPGraphReader with FastSNAPGraphReader and fix exposition to python 21 June 2018, 15:04:14 UTC
d3f250c small improvements in constructor signature, comments and reserving space 21 June 2018, 15:04:14 UTC
ff33988 short constructer call 21 June 2018, 15:04:14 UTC
530032b add remapNodes parameter to increase reading performance on the cost of having isolated nodes 21 June 2018, 15:04:14 UTC
cd39c41 refactor maxNode parameter because of bad behaviour in graphs with non-consecutive node ids 21 June 2018, 15:04:13 UTC
4efa7e3 add constructor for directed graphs and maxNode / documentation 21 June 2018, 15:04:13 UTC
e455d05 add a test for FastSNAPGraphReader / convert asserts to runtime_errors 21 June 2018, 15:04:13 UTC
4c449e6 io: Implement fast, mmap()-based SNAP reader 21 June 2018, 15:04:13 UTC
5ef66b1 Merge pull request #146 from MarvinPogoda/Dev MahmoodyGroupBetweenness + Updated BucketPQ 21 June 2018, 14:34:16 UTC
15b9f95 Merge pull request #161 from michitux/thrill_support Add various binary partition and graph readers and writers 21 June 2018, 14:32:46 UTC
671ce23 Merge pull request #176 from rbange/fix/test-rework fix assertion in testHashingOverlapperForCorrectness 21 June 2018, 12:35:05 UTC
19ad5bb fix assertion in OverlapGTest.testHashingOverlapperForCorrectness 21 June 2018, 12:12:24 UTC
d5db603 Merge pull request #170 from rbange/fix/test-rework Test suite rework 21 June 2018, 09:12:15 UTC
6dc1f28 Binary partition readers: ignore "none" when setting the upper bound 20 June 2018, 17:09:01 UTC
62021f9 BinaryEdgeListPartitionWriter: independence of endianness, more safety 20 June 2018, 17:01:10 UTC
3fe78ce BinaryEdgeListPartitionReader/Writer: fixes and simplifications This removes the dependency on the endianness of the BinaryEdgeListPartitionReader and adds additional checks on the read data. Further, a bug in the BinaryEdgeListPartitionWriter is fixed - firstNode is no longer ignored. This also adds a test case testing both. 20 June 2018, 13:19:31 UTC
7669e13 Add GlobalCurveball 20 June 2018, 13:19:26 UTC
91bba1a Add BinaryPartitionWriter and test for writer and reader 20 June 2018, 12:45:34 UTC
1e088cc BinaryPartitionReader: remove template, do not depend on endianness 20 June 2018, 12:43:43 UTC
dcf5121 FOR REFERENCE ONLY: Include required TLX code 19 June 2018, 16:50:36 UTC
33aead2 Add a simple test case for the thrill binary writer and reader 19 June 2018, 14:45:33 UTC
8c79635 ThrillGraphBinaryReader: remove explicit loop, use always little endian 19 June 2018, 14:45:01 UTC
8ba0058 ThrillGraphBinaryWriter: fix stupid bug, use size_t instead of auto 19 June 2018, 10:44:56 UTC
eca8a3a ThrillGraphBinaryReader: fix segfault on wrong input 19 June 2018, 10:44:34 UTC
2da787f ThrillGraphBinaryWriter: fix for deleted nodes Deleted nodes are now exported as nodes of degree 0 19 June 2018, 09:28:47 UTC
a7ff6f5 ThrillGraphBinaryWriter: remove expanded loop, write little endian 19 June 2018, 09:27:23 UTC
c4598e0 ThrillGraphBinaryReader: fix variable naming 19 June 2018, 08:54:30 UTC
7d0c93b Merge pull request #159 from michitux/feature/partitioncompact Faster Partition::compact() implementation 19 June 2018, 08:07:35 UTC
daa9e7f set gtest shuffle mode to 1 18 June 2018, 16:45:20 UTC
e85ab16 refactor try* tests to debug* / new unittest parameter -d 18 June 2018, 09:34:23 UTC
75c0e0f remove seed restore behaviour / bring back seed for LFR generator test 18 June 2018, 09:33:20 UTC
ddd1275 GTEST5 15 June 2018, 01:31:28 UTC
ec624bb GTEST4 15 June 2018, 00:36:35 UTC
369330e GTest3 14 June 2018, 23:34:46 UTC
c6f6774 Another GTest-Fix 14 June 2018, 21:54:54 UTC
ed969a8 Gtest Changed2 14 June 2018, 20:48:45 UTC
7ecc457 GTest-Changed 14 June 2018, 19:51:21 UTC
0fd2388 Optimized MahmoodyGB-parallelization 14 June 2018, 17:45:34 UTC
2c1ba39 change prefix of test without assertions to "run" Overall 9 tests in the test suite do not use assertions because of the algorithms uncertain outcome. These tests are moved to a new "run" class to point out that they dont test the algorithms outcome. To ensure that the Networkit runs fine these tests will still run within travis. 14 June 2018, 13:14:48 UTC
c75fef9 Merge pull request #167 from rbange/feature/fasterHasEdge faster hasEdge() for undirected graphs 14 June 2018, 12:35:12 UTC
5b50cd4 remove location printing from INFO messages 04 June 2018, 22:36:51 UTC
a8364c0 several replacement of unnecessary INFO() messages to DEBUG() in order to reduce clutter in output 04 June 2018, 22:11:04 UTC
957666d Test rework: graph replace INFO with DEBUG preserve seed testInForEdgesUndirected - REMOVED - No intention of test visible 04 June 2018, 21:53:48 UTC
443c714 Test rework: viz replace INFO with DEBUG testPostscriptWriterOnRandomGraph - MODIFIED - add assertions testPostscriptWriterOnRealGraph - MODIFIED - add assertions 04 June 2018, 21:27:07 UTC
7ac6463 Test rework: overlap testHashingOverlapperForCorrectness - MODIFIED - add assertions 04 June 2018, 20:45:10 UTC
bcc3cac Test rework: numerics replace INFO in DEBUG with test 04 June 2018, 20:28:00 UTC
6f2ec0c Test rework: matcher testPgaMatchingOnWeightedGraph - Modified - add assertions 04 June 2018, 20:22:58 UTC
03b7b2b Test rework: linkprediction remove unnecessary constructors testAlgebraicDistanceIndex - Modified - replace INFO with Debug 04 June 2018, 20:06:50 UTC
7ef3c68 Test rework: io testSNAPGraphWriter - MODIFIED - add assertions testEdgeListWriter - ADDED - add test 04 June 2018, 19:57:54 UTC
582c360 Test rework: global remove unnecessary constructors 04 June 2018, 18:52:07 UTC
555b0c0 Test rework: geometric testHyperbolicTargetRadius - MODIFIED - add assertions 04 June 2018, 18:48:27 UTC
214d6c1 Test rework: generators testStaticPubWebGenerator - MODIFIED - reduced runtime testDynamicPubWebGenerator - MODIFIED - reduced runtime testDynamicHyperbolicGeneratorOnMovedNodes - MODIFIED - preserve seed / remove compiler warning / reduce runtime testDynamicHyperbolicVisualization - MODIFIED - move graph writing to debug log level testDynamicPathGenerator - MODIFIED - add assertions testHyperbolicGenerator - MODIFIED - Reduced runtime testHyperbolicGeneratorConsistency - MODIFIED - reduced runtime testHyperbolicGeneratorMechanicGraphs - MODIFIED - reduced runtime testLFRGeneratorImpossibleSequence - RENAMED / MODIFIED - make test run again testLFRGeneratorWithRealData - MODIFIED - add assertions 04 June 2018, 18:32:18 UTC
43ecbc2 fix test which failed 03 June 2018, 23:15:47 UTC
back to top