| 4a772bc | Fabian Brandt | 01 July 2021, 15:55:31 UTC | Merge pull request #783 from fabratu/fix-compiler-search setup.py: Fixes error when trying to find suitable compiler | 01 July 2021, 15:55:31 UTC |
| d8ce743 | Fabratu | 01 July 2021, 15:49:22 UTC | Fixes error when trying to find suitable compiler | 01 July 2021, 15:51:21 UTC |
| 35b80d2 | Fabian Brandt | 01 July 2021, 15:34:42 UTC | Release 9.0 commit Release 9.0: Update README.md, CHANGES.md, raise version | 01 July 2021, 15:34:42 UTC |
| 65075b1 | Fabratu | 01 July 2021, 11:47:57 UTC | Release 9.0: Update README.md, CHANGES.md, raise version | 01 July 2021, 12:04:29 UTC |
| e6aa161 | Eugenio Angriman | 01 July 2021, 11:54:44 UTC | Merge pull request #739 from angriman/feature/approx-group-closeness New Approximation Algorithm for Group Closeness | 01 July 2021, 11:54:44 UTC |
| 91d9152 | Eugenio Angriman | 01 July 2021, 11:10:51 UTC | Merge pull request #777 from angriman/fix/warning Warning and doc fixes in Lamg | 01 July 2021, 11:10:51 UTC |
| 2cc8dd7 | Fabian Brandt | 01 July 2021, 11:08:14 UTC | Merge pull request #781 from fabratu/fix-win-python Fix SOABI when installing sdist package under Windows | 01 July 2021, 11:08:14 UTC |
| ed195f7 | Fabratu | 01 July 2021, 10:28:32 UTC | Fixed problem when installing sdist-package under Windows | 01 July 2021, 10:28:32 UTC |
| dc26e1d | Alexander van der Grinten | 01 July 2021, 09:29:39 UTC | Merge pull request #756 from fabratu/python-pkg-win Python: Add support for Windows 7-10 | 01 July 2021, 09:29:39 UTC |
| 96bfd86 | Fabratu | 30 June 2021, 13:55:19 UTC | CMakeLists: Removes temp. debugging output. Simplify usage of NETWORKIT_BUILDING_STATELIB-flag | 01 July 2021, 07:15:31 UTC |
| fad6b83 | Eugenio Angriman | 18 April 2021, 13:00:11 UTC | Add notebook example | 30 June 2021, 14:55:33 UTC |
| 206dc57 | Eugenio Angriman | 18 April 2021, 11:20:40 UTC | Python interface and tests | 30 June 2021, 14:55:33 UTC |
| a2e362b | Eugenio Angriman | 15 April 2021, 12:13:45 UTC | New local search algorithm for group closeness. Implementation of the local search approximation algorithm for Group Closeness, presented in Group Harmonic and Group Closeness Maximization - Approximation and Engineering, Angriman et al., ALENEX 2021. | 30 June 2021, 14:55:33 UTC |
| 0e835d9 | Fabratu | 30 June 2021, 12:34:39 UTC | Changed CI-workflow to test both core and full builds + changed README to reflect support for Windows. | 30 June 2021, 12:34:39 UTC |
| b9ca70a | Fabratu | 30 June 2021, 12:24:38 UTC | Fixes problems with Windows builds for io-, numerics-module and notebook-tests | 30 June 2021, 12:24:38 UTC |
| 8ee4c87 | Fabratu | 30 June 2021, 12:21:33 UTC | Add global_state module, enabling support for basic Windows Cython builds | 30 June 2021, 12:21:33 UTC |
| 0353e6c | Alexander van der Grinten | 30 June 2021, 08:45:00 UTC | Merge pull request #359 from angriman/refactor/CSRMatrix Refactor CSRMatrix | 30 June 2021, 08:45:00 UTC |
| a01095c | Eugenio Angriman | 17 June 2021, 16:58:45 UTC | Add missing include in AlignedAllocator | 30 June 2021, 08:26:55 UTC |
| fb85471 | Alexander van der Grinten | 30 June 2021, 08:15:16 UTC | Merge pull request #765 from kisasexypantera94/refactor/linear-solvers Optimize memory usage in LAMG and ConjugateGradient | 30 June 2021, 08:15:16 UTC |
| d8a8cd4 | Alexander van der Grinten | 30 June 2021, 08:13:39 UTC | Merge pull request #638 from angriman/feature/group-harmonic-closeness New algorithm: group harmonic closeness | 30 June 2021, 08:13:39 UTC |
| a035c44 | kisasexypantera94 | 12 June 2021, 07:29:48 UTC | add optimized parallelSolve in linear solvers, use new loop in AlgebraicSpanningEdgeCentrality | 29 June 2021, 14:46:56 UTC |
| 5f963a0 | Alexander van der Grinten | 29 June 2021, 13:23:05 UTC | Merge pull request #753 from larsgottesbueren/feature-louvain-map-equation Community Detection Algorithm based on Map Equation | 29 June 2021, 13:23:05 UTC |
| 0ca864d | Alexander van der Grinten | 29 June 2021, 13:22:21 UTC | Merge pull request #726 from Relux-the-Relux/feature/subgraphfromnodes-documentation-fix Restoring the documentation of GraphTools::subgraphFromNodes. | 29 June 2021, 13:22:21 UTC |
| d0b3efa | Alexander van der Grinten | 29 June 2021, 13:21:41 UTC | Merge pull request #734 from angriman/suitor-matcher Suitor matcher | 29 June 2021, 13:21:41 UTC |
| ff438d9 | Eugenio Angriman | 29 June 2021, 13:18:55 UTC | Merge pull request #773 from angriman/warning-fix Remove unnecessary assert | 29 June 2021, 13:18:55 UTC |
| afb82e3 | Eugenio Angriman | 15 April 2021, 08:48:24 UTC | GroupHarmonicCloseness: add notebook example | 29 June 2021, 13:12:32 UTC |
| aeed810 | Eugenio Angriman | 14 December 2020, 08:53:26 UTC | New greedy algorithm for Group Harmonic Closeness The algorithm is from Angriman et al., ALENEX 2021. | 29 June 2021, 13:12:32 UTC |
| c6349b5 | Eugenio Angriman | 29 June 2021, 12:46:02 UTC | Fix gcc 11.1.0 -Werror=maybe-uninitialized in Lamg.hpp | 29 June 2021, 12:46:02 UTC |
| 633c3b3 | Eugenio Angriman | 29 June 2021, 12:45:18 UTC | Lamg: fix doc | 29 June 2021, 12:45:18 UTC |
| 55f4b95 | Alexander van der Grinten | 29 June 2021, 12:25:08 UTC | Merge pull request #743 from avdgrinten/fix-deprecated Undeprecate timeStep methods and treat deprecation warnings as errors | 29 June 2021, 12:25:08 UTC |
| a26bac7 | Alexander van der Grinten | 21 April 2021, 12:32:28 UTC | Treat deprecation warnings as errors This ensures that situations such as the one described in commit 218c3f45d23dd6af0ba189322bb10dedb132be12 do not happen again. | 29 June 2021, 10:26:02 UTC |
| 09a850c | Alexander van der Grinten | 29 June 2021, 09:50:09 UTC | Fix deprecation in EdgeSwitchingGTest.cpp | 29 June 2021, 10:26:02 UTC |
| 99c5105 | Alexander van der Grinten | 21 April 2021, 12:28:19 UTC | Undeprecate Graph::{time,timeStep} Undeprecate the functions because: * There is are no alternatives to these features within NetworKit. * There are internal uses of this functionality (in DGSReader) and they are not deprecated. That means that we *have to* introduce a replacement for these features (or remove DGSReader). * Builds cause tons of warnings due to the deprecation. These functions can be deprecated again when a suitable replacements exists. | 29 June 2021, 09:33:13 UTC |
| 11cc4fa | Eugenio Angriman | 29 June 2021, 07:06:54 UTC | Merge pull request #448 from michitux/upstream/SCD Add local community detection algorithms | 29 June 2021, 07:06:54 UTC |
| 830936e | Eugenio Angriman | 09 April 2021, 13:33:41 UTC | Add test for PathGrowingMatcher | 24 June 2021, 11:14:19 UTC |
| 7cdb6ec | Eugenio Angriman | 03 April 2021, 09:42:35 UTC | Suitor matcher algorithm | 24 June 2021, 11:14:19 UTC |
| 4cb6513 | Eugenio Angriman | 05 April 2021, 15:20:56 UTC | New methods: Graph::sortEdges and GraphTools::sortEdgesByWeight | 24 June 2021, 11:14:19 UTC |
| ab9d6d6 | Eugenio Angriman | 24 June 2021, 08:37:05 UTC | Merge pull request #767 from fabratu/fix-iterators Fixes pre- and post-increment of NeighborIterator + minor fixes/additions | 24 June 2021, 08:37:05 UTC |
| acbd3dc | Eugenio Angriman | 23 June 2021, 14:21:52 UTC | Remove unnecessary assert | 23 June 2021, 14:21:52 UTC |
| 752ad34 | Eugenio Angriman | 09 March 2021, 16:24:29 UTC | Use std::lower_bound instead of reimplementing binary-search | 23 June 2021, 13:16:59 UTC |
| 63f9aba | Eugenio Angriman | 27 June 2019, 07:27:30 UTC | CSRMatrix now uses templates | 23 June 2021, 13:16:59 UTC |
| 6c99244 | Michael Hamann | 22 June 2021, 15:34:07 UTC | Add Python tests for SCD | 22 June 2021, 15:37:11 UTC |
| 2974352 | Michael Hamann | 22 June 2021, 09:10:31 UTC | RandomBFS: add test case | 22 June 2021, 15:37:11 UTC |
| 2e77948 | Michael Hamann | 10 June 2021, 10:12:00 UTC | Add test case for SetConductance | 22 June 2021, 15:37:11 UTC |
| e091b3e | Michael Hamann | 06 May 2021, 15:28:21 UTC | SelectiveCDGTest: Add test cases for CombinedSCD These tests would have triggered asserts for bugs with multiple seed nodes. | 22 June 2021, 15:37:11 UTC |
| d6fb637 | Michael Hamann | 10 June 2021, 09:59:12 UTC | SelectiveCDGTest: apply clang-format | 22 June 2021, 15:37:11 UTC |
| f509c23 | Michael Hamann | 17 February 2021, 10:54:06 UTC | Expose ApproximatePageRank to Python | 22 June 2021, 15:37:11 UTC |
| e66a526 | Michael Hamann | 26 October 2020, 08:38:45 UTC | SCD: Add seed to test case to avoid random test failure | 22 June 2021, 15:37:11 UTC |
| 8411790 | Michael Hamann | 23 October 2020, 11:14:13 UTC | SCD: rename tests to match filename and have correct suffix Previously, the SCD tests were not included in the "--tests" test run, as they had a "2" at the end. | 22 June 2021, 15:37:11 UTC |
| ec87f78 | Michael Hamann | 20 June 2017, 13:47:07 UTC | SCD: Add triangle-based community detection algorithms | 22 June 2021, 15:37:11 UTC |
| 1a71742 | Michael Hamann | 20 June 2017, 13:47:07 UTC | SCD: Add L-based local community detection algorithm | 22 June 2021, 15:37:11 UTC |
| 8674fa3 | Michael Hamann | 20 June 2017, 13:46:27 UTC | SCD: add RandomBFS baseline algorithm This algorithm can serve as a baseline when comparing results to ground truth communities. | 22 June 2021, 15:37:11 UTC |
| 126589c | Lars Gottesbüren | 22 June 2021, 12:12:48 UTC | remove no longer needed include Timer.hpp | 22 June 2021, 12:12:48 UTC |
| 842335a | Lars Gottesbüren | 22 June 2021, 12:09:33 UTC | fix clang-tidy warnings: string copy and narrowing conversions | 22 June 2021, 12:09:33 UTC |
| a1f2998 | Lars Gottesbüren | 22 June 2021, 12:02:44 UTC | add forElements method to SparseVector | 22 June 2021, 12:02:44 UTC |
| cf221fd | Lars Gottesbüren | 22 June 2021, 10:54:36 UTC | fix code style in LouvainMapEquation | 22 June 2021, 10:54:36 UTC |
| 0011361 | Lars Gottesbüren | 22 June 2021, 10:51:24 UTC | remove timings in LouvainMapEquation | 22 June 2021, 10:51:24 UTC |
| 919fa3c | Lars Gottesbüren | 22 June 2021, 10:37:24 UTC | add missing documentation to SparseVector.hpp and remove unused, undocumented functions | 22 June 2021, 10:37:24 UTC |
| 1cab19a | Lars Gottesbüren | 22 June 2021, 10:27:46 UTC | remove nodeSet function from GraphTools | 22 June 2021, 10:27:46 UTC |
| e15362b | Lars Gottesbüren | 27 May 2021, 11:29:23 UTC | Louvain for map equation | 22 June 2021, 10:16:01 UTC |
| 19ffb58 | Michael Hamann | 20 June 2017, 13:45:44 UTC | SCD: add helper for combining two SCD algorithms This allows to combine two SCD algorithms such that first the first algorithm is executed on the given seed(s) and then the result of the first algorithm is used as the seed set of the second algorithm. This is particularly useful for seeding an algorithm with a clique. | 22 June 2021, 08:35:44 UTC |
| a8cbd27 | Michael Hamann | 20 June 2017, 13:44:46 UTC | SCD: Add LFMLocal algorithm This implements the local algorithm used in LFM which has been introduced in Lancichinetti, A., Fortunato, S., & Kertész, J. (2009). Detecting the overlapping and hierarchical community structure in complex networks. New Journal of Physics, 11(3), 033015. https://doi.org/10.1088/1367-2630/11/3/033015 | 22 June 2021, 08:35:44 UTC |
| 4c6b1b8 | Michael Hamann | 20 June 2017, 13:43:39 UTC | SCD: add algorithm that returns a clique This SCD algorithm just returns a clique. This is mainly supposed to be a good baseline which should have a high precision and a starting point for other SCD algorithms. | 22 June 2021, 08:35:44 UTC |
| c05c19a | Michael Hamann | 10 June 2021, 09:31:15 UTC | SCD: convert to camelBack case | 22 June 2021, 08:35:44 UTC |
| 03bce8d | Michael Hamann | 18 June 2021, 14:31:03 UTC | PageRankNibble: use correct define to disable extensive logging | 22 June 2021, 08:35:44 UTC |
| 130b69a | Michael Hamann | 10 June 2021, 09:58:57 UTC | SCD: apply clang-format and add networkit-format | 22 June 2021, 08:35:44 UTC |
| 707f284 | Michael Hamann | 20 June 2017, 13:42:20 UTC | SCD: add helper to manage a community This allows to create other algorithms based on similar properties of communities more easily. | 22 June 2021, 08:35:44 UTC |
| 97476a2 | Michael Hamann | 26 October 2020, 08:48:32 UTC | SCD: Add old method expandSeed as deprecated wrapper | 22 June 2021, 08:35:44 UTC |
| 553d4a2 | Michael Hamann | 20 June 2017, 13:42:02 UTC | SCD: Start with multiple seed nodes This adds two new methods to the interface of SelectiveCommunityDetector. The first is for expanding a community with a single seed, which was implemented by all existing algorithms anyway. The second expands a single community starting with multiple seed nodes. Further, the base class gets implementations of all but the second new method so child classes need to implement only one method. Direct use cases for this method will be implemented in other commits. The general idea is that by specifying more than one seed node one can more precisely specify which community should be expanded and direct the algorithm towards a specific community the node is part of in the case of overlapping communities. In an interactive scenario, a user might also simply select multiple nodes that should be part of the community. | 22 June 2021, 08:35:31 UTC |
| c4d7fb3 | Michael Hamann | 20 June 2017, 13:36:33 UTC | Add utility for the incremental uniformly random selection This class can be used when a selection among a number of equal elements needs to be made. The class does not assume that the elements are all known beforehand but that elements are discovered one after another. | 22 June 2021, 08:26:01 UTC |
| dfbf42d | Fabian Brandt | 22 June 2021, 07:57:09 UTC | Merge pull request #772 from angriman/fix/missing-graphtools-documentation Add missing graphtools module to docs | 22 June 2021, 07:57:09 UTC |
| fa5e622 | Eugenio Angriman | 21 June 2021, 07:11:49 UTC | Add missing graphtools module to docs | 21 June 2021, 07:17:18 UTC |
| 35fbf23 | Eugenio Angriman | 18 June 2021, 11:59:08 UTC | Merge pull request #752 from larsgottesbueren/improvement-coarsening improved (parallel) coarsening implementation for clusterings | 18 June 2021, 11:59:08 UTC |
| b1da8c3 | Fabian Brandt-Tumescheit | 15 June 2021, 15:58:11 UTC | Fixes pre- and post-increment of NeighborIterator. Adds Cython extension for NeighborWeightRange | 17 June 2021, 08:24:42 UTC |
| 49012a9 | Fabian Brandt | 15 June 2021, 10:53:44 UTC | Merge pull request #766 from angriman/fix/gtests Fix GTest Instantiation | 15 June 2021, 10:53:44 UTC |
| 531c7c1 | Eugenio Angriman | 14 June 2021, 14:09:44 UTC | Fix GTest instantiation | 14 June 2021, 14:09:44 UTC |
| dbb927c | Alexander van der Grinten | 14 June 2021, 13:23:43 UTC | Merge pull request #755 from angriman/refactor/edgelistwriter Refactor edgelistwriter | 14 June 2021, 13:23:43 UTC |
| bed275c | Alexander van der Grinten | 14 June 2021, 10:15:36 UTC | Merge pull request #440 from manpen/feature/EdgeSwitching Add standalone edge switching | 14 June 2021, 10:15:36 UTC |
| 82a9ad7 | Michael Hamann | 11 June 2021, 12:11:50 UTC | GraphTools::subgraphFromNodes: Add deprecated compatibility wrapper | 11 June 2021, 12:57:52 UTC |
| 6a6d59e | Michael Hamann | 09 June 2021, 18:02:25 UTC | StronglyConnectedComponents: avoid compacting already compact graph | 11 June 2021, 12:57:52 UTC |
| c40e212 | Michael Hamann | 09 June 2021, 18:01:46 UTC | Connected components: use subgraphFromNodes with compaction | 11 June 2021, 12:57:52 UTC |
| febc017 | Michael Hamann | 09 June 2021, 17:56:13 UTC | New compact variant of GraphTools::subgraphFromNodes This re-implements GraphTools::subgraphFromNodes based on a range of nodes and adds a compact flag. The old function is kept as a compatibility wrapper. Note that a range as input is required to be able to control the order of nodes in the compact graph. | 11 June 2021, 12:57:52 UTC |
| 4b51723 | peterlqa | 03 June 2021, 18:15:45 UTC | replaced references depending if it uses neighbors or not | 11 June 2021, 12:57:52 UTC |
| c4eff57 | peterlqa | 03 June 2021, 15:42:47 UTC | moves neighbor functionality to its own function | 11 June 2021, 12:28:39 UTC |
| 5c1dfcc | peterlqa | 22 March 2021, 11:38:03 UTC | Restoring the documentation of GraphTools::subgraphFromNodes. | 11 June 2021, 10:55:55 UTC |
| 6089a8a | Lars Gottesbüren | 10 June 2021, 13:08:35 UTC | Update ParallelPartitionCoarsening.cpp remove <iostream> include | 10 June 2021, 13:08:35 UTC |
| 2f1fcbe | Lars Gottesbüren | 10 June 2021, 10:51:56 UTC | Improve performance of (parallel) partition coarsening | 10 June 2021, 10:51:56 UTC |
| 0e8f264 | Michael Hamann | 11 May 2017, 08:14:31 UTC | SCD: Add SetConductance to compute the conductance of a set of nodes | 10 June 2021, 10:13:40 UTC |
| b3c9eb7 | Michael Hamann | 08 May 2017, 16:36:35 UTC | SCD: Add a class to compare found to ground truth communities | 10 June 2021, 09:46:10 UTC |
| 13db4b9 | Eugenio Angriman | 10 June 2021, 06:46:47 UTC | Merge pull request #473 from angriman/group-closeness-local-search LS-Restrict algorithm for Group Closeness | 10 June 2021, 06:46:47 UTC |
| 1383514 | Eugenio Angriman | 15 April 2021, 07:04:11 UTC | GroupClosenessLocalSwaps: add Python interface and tests | 03 June 2021, 09:18:29 UTC |
| 67dfb08 | Eugenio Angriman | 15 April 2021, 06:40:55 UTC | New algorithm: GroupClosenessLocalSwaps | 03 June 2021, 09:05:58 UTC |
| 2ba0553 | Eugenio Angriman | 18 May 2021, 19:54:58 UTC | Address #754 | 01 June 2021, 08:29:27 UTC |
| c4664d8 | Eugenio Angriman | 18 May 2021, 19:53:14 UTC | Format EdgeListWriter | 01 June 2021, 08:29:27 UTC |
| b8cd5ed | Eugenio Angriman | 15 April 2021, 06:39:26 UTC | Test GroupClosenessGrowShring invalid inputs | 31 May 2021, 13:49:36 UTC |
| 854482f | Eugenio Angriman | 15 April 2021, 06:38:39 UTC | Fix -Werror=type-limits | 31 May 2021, 13:49:36 UTC |
| 4fa7a9e | Alexander van der Grinten | 31 May 2021, 13:43:08 UTC | Merge pull request #758 from angriman/fix/clang-analyzer-checks Fix clang-analyzer and clang-tidy checks | 31 May 2021, 13:43:08 UTC |
| c7ec835 | Eugenio Angriman | 20 May 2021, 10:43:45 UTC | Fix reading of clang-format major revision number | 31 May 2021, 08:46:24 UTC |
| 3ff6e96 | Eugenio Angriman | 26 May 2021, 07:53:07 UTC | Add script to make CI fail if a YAML file is malformed | 31 May 2021, 08:46:24 UTC |
| aa16b51 | Eugenio Angriman | 25 May 2021, 13:43:28 UTC | Fix clang-tidy checks | 31 May 2021, 08:46:24 UTC |
