(entrypoint: str, call_graph: Dict[str, str])
| 61 | |
| 62 | |
| 63 | def get_function_dependency(entrypoint: str, call_graph: Dict[str, str]) -> Set[str]: |
| 64 | queue = [entrypoint] |
| 65 | visited = {entrypoint} |
| 66 | while queue: |
| 67 | current = queue.pop(0) |
| 68 | if current not in call_graph: |
| 69 | continue |
| 70 | for neighbour in call_graph[current]: |
| 71 | if not (neighbour in visited): |
| 72 | visited.add(neighbour) |
| 73 | queue.append(neighbour) |
| 74 | return visited |
| 75 | |
| 76 | |
| 77 | def get_definition_name(node: Node) -> str: |
no outgoing calls
no test coverage detected