dependabot[bot] opened a new pull request, #1075: URL: https://github.com/apache/streampipes/pull/1075
Bumps [jgrapht-core](https://github.com/jgrapht/jgrapht) from 1.3.1 to 1.5.1. <details> <summary>Changelog</summary> <p><em>Sourced from <a href="https://github.com/jgrapht/jgrapht/blob/master/HISTORY.md";>jgrapht-core's changelog</a>.</em></p> <blockquote> <h1>HISTORY</h1> <p>Changes to JGraphT in each version:</p> <ul> <li> <p><strong>version 1.5.2</strong> (under development)</p> <ul> <li>Prepared release cycle 1.5.2: removed deprecated code, updated dependencies (contributed by Joris Kinable)</li> <li>Fixed NPE when no path exists in <code>DijkstraManyToManyShortestPaths</code> (contributed by Dimitrios Michail)</li> <li>Fixed NaN exception in case of a zero displacement in <code>FRLayoutAlgorithm2D</code> (contributed by Dimitrios Michail)</li> <li>Fixed Eclipse warnings in tests (contributed by Hannes Wellmann)</li> <li>Enforced naming conventions in checkstyle, allowing Latin chars (contributed by Hannes Wellmann)</li> <li>Bug fix for <code>TSPLIBImporter</code> which failed to parse burma14 due to multi-space delimiters (reported by Joris Kinable, contributed by Hannes Wellmann)</li> <li>Fixed succinct graph constructors in outgoing-only case (contributed by Sebastiano Vigna)</li> <li>Added support for custom names in vertices/edges collections in JSON I/O (contributed by Dimitrios Michail)</li> <li>Fixed assertion message in succinct graphs (contributed by Rostislav Svoboda)</li> <li>Made result ordering predictable in some algorithms (contributed by Dimitrios Michail)</li> <li>Added user guide for WebGraph and Sux4J adapters (contributed by Sebastiano Vigna)</li> <li>Github Actions maintenance (contributed by Szabolcs Besenyei)</li> <li>Added graph specifics strategy parameter for <code>DirectedAcyclicGraph</code> (contributed by Dariusz Dudek)</li> <li>Added explicit <code>NotDirectedAcyclicGraphException</code> (contributed by Kaiichiro Ota)</li> <li>Added explicit <code>GraphCycleProhibitedException</code> (contributed by Magnus Gunnarsson)</li> <li>Support custom vertex types in <code>DeltaSteppingShortestPath</code> (contributed by Semen Chudakov)</li> <li>Added path validation to <code>AllDirectedPaths</code> (contributed by Frans van Buul)</li> <li>Added <code>ApBetweennessCentrality</code> using new dependency on apfloat library (contributed by Dimitrios Michail)</li> <li>Added <code>UndirectedModularityMeasurer</code> (contributed by Dimitrios Michail)</li> <li>Added callback API to <code>DirectedSimpleCycles</code> interface (contributed by Sérgio Faria)</li> <li>Upgraded commons-text to 1.10.0 and antlr4-runtime to 4.9.3 (contributed by Rene Leonhardt)</li> </ul> </li> <li> <p><strong>version 1.5.1</strong> (18-Mar-2021)</p> <ul> <li>Prepared release cycle 1.5.1: removed deprecated code, updated dependencies (contributed by Joris Kinable)</li> <li>Fix non-determinism in <code>BaseKDisjointShortestPathsAlgorithm</code> (reported by andreamarotta, contributed by Assaf Mizrachi)</li> <li>Avoid package self-import in MANIFEST.MF (contributed by Hannes Wellmann)</li> <li>Fixes issue with reverse path weights in <code>DijkstraManyToManyShortestPath</code> (contributed by Semen Chudakov)</li> <li>Added <code>RescaleLayoutAlgorithm2D</code> - layout model rescaling algorithm (contributed by Dimitrios Michail)</li> <li>Bug fix by rewriting algorithmic part of <code>NaiveLCAFinder</code> (contributed by Timofey Chudakov)</li> <li>Added Boykov-Kolmogorov maximum flow algorithm for computer-vision related flow networks (contributed by Timofey Chudakov)</li> <li>Added <code>TransitNodeRoutingShortestPathAlgorithm</code> (contributed by Semen Chudakov)</li> <li>Added Zachary's karate club named graph (contributed by Dimitrios Michail)</li> <li>Simplified graph creation in tests (contributed by Timofey Chudakov)</li> <li>Add <code>RandomWalkVertexIterator</code>, replacing <code>RandomWalkIterator</code> (contributed by Dimitrios Michail)</li> <li>Fixed identically-positioned and isolated vertices in<code>FRLayoutAlgorithm2D</code> (reported by rlbns, contributed by Dimitrios Michail)</li> <li>Added Zhang-Shasha tree edit distance (contributed by Semen Chudakov)</li> <li><code>GraphMetrics.naiveCountTriangles</code> now returns the correct number of triangles when multiple edges are present (reported by FlorentinD, contributed by Dimitrios Michail)</li> <li>Fixed JSON importer issue with negative integer weights (see <a href="https://github-redirect.dependabot.com/jgrapht/jgrapht/issues/982";>#982</a>) (reported by xianfuzheng, contributed by Dimitrios Michail)</li> <li>Enabled checkstyle for test files (contributed by Szabolcs Besenyei)</li> <li>Fixed hashCode/equals on weighted graphs (reported by Sebastiano Vigna, contributed by Dimitrios Michail)</li> <li>Changed hashCode/equals to ignore edge direction on undirected graphs, and made source/target assignment harmonious for EndpointPair in Guava adapter (reported by Sebastiano Vigna, contributed by Dimitrios Michail)</li> <li>Bring back importer support for supplying attributes at the point where vertex/edge instantiation occurs (reported by Sebastian Goeb, contributed by Dimitrios Michail)</li> <li>Added <code>GraphIterables</code> interface extension for big graph support (suggested by Sebastiano Vigna, contributed by Dimitrios Michail)</li> <li>Fixed label propagation clustering bug with isolated vertices (contributed by Dimitrios Michail)</li> <li>Added Bipartite layout drawing algorithm (contributed by Dimitrios Michail)</li> </ul> </li> </ul> <!-- raw HTML omitted --> </blockquote> <p>... (truncated)</p> </details> <details> <summary>Commits</summary> <ul> <li><a href="https://github.com/jgrapht/jgrapht/commit/7256e6a63bbb5890c8c32051707854e3ace13d03";><code>7256e6a</code></a> Merge branch 'master' of <a href="https://github.com/jgrapht/jgrapht";>https://github.com/jgrapht/jgrapht</a></li> <li><a href="https://github.com/jgrapht/jgrapht/commit/a0784fe7afb6a2762a397ad5a72c29301ebca09a";><code>a0784fe</code></a> [maven-release-plugin] prepare release jgrapht-1.5.1</li> <li><a href="https://github.com/jgrapht/jgrapht/commit/0b92fd35f4a21777498c8d7eaf822e64a465b7c8";><code>0b92fd3</code></a> code formatting (<a href="https://github-redirect.dependabot.com/jgrapht/jgrapht/issues/1050";>#1050</a>)</li> <li><a href="https://github.com/jgrapht/jgrapht/commit/c5dfc4f850da78a37e39e2b48eb7957dab291848";><code>c5dfc4f</code></a> Credits for last merge.</li> <li><a href="https://github.com/jgrapht/jgrapht/commit/f7f0ebe57ced34a7aa1bd3711e349b55dabe2f39";><code>f7f0ebe</code></a> Improvements of StrongConnectivityInspector algorithms (<a href="https://github-redirect.dependabot.com/jgrapht/jgrapht/issues/1020";>#1020</a>)</li> <li><a href="https://github.com/jgrapht/jgrapht/commit/0c01c7f65edbc38ad5d34087503288642b54bc59";><code>0c01c7f</code></a> Credits for last merge.</li> <li><a href="https://github.com/jgrapht/jgrapht/commit/b61ebd403a40512e4836c82929d6a24c0c06f4c7";><code>b61ebd4</code></a> Simplifications and minor improvements of HamiltonianCycleAlgorithms (<a href="https://github-redirect.dependabot.com/jgrapht/jgrapht/issues/936";>#936</a>)</li> <li><a href="https://github.com/jgrapht/jgrapht/commit/dae798149bee925557f9e179048c796ad71127fe";><code>dae7981</code></a> Credits for last merge.</li> <li><a href="https://github.com/jgrapht/jgrapht/commit/6ad6394e9cf5c2d57ad2baad4bf05b9e19702b01";><code>6ad6394</code></a> Make exceptions public top-level classes (<a href="https://github-redirect.dependabot.com/jgrapht/jgrapht/issues/1049";>#1049</a>)</li> <li><a href="https://github.com/jgrapht/jgrapht/commit/5cbf13bd8deb932167e99dd21092b7a57208f3b5";><code>5cbf13b</code></a> updated copyright year to 2021 (<a href="https://github-redirect.dependabot.com/jgrapht/jgrapht/issues/1048";>#1048</a>)</li> <li>Additional commits viewable in <a href="https://github.com/jgrapht/jgrapht/compare/jgrapht-1.3.1...jgrapht-1.5.1";>compare view</a></li> </ul> </details> <br /> [](https://docs.github.com/en/github/managing-security-vulnerabilities/about-dependabot-security-updates#about-compatibility-scores) Dependabot will resolve any conflicts with this PR as long as you don't alter it yourself. You can also trigger a rebase manually by commenting `@dependabot rebase`. [//]: # (dependabot-automerge-start) [//]: # (dependabot-automerge-end) --- <details> <summary>Dependabot commands and options</summary> <br /> You can trigger Dependabot actions by commenting on this PR: - `@dependabot rebase` will rebase this PR - `@dependabot recreate` will recreate this PR, overwriting any edits that have been made to it - `@dependabot merge` will merge this PR after your CI passes on it - `@dependabot squash and merge` will squash and merge this PR after your CI passes on it - `@dependabot cancel merge` will cancel a previously requested merge and block automerging - `@dependabot reopen` will reopen this PR if it is closed - `@dependabot close` will close this PR and stop Dependabot recreating it. You can achieve the same result by closing it manually - `@dependabot ignore this major version` will close this PR and stop Dependabot creating any more for this major version (unless you reopen the PR or upgrade to it yourself) - `@dependabot ignore this minor version` will close this PR and stop Dependabot creating any more for this minor version (unless you reopen the PR or upgrade to it yourself) - `@dependabot ignore this dependency` will close this PR and stop Dependabot creating any more for this dependency (unless you reopen the PR or upgrade to it yourself) </details> -- This is an automated message from the Apache Git Service. To respond to the message, please log on to GitHub and use the URL above to go to the specific comment. To unsubscribe, e-mail: [email protected] For queries about this service, please contact Infrastructure at: [email protected]
