You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
* a better method for `DigraphReverse`[[Wilf A. Wilson][]]
702
702
* automorphism groups of complete, empty, cycle, chain, and complete bipartite
703
-
digraphs are set at creation [[Michael Torpey][]]
703
+
digraphs are set at creation [[Michael Young][]]
704
704
* a minor improvement in performance in the `DigraphMaximalCliques`[[Wilf A. Wilson][]]
705
705
* a new operation `AdjacencyMatrixMutableCopy`[[James D. Mitchell][]]
706
706
@@ -795,7 +795,7 @@ version, we welcomed Jan De Beule to the development team.
795
795
-`RepresentativeOutNeighbours`
796
796
797
797
[[Jan De Beule][], [Julius Jonusas][], [James D. Mitchell][],
798
-
[Michael Torpey][], [Wilf A. Wilson][]]
798
+
[Michael Young][], [Wilf A. Wilson][]]
799
799
800
800
## Version 0.3.2 (released 14/01/2016)
801
801
This is another minor release due to some missing build files in the Version
@@ -819,7 +819,7 @@ on the algorithm in [this paper](https://epubs.siam.org/doi/abs/10.1137/0204007)
819
819
### Issues Resolved in Version 0.3.0
820
820
* There was a memory leak in bliss-0.73, which is fixed in the copy of bliss included with Digraphs, but not in the official release of bliss. [[James D. Mitchell][]]
821
821
* Some bits of code that caused compiler warnings were improved. [[James D. Mitchell][]]
822
-
* Some memory leaks were resolved in the Digraphs kernel module. [[Michael Torpey][]]
822
+
* Some memory leaks were resolved in the Digraphs kernel module. [[Michael Young][]]
823
823
824
824
## Version 0.2.0 (released 04/09/2015)
825
825
The first release.
@@ -829,7 +829,7 @@ Pre-release version that was not made publicly available.
0 commit comments