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.2.0 #336

Closed dependabot-preview[bot] closed 5 years ago

dependabot-preview[bot] commented 6 years ago

Bumps jgrapht-core from 1.1.0 to 1.2.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.2.1** (under development): > - 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) > > - **version 1.2.0** (16-May-2018): > - Prepared release cycle 1.1.1: removed deprecated code, updated dependencies, etc (contributed by Joris Kinable) > - Updated demos (contributed by Dimitrios Michail) > - Added assertions to NeighborCache (contributed by Joris Kinable) > - Upgraded Antlr version to 4.7 (contributed by Dimitrios Michail) > - Rewrote `MaximumWeightBipartiteMatching` with exact arithmetic, introducing a `GenericFibonacciHeap` (contributed by Dimitrios Michail) > ... (truncated)
Commits - [`e76f734`](https://github.com/jgrapht/jgrapht/commit/e76f73409146e565f36021cef9a755d4d12c0f53) [maven-release-plugin] prepare release jgrapht-1.2.0 - [`a1cb310`](https://github.com/jgrapht/jgrapht/commit/a1cb310839c66ab19e019985f7071487e41968da) Merge pull request [#578](https://github-redirect.dependabot.com/jgrapht/jgrapht/issues/578) from jkinable/release1.2 - [`7b35896`](https://github.com/jgrapht/jgrapht/commit/7b35896568f81f1e8688624f0170a74bb25b42aa) fixed typo in BergeGraphInspector - [`16d173d`](https://github.com/jgrapht/jgrapht/commit/16d173d66b6f9b69c6b28d8aa41cf870c8ac6231) reverting back changes to xsd files - [`0d7ce90`](https://github.com/jgrapht/jgrapht/commit/0d7ce90e102aa26e260482f3195c5ec03ef725f3) optimized imports - [`8802a0b`](https://github.com/jgrapht/jgrapht/commit/8802a0beb4ad927a027d2be376e36326567595bb) performed code formatting - [`f8204d9`](https://github.com/jgrapht/jgrapht/commit/f8204d925de7779ddc15b5ab93ad575310a009ad) updated code formatter script with new modules - [`399c439`](https://github.com/jgrapht/jgrapht/commit/399c439511440c1483e83295898b14db4915ad49) updated readme and history - [`c26255a`](https://github.com/jgrapht/jgrapht/commit/c26255a8a43d78d9135fc3ffcc3a3a548ec60765) Update HISTORY.md - [`788e8d0`](https://github.com/jgrapht/jgrapht/commit/788e8d07fbb6a9969110f93a0606fe8fa3763742) Merge pull request [#517](https://github-redirect.dependabot.com/jgrapht/jgrapht/issues/517) from assimiz/KDisjointShortestPaths---New - Additional commits viewable in [compare view](https://github.com/jgrapht/jgrapht/compare/jgrapht-1.1.0...jgrapht-1.2.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 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.
bartoszmajsak commented 6 years ago

@lordofthejars results with

[ERROR] Failed to execute goal org.apache.maven.plugins:maven-compiler-plugin:3.7.0:compile (default-compile) on project strategy-affected: Compilation failure: Compilation failure: 
[ERROR] /home/travis/build/arquillian/smart-testing/strategies/affected/src/main/java/org/arquillian/smart/testing/strategies/affected/ClassDependenciesGraph.java:[47,19] cannot find symbol
[ERROR]   symbol:   class DirectedGraph
[ERROR]   location: package org.jgrapht
[ERROR] /home/travis/build/arquillian/smart-testing/strategies/affected/src/main/java/org/arquillian/smart/testing/strategies/affected/ClassDependenciesGraph.java:[59,19] cannot find symbol
[ERROR]   symbol:   class DirectedGraph
[ERROR]   location: class org.arquillian.smart.testing.strategies.affected.ClassDependenciesGraph
[ERROR] /home/travis/build/arquillian/smart-testing/strategies/affected/src/main/java/org/arquillian/smart/testing/strategies/affected/ClassDependenciesGraph.java:[189,22] invalid method reference
dependabot-preview[bot] commented 5 years ago

Superseded by #357.