API-breaking changes are extracted and filtered by using ABI-compliance checker together with ABI-dumper for C++ core-library and the Cython-interface. Native Python-code functions are covered by diffs.
-
Components
ParallelConnectededComponents::runSequential()
-
Distance
BidirectionalBFS::getHops()
-
Dynamics
GraphEvent::compare()GraphEvent::equal()
-
Graph
GraphBuilder::toGraph()Sampling(including all functions)
-
Sparsification
SimmelianScore::matchNeighbors()
-
The following modules are removed:
csbrige,dynamic,GEXFIO,GraphMLIO,partitioning,sampling,stopwatch,viztasks,workflows -
Removed functions and classes from C++ are also removed in the Python interface
-
graphtools
subgraphFromNodes()does not anymore support named parametersincludeOutNeighborsandincludeInNeighbors. UsesubgraphAndNeighborsFromNodesinstead for the same functionality.
-
helpers
sorted()is removed. Use the native Pythonsorted()function instead
- NetworKit
localNodeCategoriesis removed. This variable did not have any functionality.
-
Aux
Parrallelism::enableNestedParallelism()
-
Centrality
- Remark: The implementation of
TopHarmonicClosenesswas reworked entirely. In the new version all formerlyprotectedfunctions are removed. ThepublicAPI has not changed. TopHarmonicCloseness::BFSbound()TopHarmonicCloseness::BFScut()TopHarmonicCloseness::computeReachableNodesDirected()TopHarmonicCloseness::computeReachableNodesUndirected()TopHarmonicCloseness::init()Centrality::scores( bool moveOut )
- Remark: The implementation of
-
Components
- Remark: The recursive version of
StronglyConnectedComponentsis removed. To call the algorithm useStronglyConnectedComponents::run(). StronglyConnectedComponents::runIteratively()StronglyConnectedComponents::runRecursively()StronglyConnectedComponents::StronglyConnectedComponents( Graph const& G, bool iterativeAlgo )
- Remark: The recursive version of
-
In class
Graphquite some functions are removed with release of 8.0. They are now mostly available viaGraphTools:Graph::append()Graph::copyNodes()Graph::density()Graph::edges()Graph::maxDegree()Graph::maxDegreeIn()Graph::maxWeightedDegree()Graph::maxWeightedDegreeIn()Graph::merge()Graph::neighbors()Graph::nodes()Graph::randomEdge()Graph::randomEdges()Graph::randomNeighbor()Graph::randomNode()Graph::removeEdgesFromIsolatedSet()Graph::size()Graph::subgraphFromNodes()Graph::toString()Graph::toUndirected()Graph::toUnweighted()Graph::transpose()Graph::typ()Graph::volume()
- Distances
SSSP::getDistances( bool moveOut )toSSSP::getDistances()SSSP::getNodesSortedByDistance( bool moveOut )toSSSP::getNodesSortedByDistance()
- Randomization
GlobalTradeSequence.hppis now deprecated
- components
StronglyConnectedComponentsno longer supports recursive solving strategy.
- engineering
enableNestedParallelism()is no longer available
- graph
- The following functions are removed from the
graph-module. Most of them are available now from thegraphtools-module:append(),copyNodes(),density(),edges(),inNeighbors,maxDegree(),maxDegreeIn(),maxWeightedDegree(),maxWeightedDegreeIn(),merge(),neighbors(),randomEdge(),randomEdges(),randomNeighbor(),randomNode(),removeEdgesFromIsolatedSet(),size(),subgraphFromNodes(),toString(),toUndirected(),toUnweighted(),transpose(),typ(),volume()
- The following functions are removed from the
- Centrality
ApproximatePageRank::push()
- Distance
SSSP::getPredecessors()now returnsconst std::vector<node>&instead ofstd::vector<node>
runIteratively()andrunRecursively()are removed fromStronglyConnectedComponents. The default option is now to run in iterative mode. If the (now deprecated) recursive algorithm should be used, the constructor can be called accordingly.