Updated deps, applied lints.

simphotonics · Apr 3, 2024 · a5003c1 · a5003c1
1 parent 5bfc09d
commit a5003c1
Show file tree

Hide file tree

Showing 4 changed files with 10 additions and 13 deletions.
diff --git a/CHANGELOG.md b/CHANGELOG.md
@@ -1,3 +1,7 @@
+## 0.4.2
+- Updated dependencies.
+- Applied suggested lints.
+
 ## 0.4.1
 - Updated section Usage.
 

diff --git a/lib/directed_graph.dart b/lib/directed_graph.dart
@@ -1,10 +1,3 @@
-/// Dart implementation of directed graphs.
-/// Provides methods to
-/// * add/remove edges,
-/// * check if the graph is acyclic,
-/// * retrieve cycles,
-/// * retrieve a list of vertices in topological order.
-
 export 'src/extensions/sort.dart';
 export 'src/graphs/bidirected_graph.dart';
 export 'src/graphs/directed_graph.dart';

diff --git a/lib/src/graphs/bidirected_graph.dart b/lib/src/graphs/bidirected_graph.dart
@@ -4,9 +4,9 @@ import 'directed_graph.dart';
 /// with symmetric edges.
 class BidirectedGraph<T extends Object> extends DirectedGraph<T> {
   BidirectedGraph(
-    Map<T, Set<T>> edges, {
-    Comparator<T>? comparator,
-  }) : super(edges, comparator: comparator) {
+    super.edges, {
+    super.comparator,
+  }) {
     // Render graph symmetric:
     _symmetrize();
   }

diff --git a/pubspec.yaml b/pubspec.yaml
@@ -3,7 +3,7 @@ name: directed_graph
 description: Generic directed graph and weighted directed graph with algorithms
   enabling sorting and topological ordering of vertices.
 
-version: 0.4.1
+version: 0.4.2
 
 homepage: https://github.com/simphotonics/directed_graph
 
@@ -18,5 +18,5 @@ dependencies:
 
 dev_dependencies:
   benchmark_runner: ^0.0.2
-  lints: ^2.1.1
-  test: ^1.24.6
+  lints: ^3.0.0
+  test: ^1.25.2