format.

benchmark/bin/graph_crawler_benchmark.dart

@@ -46,15 +46,15 @@ void main() {
   group('Topology:', () {
     benchmark('path', () {
       gc.path(a, g);
-    }, duration: Duration(milliseconds:100));
+    }, duration: Duration(milliseconds: 100));
     benchmark('paths', () {
       gc.path(a, g);
-    }, duration: Duration(milliseconds:100));
+    }, duration: Duration(milliseconds: 100));
     benchmark('tree', () {
       gc.tree(a);
-    }, duration: Duration(milliseconds:100));
+    }, duration: Duration(milliseconds: 100));
     benchmark('mappedTree', () {
       gc.mappedTree(a);
-    }, duration: Duration(milliseconds:100));
+    }, duration: Duration(milliseconds: 100));
   });
 }

benchmark/bin/weighted_directed_graph_benchmark.dart

@@ -58,49 +58,49 @@ void main() {
     benchmark('remove vertex l', () {
       graph.remove(l);
       graph.addEdges(i, {l: 3});
-    }, duration: Duration(milliseconds:100));
+    }, duration: Duration(milliseconds: 100));
     benchmark('sort edges', () {
       graph.sortEdges();
-    }, duration: Duration(milliseconds:100));
+    }, duration: Duration(milliseconds: 100));
     benchmark('sort edges by weight', () {
       graph.sortEdgesByWeight();
-    }, duration: Duration(milliseconds:100));
+    }, duration: Duration(milliseconds: 100));
   });
   group('Topology:', () {
     benchmark('isAcyclic', () {
       graph.isAcyclic;
-    }, duration: Duration(milliseconds:100));
+    }, duration: Duration(milliseconds: 100));
     benchmark('topologicalOrdering', () {
       graph.topologicalOrdering;
-    }, duration: Duration(milliseconds:100));
+    }, duration: Duration(milliseconds: 100));
     benchmark('sortedTopologicalOrdering', () {
       graph.sortedTopologicalOrdering;
-    }, duration: Duration(milliseconds:100));
+    }, duration: Duration(milliseconds: 100));
     benchmark('transitiveClosure', () {
       WeightedDirectedGraph.transitiveClosure(graph);
-    }, duration: Duration(milliseconds:100));
+    }, duration: Duration(milliseconds: 100));
     benchmark('cycleVertex', () {
       graph.cycleVertex;
-    }, duration: Duration(milliseconds:100));
+    }, duration: Duration(milliseconds: 100));
     benchmark('cycle', () {
       graph.cycle;
-    }, duration: Duration(milliseconds:100));
+    }, duration: Duration(milliseconds: 100));
     benchmark('localSources', () {
       graph.localSources;
-    }, duration: Duration(milliseconds:100));
+    }, duration: Duration(milliseconds: 100));
     benchmark('stronglyConnectedComponents', () {
       graph.stronglyConnectedComponents;
-    }, duration: Duration(milliseconds:100));
+    }, duration: Duration(milliseconds: 100));
     benchmark('shortestPaths', () {
       graph.shortestPaths(a);
-    }, duration: Duration(milliseconds:100));
+    }, duration: Duration(milliseconds: 100));
   });
   group('Selecting path by weight:', () {
     benchmark('lightest path a -> g', () {
       graph.lightestPath(a, g);
-    }, duration: Duration(milliseconds:100));
+    }, duration: Duration(milliseconds: 100));
     benchmark('heaviest path a -> g', () {
       graph.heaviestPath(a, g);
-    }, duration: Duration(milliseconds:100));
+    }, duration: Duration(milliseconds: 100));
   });
 }

test/weighted_directed_graph_test.dart

@@ -287,7 +287,6 @@ void main() {
   });
 
   group('Default comparator', () {
-
     final graph = WeightedDirectedGraph<String, int>(
       {
         a: {b: 1, h: 7, c: 2, e: 4},

tool/actions.sh

@@ -28,7 +28,7 @@ echo -e "${PURPLE}=== Checking Source Code Formatting${RESET} $PWD..."
 echo
 # Overwrite files with formatted content: -w
 # Dry run: -n
-dart format bin lib test
+dart format lib test example benchmark
 
 # Analyze dart files
 echo