| OLD | NEW |
| 1 // Copyright (c) 2016, the Dart project authors. Please see the AUTHORS file |
| 2 // for details. All rights reserved. Use of this source code is governed by a |
| 3 // BSD-style license that can be found in the LICENSE file. |
| 1 | 4 |
| 2 /** | 5 /** |
| 3 * Instances of [Node] represent nodes in a dependency graph. The | 6 * Instances of [Node] represent nodes in a dependency graph. The |
| 4 * type parameter, [NodeType], is the derived type (this affords some | 7 * type parameter, [NodeType], is the derived type (this affords some |
| 5 * extra type safety by making it difficult to accidentally construct | 8 * extra type safety by making it difficult to accidentally construct |
| 6 * bridges between unrelated dependency graphs). | 9 * bridges between unrelated dependency graphs). |
| 7 */ | 10 */ |
| 8 abstract class Node<NodeType> { | 11 abstract class Node<NodeType> { |
| 9 /** | 12 /** |
| 10 * Index used by Tarjan's strongly connected components algorithm. | 13 * Index used by Tarjan's strongly connected components algorithm. |
| (...skipping 145 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 156 } | 159 } |
| 157 evaluateScc(scc); | 160 evaluateScc(scc); |
| 158 } | 161 } |
| 159 } | 162 } |
| 160 } | 163 } |
| 161 | 164 |
| 162 // Kick off the algorithm starting with the starting point. | 165 // Kick off the algorithm starting with the starting point. |
| 163 strongConnect(startingPoint); | 166 strongConnect(startingPoint); |
| 164 } | 167 } |
| 165 } | 168 } |
| OLD | NEW |