Improve the output of "pub deps".

lib/src/command/deps.dart

 // Copyright (c) 2014, the Dart project authors.  Please see the AUTHORS file
 // for details. All rights reserved. Use of this source code is governed by a
 // BSD-style license that can be found in the LICENSE file.
 
 library pub.command.list;
 
 import 'dart:async';
 import 'dart:collection';
 
 import '../ascii_tree.dart' as tree;
@@ skipping 123 matching lines @@
   ///
   /// If a package is encountered more than once (i.e. a shared or circular
   /// dependency), later ones are not traversed. This is done in breadth-first
   /// fashion so that a package will always be expanded at the shallowest
   /// depth that it appears at.
   void _outputTree() {
     // The work list for the breadth-first traversal. It contains the package
     // being added to the tree, and the parent map that will receive that
     // package.
     var toWalk = new Queue<Pair<Package, Map>>();
-    var visited = new Set<String>();
+    var visited = new Set<String>.from([entrypoint.root.name]);
 
     // Start with the root dependencies.
     var packageTree = {};
     for (var dep in entrypoint.root.immediateDependencies) {
       toWalk.add(new Pair(_graph.packages[dep.name], packageTree));
     }
 
     // Do a breadth-first walk to the dependency graph.
     while (toWalk.isNotEmpty) {
       var pair = toWalk.removeFirst();
@@ skipping 26 matching lines @@
   Set<String> _getTransitiveDependencies() {
     var transitive = _graph.packages.keys.toSet();
     var root = entrypoint.root;
     transitive.remove(root.name);
     transitive.removeAll(root.dependencies.map((dep) => dep.name));
     transitive.removeAll(root.devDependencies.map((dep) => dep.name));
     transitive.removeAll(root.dependencyOverrides.map((dep) => dep.name));
     return transitive;
   }
 }