build(deps): bump jgrapht-core from 1.1.0 to 1.5.1

[dependabot-preview]

Bumps jgrapht-core from 1.1.0 to 1.5.1.

Changelog

Sourced from jgrapht-core's changelog.

HISTORY

Changes to JGraphT in each version:

• version 1.5.2 (under development)

  • Prepared release cycle 1.5.2: removed deprecated code, updated dependencies (contributed by Joris Kinable)
  • Fixed NPE when no path exists in DijkstraManyToManyShortestPaths (contributed by Dimitrios Michail)

• version 1.5.1 (18-Mar-2021)

  • Prepared release cycle 1.5.1: removed deprecated code, updated dependencies (contributed by Joris Kinable)
  • Fix non-determinism in BaseKDisjointShortestPathsAlgorithm (reported by andreamarotta, contributed by Assaf Mizrachi)
  • Avoid package self-import in MANIFEST.MF (contributed by Hannes Wellmann)
  • Fixes issue with reverse path weights in DijkstraManyToManyShortestPath (contributed by Semen Chudakov)
  • Added RescaleLayoutAlgorithm2D - layout model rescaling algorithm (contributed by Dimitrios Michail)
  • Bug fix by rewriting algorithmic part of NaiveLCAFinder (contributed by Timofey Chudakov)
  • Added Boykov-Kolmogorov maximum flow algorithm for computer-vision related flow networks (contributed by Timofey Chudakov)
  • Added TransitNodeRoutingShortestPathAlgorithm (contributed by Semen Chudakov)
  • Added Zachary's karate club named graph (contributed by Dimitrios Michail)
  • Simplified graph creation in tests (contributed by Timofey Chudakov)
  • Add RandomWalkVertexIterator, replacing RandomWalkIterator (contributed by Dimitrios Michail)
  • Fixed identically-positioned and isolated vertices inFRLayoutAlgorithm2D (reported by rlbns, contributed by Dimitrios Michail)
  • Added Zhang-Shasha tree edit distance (contributed by Semen Chudakov)
  • GraphMetrics.naiveCountTriangles now returns the correct number of triangles when multiple edges are present (reported by FlorentinD, contributed by Dimitrios Michail)
  • Fixed JSON importer issue with negative integer weights (see #982) (reported by xianfuzheng, contributed by Dimitrios Michail)
  • Enabled checkstyle for test files (contributed by Szabolcs Besenyei)
  • Fixed hashCode/equals on weighted graphs (reported by Sebastiano Vigna, contributed by Dimitrios Michail)
  • 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)
  • Bring back importer support for supplying attributes at the point where vertex/edge instantiation occurs (reported by Sebastian Goeb, contributed by Dimitrios Michail)
  • Added GraphIterables interface extension for big graph support (suggested by Sebastiano Vigna, contributed by Dimitrios Michail)
  • Fixed label propagation clustering bug with isolated vertices (contributed by Dimitrios Michail)
  • Added Bipartite layout drawing algorithm (contributed by Dimitrios Michail)
  • Fixed addEdge in AbstractGraphBuilder (contributed by Baljit Singh)
  • Added code of conduct (contributed by John Sichi)
  • Added documentation for graph thread safety and updated graph equality (contributed by John Sichi)
  • Enhanced and refactored AlphaCentrality to Katz- and Eigenvector-Centrality (contributed by Sebastiano Vigna)
  • Added overflow strategy in BetweennessCentrality (contributed by Dimitrios Michail)
  • Replaced VertexDegreeComparator and GeneralVertexDegreeComparator objects with lambda (contributed by Hannes Wellmann)
  • Improved performance of the weighted PageRank algorithm by caching graph adjacency lists (contributed by Florentin Dörre)
  • Optimized integer to vertex mappings in several algorithms (contributed by Hannes Wellmann)
  • Added a collection of local algorithms for link prediction (contributed by Dimitrios Michail)
  • Fixed some linty Integer comparisons (contributed by Dimitrios Michail)
  • Added ThreadPoolExecutor parameter to all parallel algorithms (contributed by Semen Chudakov)
  • Fixed bug in DeltaSteppingShortestPath (see #994) (reported by Andreas Hartung, contributed by Semen Chudakov)
  • Added NETGEN-style problems generator (contributed by Timofey Chudakov)
  • Added algorithm for minimum cycle mean (contributed by Semen Chudakov)
  • Replace Travis CI with Github Actions (contributed by Szabolcs Besenyei)
  • Added WebGraph adapter (contributed by Sebastiano Vigna with assistance from Dimitrios Michail)
  • Added support for vertex provider with attributes in JSONImporter (contributed by Dimitrios Michail)
  • Added edge betweenness centrality algorithm (contributed by Dimitrios Michail)

... (truncated)

Commits

• 7256e6a Merge branch 'master' of https://github.com/jgrapht/jgrapht
• a0784fe [maven-release-plugin] prepare release jgrapht-1.5.1
• 0b92fd3 code formatting (#1050)
• c5dfc4f Credits for last merge.
• f7f0ebe Improvements of StrongConnectivityInspector algorithms (#1020)
• 0c01c7f Credits for last merge.
• b61ebd4 Simplifications and minor improvements of HamiltonianCycleAlgorithms (#936)
• dae7981 Credits for last merge.
• 6ad6394 Make exceptions public top-level classes (#1049)
• 5cbf13b updated copyright year to 2021 (#1048)
• Additional commits viewable in compare view

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 commands and options

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)
• @dependabot use these labels will set the current labels as the default for future PRs for this repo and language
• @dependabot use these reviewers will set the current reviewers as the default for future PRs for this repo and language
• @dependabot use these assignees will set the current assignees as the default for future PRs for this repo and language
• @dependabot use this milestone will set the current milestone as the default for future PRs for this repo and language
• @dependabot badge me will comment on this PR with code to add a "Dependabot enabled" badge to your readme

Additionally, you can set the following in your Dependabot dashboard:

• Update frequency (including time of day and day of week)
• Pull request limits (per update run and/or open at any time)
• Automerge options (never/patch/minor, and dev/runtime dependencies)
• Out-of-range updates (receive only lockfile updates, if desired)
• Security updates (receive only security updates, if desired)