Release news 11.2.

Author: fabratu

src/news.rst

@@ -18,6 +18,32 @@ News
 :hidden:`HiddenBiggerHeadingFont`
 ---------------------------------
 
+Nov 03, 2025: **NetworKit 11.2 released**
+~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+
+:underline:`New Features`:
+    - Add Python bindings for Kruskal and Prim Minimum Spanning Forest algorithms in the :code:`graph` module. Use :code:`nk.graph.KruskalMSF` and :code:`nk.graph.PrimMSF` to create an instance of the respective algorithm.
+
+
+:underline:`New algorithms`:
+    - Successive Shortest Path (SSP) algorithm for solving the Minimum-Cost Flow problem. The algorithm is currently only available in C++ via :code:`NetworKit::SuccessiveShortestPathMinCostFlow`. Thanks to Andreas Schwarf (@Schwarf) for the contribution.
+    - Dinic's blocking-flow algorithm for calculating maximum flow in directed, weighted graphs. The algorithm is currently only available in C++ via :code:`NetworKit::Dinic`. Thanks to Andreas Schwarf (@Schwarf) for the contribution.
+    - Floyd-Warshall algorithm for computing all-pairs shortest paths in a weighted graph. The algorithm is currently only available in C++ via :code:`NetworKit::FloydWarshall`. Thanks to Andreas Schwarf (@Schwarf) for the contribution.
+
+
+:underline:`Further changes and improvements`:
+    - Introduce :code:`getIndicator()` in :code:`RandomMaximumSpanningForest` and :code:`UnionMaximumSpanningForest`, which is an alias for :code:`getAttribute`. :code:`getAttribute` is deprecated in order to avoid confusion with edge / node attributes in the graph datastructure.
+    - Refactor :code:`addEdges()` in the Python interface of the :code:`Graph` class, such that unnecessary copies of the input edge list are avoided. As a result, there is a potential speedup when adding batches of edges to the graph. This also affects the constructor :code:`GraphFromCoo`. See `#1369 <https://github.com/networkit/networkit/pull/1369>`_ for details.
+
+:underline:`Notable Bug-Fixes`:
+    - Fix a bug in APSP algorithm, where larger matrices create an overflow of internal 32-bit helper variables when using :code:`getDistances()`. See `#1366 <https://github.com/networkit/networkit/issues/1366>`_ for details.
+    - Fix a bug when writing empty graphs to NetworKitBinary files. See `#1338 <https://github.com/networkit/networkit/pull/1338>`_ for details.
+    - Fix bug in :code:`ParallelLeiden`, where the algorithm could create disconnected communities. See `#1328 <https://github.com/networkit/networkit/pull/1328>`_ for details.
+
+|
+|
+
+
 Mar 10, 2025: **NetworKit 11.1 released**
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~