Compute topologically sorted library cycles.

pkg/front_end/test/subpackage_relationships_test.dart

 // Copyright (c) 2017, 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.
 
 import 'dart:async';
 import 'dart:io';
 
 import 'package:front_end/compiler_options.dart';
 import 'package:front_end/dependency_grapher.dart';
 import 'package:path/path.dart' as pathos;
@@ skipping 97 matching lines @@
     'lib/src/scanner',
   ]),
   'lib/src/fasta/type_inference': new SubpackageRules(allowedDependencies: [
     'lib/src',
     'lib/src/base',
     'lib/src/fasta',
   ]),
   'lib/src/fasta/util': new SubpackageRules(),
   'lib/src/incremental': new SubpackageRules(allowedDependencies: [
     'lib',
+    'lib/src',
     'lib/src/fasta',
     'lib/src/fasta/parser',
     'lib/src/fasta/source',
   ]),
   'lib/src/scanner': new SubpackageRules(allowedDependencies: [
     'lib/src/base',
     // For error codes.
     'lib/src/fasta',
     // fasta scanner produces analyzer scanner tokens
     'lib/src/fasta/scanner',
@@ skipping 156 matching lines @@
       if (subpackageRules[subpackage].allowSubdirs) {
         subpackageRules[subpackage].actuallyHasSubdirs = true;
       } else {
         problem('Uri $src is in a subfolder of $subpackage, but that '
             'subpackage does not allow dart files in subdirectories.');
       }
     }
     return subpackage;
   }
 }