search

arquillian / smart-testing

We know which tests you want to run.
Apache License 2.0
25 stars 12 forks source link

build(deps): bump jgrapht-core from 1.1.0 to 1.4.0 #416

Closed dependabot-preview[bot] closed 4 years ago

dependabot-preview[bot] commented 4 years ago

Bumps jgrapht-core from 1.1.0 to 1.4.0.

Changelog

Sourced from jgrapht-core's changelog.

HISTORY

Changes to JGraphT in each version:

  • version 1.4.1 (under development):

    • Prepared release cycle 1.4.1: removed deprecated code, updated dependencies, upgraded java to version 11 (contributed by Joris Kinable)

  • version 1.4.0 (21-Feb-2020):

    • Prepared release cycle 1.3.2: removed deprecated code, updated dependencies, etc (contributed by Joris Kinable)
    • Format code in parallel (contributed by Joris Kinable)
    • Fix edge reuse bug in KDisjointShortestPaths implementations (contributed by Benjamin Krogh)
    • Updated Yen's algorithm to operate on pseudo graphs correctly (contributed by Semen Chudakov)
    • Updated Guava to version 28.0 (contributed by John Sichi)
    • Fixed bug in BiconnectivityInspector which would occasionally return an incorrect set of biconnected components (contributed by Reynaldo Gil Pons)
    • Allow edge selection to be overridden in CrossComponentIterator (contributed by Sean Hudson)
      • Reuse traversal listener implementation in tests (contributed by Timofey Chudakov)
      • Fixed bug in BetweennessCentrality which occasionally returned in incorrect centrality score for vertices in weighted graphs (contributed by Gil Pons)
      • Added path length limit to HawickJamesSimpleCycles (contributed by Edwin Ouwehand)
      • Added links in Guava adapater package-info (contributed by John Sichi)
      • Added Boyer-Myrvold planarity testing algorithm (contributed by Timofey Chudakov)
      • Added contraction hierarchy precomputation algorithm (contributed by Semen Chudakov)
      • Enhanced IntegerComponentNameProvider to take arbitrary base (contributed by Amr Alhossary)
      • Fixed a bug in the GraphWalk.equals() method which caused a NullpointerException when invoked on an empty walk (contributed by Volkov Viktor)
      • Added k-spanning-tree clustering algorithm (contributed by Dimitrios Michail)
      • Added directed scale-free graph generator (contributed by Amr Alhossary)
      • Enhanced CompleteGraphGenerator and CompleteBipartiteGraphGenerator to generate edges between existing vertices (contributed by Joris Kinable)
      • Added efficient bidirectional Dijkstra implementation based on contraction hierarchy (contributed by Semen Chudakov)
      • Added sparse graphs and event-based importers, and improved numerous algorithms (contributed by Dimitrios Michail)
      • Added CollectionUtil for preallocating maps and sets correctly (contributed by Hannes Wellmann)
      • Added efficient many-to-many shortest path algorithm based on contraction hierarchy (contributed by Semen Chudakov)
      • Added greedy, nearest-insertion, nearest-neighbor heuristic for TSP and improved stability in two-opt heuristic (contributed by Peter Harman)
      • Enhanced DoublyLinkedList by implementing the List and Deque interfaces (contributed by Hannes Wellmann)
      • Added dedicated class for ContractionHierarchy (contributed by Semen Chudakov)
      • Use try with resources in default implementations of GraphImporter and GraphExporter (contributed by Hannes Wellmann)
      • Fixed naive lca bug and code cleanup (reported by Shinpei Hayashi, contributed by Timofey Chudakov)
      • Enhanced Javadoc generation by adding compatibility with newer JDKs (contributed by Dimitrios Michail)
      • Reflection speedup (suggested by shevek, contributed by Dimitrios Michail)
      • Added a graph drawing component, including various layout algorithms incl., random, circular, and tree layouts, the Fruchterman and Reingold Force-Directed Placement algorithm, and a variation of the latter augmented with the Barnes-Hut indexing technique (contributed by Dimitrios Michail)

  • version 1.3.1 (3-Jun-2019):

    • Prepared release cycle 1.3.1: removed deprecated code, updated dependencies, etc (contributed by Joris Kinable)
    • Added new logo (from 99designs, with site additions by John Sichi and Joris Kinable)
    • Added new website (contributed by John Sichi)
    • Converted all methods and fields to protected in HierholzerEulerianCycle (contributed by simlu)
    • Optimized specifics hash lookups (contributed by Dimitrios Michail)
    • Fixed mobile website menu (contributed by Karri Sai Satish Kumar Reddy)
    • Upgraded Antlr version to 4.7.2 and jheaps to 0.10 (contributed by Dimitrios Michail)
    • Replaced URL with URI in HelloJGraphT example (contributed by Stephan Schroevers)
    • Deprecated FibonacciHeap (contributed by Timofey Chudakov)
    • Replaced usage of Graph.{vertex,edge}Set().contains() by Graph.contains{Vertex,Edge}() (contributed by Ned Twigg)
... (truncated)
Commits


Dependabot compatibility score

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](https://app.dependabot.com): - 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)
dependabot-preview[bot] commented 4 years ago

Superseded by #426.