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.3.0 #357

Closed dependabot-preview[bot] closed 5 years ago

dependabot-preview[bot] commented 5 years ago

Bumps jgrapht-core from 1.1.0 to 1.3.0.

Changelog *Sourced from [jgrapht-core's changelog](https://github.com/jgrapht/jgrapht/blob/master/HISTORY.md).* > # HISTORY # > > Changes to JGraphT in each version: > > - **version 1.3.0** (12-Nov-2018): > - Prepared release cycle 1.2.1: removed deprecated code, updated dependencies, etc (contributed by Joris Kinable) > - Restored optional tests for `BergeGraphInspector` (contributed by Philipp Kaesgen) > - Use POSIX tar format for assembly (contributed by Mark Raynsford) > - Moved BrownBacktrackingColoring out of experimental, fixed bugs and wrote tests (contributed by Joris Kinable) > - Removed code not dual licensed under EPL-1.0 and LGPL-2.1-or-later: `AsUnweightedGraph` and `AsWeightedGraph` are gone. (supported by Robert Höttger and Oliver Kopp) > - Added forest generator based on the Barabasi-Albert model (contributed by Alexandru Văleanu) > - Added new implementation of `AsUnweightedGraph` and `AsWeightedGraph` (contributed by Lukas Harzenetter) > - Added pull request template (contributed by Oliver Kopp) > - Added `GraphSpecificsStrategy` and use the same edge set factory consistently (contributed by Dimitrios Michail) > - Added user overview doc (contributed by John Sichi) > - Clarified definition of `SimpleGraph` (contributed by Joris Kinable) > - Added O(m^1.5) algorithm for counting triangles in undirected graphs (contributed by Alexandru Văleanu) > - Calculate actual path weight in `AllDirectedPaths` (contributed by Andrew Gainer-Dewar) > - Refactored vertex cover tests (contributed by Alexandru Văleanu) > - Added `SimpleGraphMLImporter` for faster parsing (contributed by Dimitrios Michail) > - Increased numeric precision in PushRelabelMFImpl (contributed by Alexandru Văleanu) > - Added ColorRefinement and ColorRefinementIsomorphismInspector (contributed by Christoph Grüne, Daniel Mock, Oliver Feith and Abdallah Atouani) > - Improved efficiency of `BhandariKDisjointShortestPaths` (contributed by Assaf Mizrachi) > - Added `UnmodifiableUnionSet` to optimize `AsGraphUnion` (contributed by Dimitrios Michail) > - Made `GraphWalk` serializable (contributed by Alexandru Văleanu) > - Optimize `JohnsonShortestPaths` space usage (contributed by Dimitrios Michail) > - Heuristics for `FloydWarshallShortestPaths` (suggested by shevek, contributed by Dimitrios Michail) > - Added new `TreeToPathDecompositionAlgorithm` interface and implementation `HeavyPathDecomposition` (contributed by Alexandru Văleanu) > - Removed recursion from `FibonacciHeap` (contributed by Timofey Chudakov) > - Added `PruferTreeGenerator` for generating trees based on Prüfer sequences (contributed by Alexandru Văleanu) > - Added `VertexToIntegerMapping` utility class (contributed by Alexandru Văleanu) > - Handle maxLength=0 case in AllDirectedPaths (reported by Nikolas Havrikov, contributed by Andrew Gainer-Dewar) > - Added `SuurballeKDisjointShortestPaths` (contributed by Assaf Mizrachi) > - Make AsWeightedGraph propagate weight changes by default when backing graph is weighted (contributed by John Sichi) > - Fix assumptions about SAX `characters()` method calls in GraphML importers (contributed by Dimitrios Michail) > - Throw exception from no-arg `addVertex` when duplicate vertex generated (contributed by Dimitrios Michail) > - Replace `GenericFibonacciHeap` with dependency on jheaps library (contributed by Dimitrios Michail) > - Added `DulmageMendelsohnDecomposition` (contributed by Peter Harman) > - Package one bundle jar instead of multiple uber jars (contributed by Dimitrios Michail) > - Removed touchgraph support and corresponding module jgrapht-touchgraph (contributed by John Sichi) > - Added `ClusteringCoefficient` to compute the local and global clustering coefficient of a graph (contributed by Alexandru Văleanu) > - Refactored LCA interface, reimplemented Tarjan's algorithm and added HeavyPathLCAFinder, BinaryLiftingLCAFinder, EulerTourRMQLCAFinder (contributed by Alexandru Văleanu) > - Added jgrapht-opt module with fastutil graph implementation (contributed by Dimitrios Michail) > - Added negative weight cycle reporting in Bellman-Ford (contributed by Dimitrios Michail in response to proposal from Miron Balcerzak) > - Added `KolmogorovMinimumWeightPerfectMatching` (contributed by Timofey Chudakov) > - Added graph implementation specific for integer vertices and fastutil map to jgrapht-opt module (contributed by Dimitrios Michail) > - Added Christofides algorithm for computing 3/2 approximate TSP solutions (contributed by Timofey Chudakov) > - Fixed bug in HeldKarpTSP (reported by Timofey Chudako, contributed by Alexandru Văleanu) > - Addded `PartitioningAlgorithm` interface and `BipartitePartitioning` implementation for recognizing bipartite graphs (contributed by Alexandru Văleanu) > - Fixed bug in `GraphTests.isStronglyConnected`: undirected graphs are now correctly identified as strongly connected whenever the graph is connected (reported by Joris Kinable, contributed by Dimitrios Michail) > ... (truncated)
Commits - [`a749d43`](https://github.com/jgrapht/jgrapht/commit/a749d434f04747cad7c29d14dad6d9056d1d6a66) [maven-release-plugin] prepare release jgrapht-1.3.0 - [`fefab49`](https://github.com/jgrapht/jgrapht/commit/fefab4985397415a69567c21c1f5033070b44148) jgrapht release 1.3.0 preparation ([#707](https://github-redirect.dependabot.com/jgrapht/jgrapht/issues/707)) - [`0b1dab8`](https://github.com/jgrapht/jgrapht/commit/0b1dab89957ef920d75f0b93fe1b808cb03bd6d9) updated README for release 1.3 - [`4b52701`](https://github.com/jgrapht/jgrapht/commit/4b5270173d1d03393ca98d2ba98f9f09fa92970b) Update HISTORY.md - [`52e0057`](https://github.com/jgrapht/jgrapht/commit/52e0057f4d050f9a1878eb04969b1f896c825560) Update HISTORY.md - [`f014428`](https://github.com/jgrapht/jgrapht/commit/f014428e114e4fd22b666259094a50e922394691) Update HISTORY.md - [`fdd5c35`](https://github.com/jgrapht/jgrapht/commit/fdd5c35e81b7282cc16516879f9767a7757946cd) Some small optimizations for Edmonds maximum cardinality matchings ([#700](https://github-redirect.dependabot.com/jgrapht/jgrapht/issues/700)) - [`bd51a34`](https://github.com/jgrapht/jgrapht/commit/bd51a349c30fa4f8d284d722d61ccfcfcc770ade) Credits for last merge - [`586729e`](https://github.com/jgrapht/jgrapht/commit/586729e66c8fcefcdcd713b03086762337c1ffd7) unified flow interfaces ([#694](https://github-redirect.dependabot.com/jgrapht/jgrapht/issues/694)) - [`6490e33`](https://github.com/jgrapht/jgrapht/commit/6490e33c261141253742a7e62d2c75a24cc6c96f) Credits for last merge - Additional commits viewable in [compare view](https://github.com/jgrapht/jgrapht/compare/jgrapht-1.1.0...jgrapht-1.3.0)


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 cancel merge` will cancel a previously requested merge - `@dependabot reopen` will reopen this PR if it is closed - `@dependabot ignore this [patch|minor|major] version` will close this PR and stop Dependabot creating any more for this minor/major 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) - Automerge options (never/patch/minor, and dev/runtime dependencies) - Pull request limits (per update run and/or open at any time) - Out-of-range updates (receive only lockfile updates, if desired) - Security updates (receive only security updates, if desired) Finally, you can contact us by mentioning @dependabot.
dependabot-preview[bot] commented 5 years ago

Superseded by #391.