Skip to content

Releases: JuliaGraphs/Graphs.jl

v1.13.2

01 Dec 15:39
424f49e

Choose a tag to compare

Graphs v1.13.2

Diff since v1.13.1

Merged pull requests:

v1.13.1

16 Aug 22:27
b5da85a

Choose a tag to compare

Graphs v1.13.1

Diff since v1.13.0

Merged pull requests:

  • Add missing parallel=:threads implementations (#429) (@topolarity)
  • use /test/Project.toml instead of [extras] in /Project.toml (#436) (@Krastanov)
  • turn off the precommit CI action (#442) (@Krastanov)
  • Bump actions/setup-python from 3 to 5 (#443) (@dependabot[bot])
  • Bump stefanzweifel/git-auto-commit-action from 5 to 6 (#444) (@dependabot[bot])
  • CompatHelper: bump compat for DataStructures to 0.19, (keep existing compat) (#454) (@github-actions[bot])

Closed issues:

  • is_cyclic: determine which cells contain issues (#450)

v1.13.0

05 Jun 14:08

Choose a tag to compare

Graphs v1.13.0

Diff since v1.12.1

Merged pull requests:

Closed issues:

  • Can we make a new release ? (#424)

v1.12.1

31 Mar 22:52
6130332

Choose a tag to compare

Graphs v1.12.1

Diff since v1.12.0

Merged pull requests:

Closed issues:

  • [BUG] Error when running example code UndefVarError: libsgtsnepi not defined (#396)
  • [BUG] isgraphical returns true for a non-graphical sequence (#400)
  • Stress Centrality (#408)
  • How to create a SimpleEdge{T <: Integer} edge list (#420)

v1.12.0

29 Sep 06:28
7994f2d

Choose a tag to compare

Graphs v1.12.0

Diff since v1.11.2

Merged pull requests:

Closed issues:

  • Function to return the adjacent nodes of a given node at a distance greater than 1 (#288)
  • [BUG] Compatibility issue when used alongside GraphPlot (#391)
  • Graphs.eulerian doesn't seem to exist? (#394)

v1.11.2

02 Jul 07:00
ec6ab1b

Choose a tag to compare

Graphs v1.11.2

Diff since v1.11.1

Merged pull requests:

Closed issues:

  • [OPTIM] perm_greedy_color (and thus all coloring algorithms) is running in O(n^2) instead of O(n) (#378)
  • [FR] Construct a graph corresponding to a binary relation (#384)
  • [FR] a function to efficiently check whether a graph is acyclic (#385)

v1.11.1

07 Jun 09:47
56e5604

Choose a tag to compare

Graphs v1.11.1

Diff since v1.11.0

Merged pull requests:

Closed issues:

  • [BUG] Extra vertices in Steiner tree (#380)

v1.11.0

05 May 07:23
9c8efd9

Choose a tag to compare

Graphs v1.11.0

Diff since v1.10.0

Merged pull requests:

Closed issues:

  • Question regarding non_backtracking_matrix function's return type (#326)
  • Inconsistent dependency on ArnoldiMethod (#354)
  • [BUG] edges(::SimpleGraph) is broken in 1.10.0 (#361)
  • [BUG] steiner_tree fails if only one terminal vertex is passed (#362)
  • [BUG] merge_vertices returns an undirected graph, even if the input is directed. (#363)
  • Incorrect documentation for dfs_tree. (#366)
  • dorogovtsev_mendes graph generator is running in O(n^2) (#370)

v1.10.0

05 Apr 19:10
c1cedee

Choose a tag to compare

Graphs v1.10.0

Diff since v1.9.0

Merged pull requests:

Closed issues:

  • [Port] A function that finds all simple paths (#46)
  • Doctests are failing (#192)
  • Girvan–Newman algorithm for community detection (#298)
  • EXCEPTION_ACCESS_VIOLATION on Windows (#311)
  • [BUG] mincut() gives wrong result (#324)

v1.9.0

28 Sep 17:17
0fa5f52

Choose a tag to compare

What's Changed

New Contributors

Full Changelog: v1.8.0...v1.9.0