Merge pull request #46 from munificent/master

Prettify Dart version

Author: logicchains

dart.dart

@@ -1,53 +1,50 @@
 import 'dart:io';
-import 'dart:math' as Math;
+import 'dart:math' as math;
 
 class Route {
   final int dest, cost;
-
   Route(this.dest, this.cost);
 
   String toString() => "$dest $cost\n";
 }
 
-class Node{
-  final List<Route> neighbours = new List<Route>();
-
-  Node();
+class Node {
+  final neighbours = <Route>[];
 }
 
 void readPlacesAndFindPath() {
-  List<String> lines = new File('agraph').readAsLinesSync();
-  int numNodes = int.parse(lines[0]);
-  List nodes = new List<Node>.generate(numNodes, (int index) => new Node());
+  var lines = new File('agraph').readAsLinesSync();
+  var numNodes = int.parse(lines[0]);
+  var nodes = new List.generate(numNodes, (_) => new Node());
 
-  for(int i = 1; i < lines.length; i++){
-    List nums = lines[i].split(' ');
-    int node = int.parse(nums[0]);
-    int neighbour = int.parse(nums[1]);
-    int cost = int.parse(nums[2]);
+  for (var i = 1; i < lines.length; i++) {
+    var nums = lines[i].split(' ');
+    var node = int.parse(nums[0]);
+    var neighbour = int.parse(nums[1]);
+    var cost = int.parse(nums[2]);
 
-    nodes[node].neighbours.add(new Route(neighbour,cost));
+    nodes[node].neighbours.add(new Route(neighbour, cost));
   }
 
   var visited = new List<bool>.generate(numNodes, (int index) => false);
   var start = new DateTime.now();
-  int len = getLongestPath(nodes, 0, visited);
+  var len = getLongestPath(nodes, 0, visited);
   var duration = new DateTime.now().difference(start);
 
   print("$len LANGUAGE Dart ${duration.inMilliseconds}");
 }
 
-int getLongestPath(List<Node> nodes, int nodeID, List<bool> visited){
+int getLongestPath(List<Node> nodes, int nodeID, List<bool> visited) {
   visited[nodeID] = true;
-  int max = 0;
-  final List<Route> neighbors = nodes[nodeID].neighbours;
-  for (var i = 0, llen = neighbors.length; i < llen; i++) {
-    final Route neighbor = neighbors[i];
-    final int dest = neighbor.dest;
+  var max = 0;
+  var neighbors = nodes[nodeID].neighbours;
+  var neighborsLength = neighbors.length;
+  for (var i = 0; i < neighborsLength; i++) {
+    var neighbor = neighbors[i];
+    var dest = neighbor.dest;
     if (!visited[dest]) {
-      final int dist = neighbor.cost +
-          getLongestPath(nodes, dest, visited);
-      max = Math.max(dist, max);
+      var dist = neighbor.cost + getLongestPath(nodes, dest, visited);
+      max = math.max(dist, max);
     }
   }
 
@@ -59,4 +56,3 @@ int getLongestPath(List<Node> nodes, int nodeID, List<bool> visited){
 void main() {
   readPlacesAndFindPath();
 }
-