Membuat docstring dan komentar untuk fungsi Python.
Anda dapat membuat kueri model secara langsung dan menguji hasil yang ditampilkan saat menggunakan parameter value yang berbeda dengan Konsol Cloud, atau dengan memanggil Vertex AI API secara langsung.
|
|||||||||||
Perintah FreeformHere are Python codes. Insert the document comment (docstring) for all functions, including the nested functions. def is_dag_dfs(graph): visited = set() on_stack = set() # Track nodes on recursion stack def dfs(node): if node in on_stack: return False # Back-edge found (cycle) if node in visited: return True on_stack.add(node) visited.add(node) for neighbor in graph.get(node, []): if not dfs(neighbor): return False on_stack.remove(node) return True return all(dfs(node) for node in graph) Respons```python def is_dag_dfs(graph): """ Determines if a directed graph is a Directed Acyclic Graph (DAG) using Depth-First Search (DFS). Args: graph (dict): A dictionary representing the graph, where keys are nodes and values are lists of adjacent nodes. Returns: bool: True if the graph is a DAG, False otherwise. """ visited = set() on_stack = set() # Track nodes on recursion stack def dfs(node): """ Performs DFS on the graph starting from the given node. Args: node: The node to start DFS from. Returns: bool: True if the graph is a DAG, False if a cycle is found. """ if node in on_stack: return False # Back-edge found (cycle) if node in visited: return True on_stack.add(node) visited.add(node) for neighbor in graph.get(node, []): if not dfs(neighbor): return False on_stack.remove(node) return True return all(dfs(node) for node in graph) ``` |
|