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

[dependabot-preview]

Bumps jgrapht-core from 1.1.0 to 1.3.1.

Changelog

Sourced from jgrapht-core's changelog.

HISTORY

Changes to JGraphT in each version:

• version 1.3.2 (under development):

  • Prepared release cycle 1.3.2: removed deprecated code, updated dependencies, etc (contributed by Joris Kinable)

• 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)
  • Updated examples with Guava adapter example (contributed by John Sichi)
  • Added Warnsdorff rule heuristic and Parberry's algorithm for closed knight's tour problem to demo package (contributed by Kirill Vishnyakov)
  • Added min weight, max weight and max weight perfect matching algorithms (contributed by Timofey Chudakov)
  • Fixed bug where DOTImporter throws NullPointerException when trying to parse a vertex without attributes (contributed by Dimitrios Michail)
  • Added BFS as a shortest path algorithm (contributed by Karri Sai Satish Kumar Reddy)
  • Added concurrent implementation of the delta-stepping shortest path algorithm (contributed by Semen Chudakov)
  • Added support for the capacitated minimum spanning tree (CMST) problem (contributed by Christoph Grüne)
  • Made GraphMLImporter ordering deterministic (contributed by Dimitrios Michail)
  • Added bidirectional A-star (contributed by Semen Chudakov)
  • Added Yen's k shortest loopless paths algorithm (contributed by Semen Chudakov)
  • Defer graph vertex iterator initialization in CrossComponentIterator (contributed by John Sichi)
  • Updated jgraphx version to 3.9.8.1 (contributed by John Sichi)
  • Added JSON exporter and importer (contributed by Dimitrios Michail)
  • Enhanced DirectedAcyclicGraph to support multiple edges (contributed by Dimitrios Michail based on a suggestion by Sarat Chandra Balla)
  • Refactored SerializationTestUtils and made it generic (contributed by Lavish Kothari)
  • Added more serialization test coverage (contributed by Lavish Kothari)
  • Added Goldberg's algorithms for the calculation of maximum density subgraphs (contributed by Andre Immig)
  • Optimize UnmodifiableUnionSet to lazily read live sizes from underlying sets (contributed by John Sichi)
  • Added Eppsteins k-shortest paths algorithm (contributed by Semen Chudakov)

• 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)

... (truncated)

Commits

• bdec6a6 [maven-release-plugin] prepare release jgrapht-1.3.1
• c5b0359 code reformatting
• 9775c30 Updated dependency versions for 1.3.1 release
• 8612aad updated history and readme for release 1.3.1
• 4602a1d Update HISTORY.md
• acad8c6 Eppstein`s k shortest paths algorithm (#755)
• d97fd00 Credits for last merge
• 60c8a85 Optimize UnmodifiableUnionSet to lazily read live sizes from underlying sets ...
• 2a8a648 Credits for last merge.
• c97c18d JSON importer (#783)
• 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 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:

• 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]

Superseded by #416.