* The graph's executable roots — files that run something at module level (a * CLI, a worker entry, a script), ranked by calls x the number of other files * they reach. A statement at the top level of a file is recorded as an edge * out of the *file* node, which is what makes these visible
(
limit: number
)
| 2525 | * out of the *file* node, which is what makes these visible at all. |
| 2526 | */ |
| 2527 | getTopCallingFiles( |
| 2528 | limit: number |
| 2529 | ): Array<{ nodeId: string; filePath: string; calls: number; reaches: number; score: number }> { |
| 2530 | return this.queries.getTopCallingFiles(limit); |
| 2531 | } |
| 2532 | |
| 2533 | /** |
| 2534 | * How many other files depend on each of the given files, counted through |
nothing calls this directly
no outgoing calls
no test coverage detected