{"id":74840,"date":"2024-08-27T01:11:52","date_gmt":"2024-08-26T21:41:52","guid":{"rendered":"https:\/\/nabfollower.com\/blog\/processing-dags-with-async-python-and-graphlib-2c0g\/"},"modified":"2024-08-27T01:11:52","modified_gmt":"2024-08-26T21:41:52","slug":"processing-dags-with-async-python-and-graphlib-2c0g","status":"publish","type":"post","link":"https:\/\/nabfollower.com\/blog\/processing-dags-with-async-python-and-graphlib-2c0g\/","title":{"rendered":"\u067e\u0631\u062f\u0627\u0632\u0634 DAG \u0647\u0627 \u0628\u0627 \u067e\u0627\u06cc\u062a\u0648\u0646 \u0646\u0627\u0647\u0645\u06af\u0627\u0645 \u0648 graphlib"},"content":{"rendered":"

Summarize this content to 400 words in Persian Lang \u0627\u062e\u06cc\u0631\u0627\u064b \u0628\u0627 \u06cc\u06a9 \u0645\u0627\u0698\u0648\u0644 \u062c\u0627\u0644\u0628 \u062f\u0631 \u06a9\u062a\u0627\u0628\u062e\u0627\u0646\u0647 \u0627\u0633\u062a\u0627\u0646\u062f\u0627\u0631\u062f \u0628\u06cc \u0627\u0646\u062a\u0647\u0627 \u067e\u0627\u06cc\u062a\u0648\u0646 \u0645\u0648\u0627\u062c\u0647 \u0634\u062f\u0645: graphlib. \u0627\u06af\u0631 \u0642\u0628\u0644\u0627\u064b \u0628\u0627 \u0622\u0646 \u06a9\u0627\u0631 \u0646\u06a9\u0631\u062f\u0647 \u0627\u06cc\u062f\u060c \u0627\u06cc\u0646 \u06cc\u06a9 \u0627\u0628\u0632\u0627\u0631 \u06a9\u0648\u0686\u06a9 \u0627\u0633\u062a \u06a9\u0647 \u062f\u0631 Python 3.9 \u0627\u0636\u0627\u0641\u0647 \u0634\u062f\u0647 \u0627\u0633\u062a \u0648 \u0641\u0642\u0637 \u06cc\u06a9 \u06a9\u0644\u0627\u0633 \u0631\u0627 \u067e\u06cc\u0627\u062f\u0647 \u0633\u0627\u0632\u06cc \u0645\u06cc \u06a9\u0646\u062f: TopologicalSorter.<\/p>\n

\u0646\u0627\u0645 \u062e\u0648\u062f \u062a\u0648\u0636\u06cc\u062d\u06cc \u0627\u0633\u062a — \u0627\u06cc\u0646 \u06cc\u06a9 \u06a9\u0644\u0627\u0633 \u0628\u0631\u0627\u06cc \u0645\u0631\u062a\u0628 \u0633\u0627\u0632\u06cc \u062a\u0648\u067e\u0648\u0644\u0648\u0698\u06cc\u06a9\u06cc \u06cc\u06a9 \u0646\u0645\u0648\u062f\u0627\u0631 \u0627\u0633\u062a. \u0627\u0645\u0627 \u0645\u0646 \u0641\u06a9\u0631 \u0646\u0645\u06cc\u200c\u06a9\u0646\u0645 \u06a9\u0647 \u062f\u0631 \u0627\u0628\u062a\u062f\u0627 \u0641\u0642\u0637 \u0628\u0627 \u0645\u0631\u062a\u0628\u200c\u0633\u0627\u0632\u06cc \u0646\u0648\u0634\u062a\u0647 \u0634\u062f\u0647 \u0628\u0627\u0634\u062f\u060c \u0632\u06cc\u0631\u0627 API \u0646\u0633\u0628\u062a\u0627\u064b \u0645\u0631\u0645\u0648\u0632\u060c \u0627\u0645\u0627 \u0641\u0648\u0642\u200c\u0627\u0644\u0639\u0627\u062f\u0647 \u0645\u0641\u06cc\u062f\u06cc \u062f\u0627\u0631\u062f\u060c \u0645\u0627\u0646\u0646\u062f prepare() \u0631\u0648\u0634 \u06cc\u0627 is_active(). \u0627\u06cc\u0646 \u0645\u062b\u0627\u0644 \u062f\u0631 \u0645\u0633\u062a\u0646\u062f\u0627\u062a \u0628\u0647 \u0627\u0646\u06af\u06cc\u0632\u0647 \u067e\u0634\u062a \u0622\u0646 \u0627\u0634\u0627\u0631\u0647 \u0645\u06cc \u06a9\u0646\u062f:<\/p>\n

topological_sorter = TopologicalSorter()<\/p>\n

# Add nodes to ‘topological_sorter’…<\/p>\n

topological_sorter.prepare()
\nwhile topological_sorter.is_active():
\n for node in topological_sorter.get_ready():
\n # Worker threads or processes take nodes to work on off the
\n # ‘task_queue’ queue.
\n task_queue.put(node)<\/p>\n

# When the work for a node is done, workers put the node in
\n # ‘finalized_tasks_queue’ so we can get more nodes to work on.
\n # The definition of ‘is_active()’ guarantees that, at this point, at
\n # least one node has been placed on ‘task_queue’ that hasn’t yet
\n # been passed to ‘done()’, so this blocking ‘get()’ must (eventually)
\n # succeed. After calling ‘done()’, we loop back to call ‘get_ready()’
\n # again, so put newly freed nodes on ‘task_queue’ as soon as
\n # logically possible.
\n node = finalized_tasks_queue.get()
\n topological_sorter.done(node)<\/p>\n

\u0628\u0646\u0627\u0628\u0631\u0627\u06cc\u0646 graphlib \u06cc\u06a9 \u0645\u0627\u0698\u0648\u0644 \u0641\u0642\u0637 \u0628\u0631\u0627\u06cc \u0645\u0631\u062a\u0628\u200c\u0633\u0627\u0632\u06cc \u0646\u0645\u0648\u062f\u0627\u0631\u0647\u0627 \u0646\u06cc\u0633\u062a\u060c \u0628\u0644\u06a9\u0647 \u0627\u0628\u0632\u0627\u0631\u06cc \u0628\u0631\u0627\u06cc \u0627\u062c\u0631\u0627\u06cc \u0646\u0645\u0648\u062f\u0627\u0631\u0647\u0627\u06cc \u0648\u0638\u0627\u06cc\u0641 \u0628\u0647 \u062a\u0631\u062a\u06cc\u0628 \u062a\u0648\u067e\u0648\u0644\u0648\u0698\u06cc\u06a9\u06cc \u0627\u0633\u062a\u060c \u06a9\u0647 \u062f\u0631 \u0635\u0648\u0631\u062a\u06cc \u0645\u0641\u06cc\u062f \u0627\u0633\u062a \u06a9\u0647 \u062d\u062c\u0645 \u06a9\u0627\u0631\u06cc \u0634\u0645\u0627 \u0628\u0633\u062a\u0647 \u0628\u0647 \u0646\u062a\u0627\u06cc\u062c \u06a9\u0627\u0631\u0647\u0627\u06cc \u062f\u06cc\u06af\u0631 \u0648\u0638\u0627\u06cc\u0641\u06cc \u062f\u0627\u0634\u062a\u0647 \u0628\u0627\u0634\u062f. \u0646\u0645\u0648\u062f\u0627\u0631\u0647\u0627 \u0631\u0648\u0634\u06cc \u0639\u0627\u0644\u06cc \u0628\u0631\u0627\u06cc \u0645\u062f\u0644\u200c\u0633\u0627\u0632\u06cc \u0627\u06cc\u0646 \u0645\u0634\u06a9\u0644 \u0647\u0633\u062a\u0646\u062f \u0648 \u062a\u0631\u062a\u06cc\u0628 \u062a\u0648\u067e\u0648\u0644\u0648\u0698\u06cc\u06a9\u06cc \u0627\u06cc\u0646 \u0627\u0633\u062a \u06a9\u0647 \u0686\u06af\u0648\u0646\u0647 \u0627\u0632 \u067e\u0631\u062f\u0627\u0632\u0634 \u0648\u0638\u0627\u06cc\u0641 \u0628\u0647 \u062a\u0631\u062a\u06cc\u0628 \u0635\u062d\u06cc\u062d \u0645\u0637\u0645\u0626\u0646 \u0634\u0648\u06cc\u062f.<\/p>\n

\u06cc\u06a9\u06cc \u0627\u0632 \u0645\u0648\u0627\u0631\u062f\u06cc \u06a9\u0647 \u062f\u0631 \u0627\u0633\u0646\u0627\u062f \u0648\u062c\u0648\u062f \u0646\u062f\u0627\u0631\u062f \u0627\u06cc\u0646 \u0627\u0633\u062a asyncio \u0628\u0647 \u0639\u0646\u0648\u0627\u0646 \u0645\u062b\u0627\u0644\u060c \u0628\u0647 \u0646\u0638\u0631 \u0645\u06cc \u0631\u0633\u062f \u06a9\u0647 \u0646\u0648\u0634\u062a\u0646 \u0622\u0646 \u0628\u0633\u06cc\u0627\u0631 \u0622\u0633\u0627\u0646 \u0627\u0633\u062a. \u0627\u0632 \u0622\u0646\u062c\u0627\u06cc\u06cc \u06a9\u0647 \u0628\u0627 asyncio \u0646\u06cc\u0627\u0632\u06cc \u0646\u06cc\u0633\u062a \u06a9\u0647 \u0628\u0627 thread-safety \u0633\u0631 \u0648 \u06a9\u0627\u0631 \u062f\u0627\u0634\u062a\u0647 \u0628\u0627\u0634\u06cc\u062f\u060c \u0645\u06cc\u200c\u062a\u0648\u0627\u0646\u06cc\u062f \u0628\u062f\u0648\u0646 \u0627\u0633\u062a\u0641\u0627\u062f\u0647 \u0627\u0632 \u0635\u0641 \u0628\u0631\u0627\u06cc \u0647\u0645\u06af\u0627\u0645\u200c\u0633\u0627\u0632\u06cc \u0646\u062e\u200c\u0647\u0627 \u06cc\u0627 \u0647\u0631 \u06af\u0648\u0646\u0647 \u067e\u06cc\u0686\u06cc\u062f\u06af\u06cc \u0627\u0636\u0627\u0641\u06cc \u062f\u06cc\u06af\u0631\u06cc \u0627\u0632 \u0627\u06cc\u0646 \u062f\u0633\u062a \u0628\u06af\u0630\u0631\u06cc\u062f.<\/p>\n

\u0645\u0627 \u06cc\u06a9 \u062a\u0627\u0628\u0639 \u0628\u0627\u0632\u062f\u06cc\u062f\u06a9\u0646\u0646\u062f\u0647 \u06af\u0631\u0647 \u0646\u0627\u0647\u0645\u06af\u0627\u0645 \u0633\u0627\u062f\u0647 \u062a\u0639\u0631\u06cc\u0641 \u0645\u06cc \u06a9\u0646\u06cc\u0645:<\/p>\n

async def visit(node: str, sorter: TopologicalSorter):
\n print(f”processing node {node}”)
\n sorter.done(node)<\/p>\n

\u062f\u0631 \u062f\u0646\u06cc\u0627\u06cc \u0648\u0627\u0642\u0639\u06cc\u060c \u0627\u06cc\u0646 \u0645\u06cc\u200c\u062a\u0648\u0627\u0646\u062f \u062a\u0627 \u0632\u0645\u0627\u0646\u06cc \u06a9\u0647 \u0634\u0645\u0627 \u0645\u06cc\u200c\u062e\u0648\u0627\u0647\u06cc\u062f \u067e\u06cc\u0686\u06cc\u062f\u0647 \u0628\u0627\u0634\u062f\u060c \u062a\u0627 \u0632\u0645\u0627\u0646\u06cc \u06a9\u0647 \u0634\u0645\u0627 \u06a9\u0627\u0631 I\/O \u0631\u0627 \u0627\u0646\u062c\u0627\u0645 \u0645\u06cc\u200c\u062f\u0647\u06cc\u062f\u060c \u0628\u0646\u0627\u0628\u0631\u0627\u06cc\u0646 \u0627\u0632 \u0645\u0632\u0627\u06cc\u0627\u06cc asyncio \u0628\u0647\u0631\u0647 \u0628\u0628\u0631\u06cc\u062f. \u0646\u06a9\u062a\u0647 \u0645\u0647\u0645 \u0627\u06cc\u0646 \u0627\u0633\u062a \u06a9\u0647 \u0628\u0627 \u0622\u0646 \u062a\u0645\u0627\u0633 \u0628\u06af\u06cc\u0631\u06cc\u062f sorter.done(node) \u062f\u0631 \u067e\u0627\u06cc\u0627\u0646 \u062a\u0627\u0628\u0639 \u0627\u062c\u0627\u0632\u0647 \u062f\u0647\u06cc\u062f \u0646\u0645\u0648\u0646\u0647 \u0627\u0632 TopologicalSorter \u0628\u062f\u0627\u0646\u06cc\u062f \u06a9\u0647 \u06a9\u0627\u0631 \u0645\u0627 \u0628\u0627 \u0627\u06cc\u0646 \u06af\u0631\u0647 \u062a\u0645\u0627\u0645 \u0634\u062f\u0647 \u0627\u0633\u062a \u0648 \u0645\u06cc \u062a\u0648\u0627\u0646\u06cc\u0645 \u0628\u0647 \u06af\u0631\u0647 \u0628\u0639\u062f\u06cc \u0628\u0631\u0648\u06cc\u0645.<\/p>\n

\u0633\u067e\u0633 \u0622\u0646 \u0631\u0627 \u0648\u0635\u0644 \u0645\u06cc \u06a9\u0646\u06cc\u0645 visit \u062f\u0631 \u0627\u062c\u0631\u0627\u06cc \u0645\u0631\u062a\u0628 \u0634\u062f\u0647 \u062a\u0648\u067e\u0648\u0644\u0648\u0698\u06cc\u06a9\u06cc \u0645\u0627 \u0639\u0645\u0644 \u06a9\u0646\u06cc\u062f:<\/p>\n

sorter = TopologicalSorter(graph)<\/p>\n

sorter.prepare()<\/p>\n

while sorter.is_active():
\n node_group = sorter.get_ready()<\/p>\n

if not node_group:
\n # no nodes are ready yet, so we sleep for a bit
\n await asyncio.sleep(0.25)
\n else:
\n tasks = set()
\n for node in node_group:
\n task = asyncio.create_task(visit(node, sorter))
\n tasks.add(task)
\n task.add_done_callback(tasks.discard)<\/p>\n

\u06a9\u062f \u0645\u0646\u0628\u0639 \u06a9\u0627\u0645\u0644 \u06cc\u06a9 \u0627\u0633\u06a9\u0631\u06cc\u067e\u062a \u06a9\u0627\u0631 \u0631\u0627 \u0645\u06cc \u062a\u0648\u0627\u0646 \u062f\u0631 \u0627\u06cc\u0646 \u0627\u0635\u0644 \u06cc\u0627\u0641\u062a.<\/p>\n

\u06cc\u06a9 \u062c\u0646\u0628\u0647 \u062e\u0627\u0635 \u0627\u0632 graphlib \u0641\u0631\u0645\u062a \u0646\u0645\u0648\u062f\u0627\u0631 \u0627\u0633\u062a TopologicalSorter \u0628\u0647 \u0639\u0646\u0648\u0627\u0646 \u06cc\u06a9 \u0622\u0631\u06af\u0648\u0645\u0627\u0646 \u0645\u06cc \u067e\u0630\u06cc\u0631\u062f — \u0628\u0647 \u062a\u0631\u062a\u06cc\u0628 \u0645\u0639\u06a9\u0648\u0633 \u0627\u0632 \u0646\u0645\u0627\u06cc\u0634 \u0645\u0639\u0645\u0648\u0644\u06cc \u0634\u0645\u0627 \u0627\u0632 \u06cc\u06a9 \u0646\u0645\u0648\u062f\u0627\u0631 \u0627\u0633\u062a. \u0628\u0647 \u0639\u0646\u0648\u0627\u0646 \u0645\u062b\u0627\u0644 \u0627\u06af\u0631 \u0634\u0645\u0627 \u06cc\u06a9 \u0646\u0645\u0648\u062f\u0627\u0631 \u0645\u0627\u0646\u0646\u062f \u0627\u06cc\u0646 \u062f\u0627\u0631\u06cc\u062f A -> B -> C\u060c \u0645\u0639\u0645\u0648\u0644\u0627\u064b \u0634\u0645\u0627 \u0628\u0627\u06cc\u062f \u0622\u0646 \u0631\u0627 \u0627\u06cc\u0646\u06af\u0648\u0646\u0647 \u0646\u0634\u0627\u0646 \u062f\u0647\u06cc\u062f:<\/p>\n

graph = {
\n “A”: [“B”],
\n “B”: [“C”],
\n “C”: [],
\n}<\/p>\n

\u0627\u0645\u0627 TopologicalSorter \u0645\u06cc \u062e\u0648\u0627\u0647\u062f \u0627\u06cc\u0646 \u0646\u0645\u0648\u062f\u0627\u0631 \u062f\u0631 \u062c\u0647\u062a \u0644\u0628\u0647 \u0645\u0639\u06a9\u0648\u0633 \u0634\u0648\u062f:<\/p>\n

\u0627\u06af\u0631 \u0622\u0631\u06af\u0648\u0645\u0627\u0646 \u06af\u0631\u0627\u0641 \u0627\u062e\u062a\u06cc\u0627\u0631\u06cc \u0627\u0631\u0627\u0626\u0647 \u0634\u0648\u062f\u060c \u0628\u0627\u06cc\u062f \u0641\u0631\u0647\u0646\u06af \u0644\u063a\u062a\u06cc \u0628\u0627\u0634\u062f \u06a9\u0647 \u06cc\u06a9 \u06af\u0631\u0627\u0641 \u063a\u06cc\u0631 \u0686\u0631\u062e\u0647 \u0627\u06cc \u062c\u0647\u062a \u062f\u0627\u0631 \u0631\u0627 \u0646\u0634\u0627\u0646 \u0645\u06cc \u062f\u0647\u062f \u06a9\u0647 \u062f\u0631 \u0622\u0646 \u06a9\u0644\u06cc\u062f\u0647\u0627 \u06af\u0631\u0647 \u0647\u0633\u062a\u0646\u062f \u0648 \u0645\u0642\u0627\u062f\u06cc\u0631 \u062a\u06a9\u0631\u0627\u0631\u067e\u0630\u06cc\u0631 \u0647\u0645\u0647 \u067e\u06cc\u0634\u06cc\u0646\u06cc\u0627\u0646 \u0622\u0646 \u06af\u0631\u0647 \u062f\u0631 \u06af\u0631\u0627\u0641 \u0647\u0633\u062a\u0646\u062f.<\/p>\n

\u067e\u0633 \u0631\u0627\u0647 \u062f\u0631\u0633\u062a \u0646\u0645\u0627\u06cc\u0646\u062f\u06af\u06cc A -> B -> C \u0628\u0631\u0627\u06cc TopologicalSorter \u0627\u06cc\u0646 \u0627\u0633\u062a:<\/p>\n

graph = {
\n “C”: [“B”],
\n “B”: [“A”],
\n “A”: [],
\n}<\/p>\n

\u0627\u0637\u0644\u0627\u0639\u0627\u062a \u0628\u06cc\u0634\u062a\u0631 \u0648 \u06cc\u06a9 \u0628\u062d\u062b \u0646\u0633\u0628\u062a\u0627\u064b \u062f\u0627\u063a \u062f\u0631 \u0627\u06cc\u0646 \u0645\u0648\u0631\u062f \u0631\u0627 \u0645\u06cc\u200c\u062a\u0648\u0627\u0646\u06cc\u062f \u062f\u0631 \u0627\u06cc\u0646\u062c\u0627 \u067e\u06cc\u062f\u0627 \u06a9\u0646\u06cc\u062f: https:\/\/bugs.python.org\/issue46071.<\/p>\n

\u06a9\u062f \u0646\u0648\u06cc\u0633\u06cc \u0645\u0628\u0627\u0631\u06a9!<\/p>\n

\u0627\u062e\u06cc\u0631\u0627\u064b \u0628\u0627 \u06cc\u06a9 \u0645\u0627\u0698\u0648\u0644 \u062c\u0627\u0644\u0628 \u062f\u0631 \u06a9\u062a\u0627\u0628\u062e\u0627\u0646\u0647 \u0627\u0633\u062a\u0627\u0646\u062f\u0627\u0631\u062f \u0628\u06cc \u0627\u0646\u062a\u0647\u0627 \u067e\u0627\u06cc\u062a\u0648\u0646 \u0645\u0648\u0627\u062c\u0647 \u0634\u062f\u0645: graphlib. \u0627\u06af\u0631 \u0642\u0628\u0644\u0627\u064b \u0628\u0627 \u0622\u0646 \u06a9\u0627\u0631 \u0646\u06a9\u0631\u062f\u0647 \u0627\u06cc\u062f\u060c \u0627\u06cc\u0646 \u06cc\u06a9 \u0627\u0628\u0632\u0627\u0631 \u06a9\u0648\u0686\u06a9 \u0627\u0633\u062a \u06a9\u0647 \u062f\u0631 Python 3.9 \u0627\u0636\u0627\u0641\u0647 \u0634\u062f\u0647 \u0627\u0633\u062a \u0648 \u0641\u0642\u0637 \u06cc\u06a9 \u06a9\u0644\u0627\u0633 \u0631\u0627 \u067e\u06cc\u0627\u062f\u0647 \u0633\u0627\u0632\u06cc \u0645\u06cc \u06a9\u0646\u062f: TopologicalSorter.<\/p>\n

\u0646\u0627\u0645 \u062e\u0648\u062f \u062a\u0648\u0636\u06cc\u062d\u06cc \u0627\u0633\u062a — \u0627\u06cc\u0646 \u06cc\u06a9 \u06a9\u0644\u0627\u0633 \u0628\u0631\u0627\u06cc \u0645\u0631\u062a\u0628 \u0633\u0627\u0632\u06cc \u062a\u0648\u067e\u0648\u0644\u0648\u0698\u06cc\u06a9\u06cc \u06cc\u06a9 \u0646\u0645\u0648\u062f\u0627\u0631 \u0627\u0633\u062a. \u0627\u0645\u0627 \u0645\u0646 \u0641\u06a9\u0631 \u0646\u0645\u06cc\u200c\u06a9\u0646\u0645 \u06a9\u0647 \u062f\u0631 \u0627\u0628\u062a\u062f\u0627 \u0641\u0642\u0637 \u0628\u0627 \u0645\u0631\u062a\u0628\u200c\u0633\u0627\u0632\u06cc \u0646\u0648\u0634\u062a\u0647 \u0634\u062f\u0647 \u0628\u0627\u0634\u062f\u060c \u0632\u06cc\u0631\u0627 API \u0646\u0633\u0628\u062a\u0627\u064b \u0645\u0631\u0645\u0648\u0632\u060c \u0627\u0645\u0627 \u0641\u0648\u0642\u200c\u0627\u0644\u0639\u0627\u062f\u0647 \u0645\u0641\u06cc\u062f\u06cc \u062f\u0627\u0631\u062f\u060c \u0645\u0627\u0646\u0646\u062f prepare()<\/code> \u0631\u0648\u0634 \u06cc\u0627 is_active()<\/code>. \u0627\u06cc\u0646 \u0645\u062b\u0627\u0644 \u062f\u0631 \u0645\u0633\u062a\u0646\u062f\u0627\u062a \u0628\u0647 \u0627\u0646\u06af\u06cc\u0632\u0647 \u067e\u0634\u062a \u0622\u0646 \u0627\u0634\u0627\u0631\u0647 \u0645\u06cc \u06a9\u0646\u062f:\n<\/p>\n

\n
topological_sorter<\/span> =<\/span> TopologicalSorter<\/span>()<\/span>\n\n# Add nodes to 'topological_sorter'...\n<\/span>\ntopological_sorter<\/span>.<\/span>prepare<\/span>()<\/span>\nwhile<\/span> topological_sorter<\/span>.<\/span>is_active<\/span>():<\/span>\n    for<\/span> node<\/span> in<\/span> topological_sorter<\/span>.<\/span>get_ready<\/span>():<\/span>\n        # Worker threads or processes take nodes to work on off the\n<\/span>        # 'task_queue' queue.\n<\/span>        task_queue<\/span>.<\/span>put<\/span>(<\/span>node<\/span>)<\/span>\n\n    # When the work for a node is done, workers put the node in\n<\/span>    # 'finalized_tasks_queue' so we can get more nodes to work on.\n<\/span>    # The definition of 'is_active()' guarantees that, at this point, at\n<\/span>    # least one node has been placed on 'task_queue' that hasn't yet\n<\/span>    # been passed to 'done()', so this blocking 'get()' must (eventually)\n<\/span>    # succeed.  After calling 'done()', we loop back to call 'get_ready()'\n<\/span>    # again, so put newly freed nodes on 'task_queue' as soon as\n<\/span>    # logically possible.\n<\/span>    node<\/span> =<\/span> finalized_tasks_queue<\/span>.<\/span>get<\/span>()<\/span>\n    topological_sorter<\/span>.<\/span>done<\/span>(<\/span>node<\/span>)<\/span>\n<\/code><\/pre>\n<\/div>\n
\u0628\u0646\u0627\u0628\u0631\u0627\u06cc\u0646 graphlib<\/code> \u06cc\u06a9 \u0645\u0627\u0698\u0648\u0644 \u0641\u0642\u0637 \u0628\u0631\u0627\u06cc \u0645\u0631\u062a\u0628\u200c\u0633\u0627\u0632\u06cc \u0646\u0645\u0648\u062f\u0627\u0631\u0647\u0627 \u0646\u06cc\u0633\u062a\u060c \u0628\u0644\u06a9\u0647 \u0627\u0628\u0632\u0627\u0631\u06cc \u0628\u0631\u0627\u06cc \u0627\u062c\u0631\u0627\u06cc \u0646\u0645\u0648\u062f\u0627\u0631\u0647\u0627\u06cc \u0648\u0638\u0627\u06cc\u0641 \u0628\u0647 \u062a\u0631\u062a\u06cc\u0628 \u062a\u0648\u067e\u0648\u0644\u0648\u0698\u06cc\u06a9\u06cc \u0627\u0633\u062a\u060c \u06a9\u0647 \u062f\u0631 \u0635\u0648\u0631\u062a\u06cc \u0645\u0641\u06cc\u062f \u0627\u0633\u062a \u06a9\u0647 \u062d\u062c\u0645 \u06a9\u0627\u0631\u06cc \u0634\u0645\u0627 \u0628\u0633\u062a\u0647 \u0628\u0647 \u0646\u062a\u0627\u06cc\u062c \u06a9\u0627\u0631\u0647\u0627\u06cc \u062f\u06cc\u06af\u0631 \u0648\u0638\u0627\u06cc\u0641\u06cc \u062f\u0627\u0634\u062a\u0647 \u0628\u0627\u0634\u062f. \u0646\u0645\u0648\u062f\u0627\u0631\u0647\u0627 \u0631\u0648\u0634\u06cc \u0639\u0627\u0644\u06cc \u0628\u0631\u0627\u06cc \u0645\u062f\u0644\u200c\u0633\u0627\u0632\u06cc \u0627\u06cc\u0646 \u0645\u0634\u06a9\u0644 \u0647\u0633\u062a\u0646\u062f \u0648 \u062a\u0631\u062a\u06cc\u0628 \u062a\u0648\u067e\u0648\u0644\u0648\u0698\u06cc\u06a9\u06cc \u0627\u06cc\u0646 \u0627\u0633\u062a \u06a9\u0647 \u0686\u06af\u0648\u0646\u0647 \u0627\u0632 \u067e\u0631\u062f\u0627\u0632\u0634 \u0648\u0638\u0627\u06cc\u0641 \u0628\u0647 \u062a\u0631\u062a\u06cc\u0628 \u0635\u062d\u06cc\u062d \u0645\u0637\u0645\u0626\u0646 \u0634\u0648\u06cc\u062f.<\/p>\n
\u06cc\u06a9\u06cc \u0627\u0632 \u0645\u0648\u0627\u0631\u062f\u06cc \u06a9\u0647 \u062f\u0631 \u0627\u0633\u0646\u0627\u062f \u0648\u062c\u0648\u062f \u0646\u062f\u0627\u0631\u062f \u0627\u06cc\u0646 \u0627\u0633\u062a asyncio<\/code> \u0628\u0647 \u0639\u0646\u0648\u0627\u0646 \u0645\u062b\u0627\u0644\u060c \u0628\u0647 \u0646\u0638\u0631 \u0645\u06cc \u0631\u0633\u062f \u06a9\u0647 \u0646\u0648\u0634\u062a\u0646 \u0622\u0646 \u0628\u0633\u06cc\u0627\u0631 \u0622\u0633\u0627\u0646 \u0627\u0633\u062a. \u0627\u0632 \u0622\u0646\u062c\u0627\u06cc\u06cc \u06a9\u0647 \u0628\u0627 asyncio<\/code> \u0646\u06cc\u0627\u0632\u06cc \u0646\u06cc\u0633\u062a \u06a9\u0647 \u0628\u0627 thread-safety \u0633\u0631 \u0648 \u06a9\u0627\u0631 \u062f\u0627\u0634\u062a\u0647 \u0628\u0627\u0634\u06cc\u062f\u060c \u0645\u06cc\u200c\u062a\u0648\u0627\u0646\u06cc\u062f \u0628\u062f\u0648\u0646 \u0627\u0633\u062a\u0641\u0627\u062f\u0647 \u0627\u0632 \u0635\u0641 \u0628\u0631\u0627\u06cc \u0647\u0645\u06af\u0627\u0645\u200c\u0633\u0627\u0632\u06cc \u0646\u062e\u200c\u0647\u0627 \u06cc\u0627 \u0647\u0631 \u06af\u0648\u0646\u0647 \u067e\u06cc\u0686\u06cc\u062f\u06af\u06cc \u0627\u0636\u0627\u0641\u06cc \u062f\u06cc\u06af\u0631\u06cc \u0627\u0632 \u0627\u06cc\u0646 \u062f\u0633\u062a \u0628\u06af\u0630\u0631\u06cc\u062f.<\/p>\n
\u0645\u0627 \u06cc\u06a9 \u062a\u0627\u0628\u0639 \u0628\u0627\u0632\u062f\u06cc\u062f\u06a9\u0646\u0646\u062f\u0647 \u06af\u0631\u0647 \u0646\u0627\u0647\u0645\u06af\u0627\u0645 \u0633\u0627\u062f\u0647 \u062a\u0639\u0631\u06cc\u0641 \u0645\u06cc \u06a9\u0646\u06cc\u0645:\n<\/p>\n
\n
async<\/span> def<\/span> visit<\/span>(<\/span>node<\/span>:<\/span> str<\/span>,<\/span> sorter<\/span>:<\/span> TopologicalSorter<\/span>):<\/span>\n    print<\/span>(<\/span>f<\/span>\"<\/span>processing node <\/span>{<\/span>node<\/span>}<\/span>\"<\/span>)<\/span>\n    sorter<\/span>.<\/span>done<\/span>(<\/span>node<\/span>)<\/span>\n<\/code><\/pre>\n<\/div>\n
\u062f\u0631 \u062f\u0646\u06cc\u0627\u06cc \u0648\u0627\u0642\u0639\u06cc\u060c \u0627\u06cc\u0646 \u0645\u06cc\u200c\u062a\u0648\u0627\u0646\u062f \u062a\u0627 \u0632\u0645\u0627\u0646\u06cc \u06a9\u0647 \u0634\u0645\u0627 \u0645\u06cc\u200c\u062e\u0648\u0627\u0647\u06cc\u062f \u067e\u06cc\u0686\u06cc\u062f\u0647 \u0628\u0627\u0634\u062f\u060c \u062a\u0627 \u0632\u0645\u0627\u0646\u06cc \u06a9\u0647 \u0634\u0645\u0627 \u06a9\u0627\u0631 I\/O \u0631\u0627 \u0627\u0646\u062c\u0627\u0645 \u0645\u06cc\u200c\u062f\u0647\u06cc\u062f\u060c \u0628\u0646\u0627\u0628\u0631\u0627\u06cc\u0646 \u0627\u0632 \u0645\u0632\u0627\u06cc\u0627\u06cc asyncio \u0628\u0647\u0631\u0647 \u0628\u0628\u0631\u06cc\u062f. \u0646\u06a9\u062a\u0647 \u0645\u0647\u0645 \u0627\u06cc\u0646 \u0627\u0633\u062a \u06a9\u0647 \u0628\u0627 \u0622\u0646 \u062a\u0645\u0627\u0633 \u0628\u06af\u06cc\u0631\u06cc\u062f sorter.done(node)<\/code> \u062f\u0631 \u067e\u0627\u06cc\u0627\u0646 \u062a\u0627\u0628\u0639 \u0627\u062c\u0627\u0632\u0647 \u062f\u0647\u06cc\u062f \u0646\u0645\u0648\u0646\u0647 \u0627\u0632 TopologicalSorter<\/code> \u0628\u062f\u0627\u0646\u06cc\u062f \u06a9\u0647 \u06a9\u0627\u0631 \u0645\u0627 \u0628\u0627 \u0627\u06cc\u0646 \u06af\u0631\u0647 \u062a\u0645\u0627\u0645 \u0634\u062f\u0647 \u0627\u0633\u062a \u0648 \u0645\u06cc \u062a\u0648\u0627\u0646\u06cc\u0645 \u0628\u0647 \u06af\u0631\u0647 \u0628\u0639\u062f\u06cc \u0628\u0631\u0648\u06cc\u0645.<\/p>\n
\u0633\u067e\u0633 \u0622\u0646 \u0631\u0627 \u0648\u0635\u0644 \u0645\u06cc \u06a9\u0646\u06cc\u0645 visit<\/code> \u062f\u0631 \u0627\u062c\u0631\u0627\u06cc \u0645\u0631\u062a\u0628 \u0634\u062f\u0647 \u062a\u0648\u067e\u0648\u0644\u0648\u0698\u06cc\u06a9\u06cc \u0645\u0627 \u0639\u0645\u0644 \u06a9\u0646\u06cc\u062f:\n<\/p>\n
\n
sorter<\/span> =<\/span> TopologicalSorter<\/span>(<\/span>graph<\/span>)<\/span>\n\nsorter<\/span>.<\/span>prepare<\/span>()<\/span>\n\nwhile<\/span> sorter<\/span>.<\/span>is_active<\/span>():<\/span>\n    node_group<\/span> =<\/span> sorter<\/span>.<\/span>get_ready<\/span>()<\/span>\n\n    if<\/span> not<\/span> node_group<\/span>:<\/span>\n        # no nodes are ready yet, so we sleep for a bit\n<\/span>        await<\/span> asyncio<\/span>.<\/span>sleep<\/span>(<\/span>0.25<\/span>)<\/span>\n    else<\/span>:<\/span>\n        tasks<\/span> =<\/span> set<\/span>()<\/span>\n        for<\/span> node<\/span> in<\/span> node_group<\/span>:<\/span>\n            task<\/span> =<\/span> asyncio<\/span>.<\/span>create_task<\/span>(<\/span>visit<\/span>(<\/span>node<\/span>,<\/span> sorter<\/span>))<\/span>\n            tasks<\/span>.<\/span>add<\/span>(<\/span>task<\/span>)<\/span>\n            task<\/span>.<\/span>add_done_callback<\/span>(<\/span>tasks<\/span>.<\/span>discard<\/span>)<\/span>\n<\/code><\/pre>\n<\/div>\n
\u06a9\u062f \u0645\u0646\u0628\u0639 \u06a9\u0627\u0645\u0644 \u06cc\u06a9 \u0627\u0633\u06a9\u0631\u06cc\u067e\u062a \u06a9\u0627\u0631 \u0631\u0627 \u0645\u06cc \u062a\u0648\u0627\u0646 \u062f\u0631 \u0627\u06cc\u0646 \u0627\u0635\u0644 \u06cc\u0627\u0641\u062a.<\/p>\n
\u06cc\u06a9 \u062c\u0646\u0628\u0647 \u062e\u0627\u0635 \u0627\u0632 graphlib<\/code> \u0641\u0631\u0645\u062a \u0646\u0645\u0648\u062f\u0627\u0631 \u0627\u0633\u062a TopologicalSorter<\/code> \u0628\u0647 \u0639\u0646\u0648\u0627\u0646 \u06cc\u06a9 \u0622\u0631\u06af\u0648\u0645\u0627\u0646 \u0645\u06cc \u067e\u0630\u06cc\u0631\u062f — \u0628\u0647 \u062a\u0631\u062a\u06cc\u0628 \u0645\u0639\u06a9\u0648\u0633 \u0627\u0632 \u0646\u0645\u0627\u06cc\u0634 \u0645\u0639\u0645\u0648\u0644\u06cc \u0634\u0645\u0627 \u0627\u0632 \u06cc\u06a9 \u0646\u0645\u0648\u062f\u0627\u0631 \u0627\u0633\u062a. \u0628\u0647 \u0639\u0646\u0648\u0627\u0646 \u0645\u062b\u0627\u0644 \u0627\u06af\u0631 \u0634\u0645\u0627 \u06cc\u06a9 \u0646\u0645\u0648\u062f\u0627\u0631 \u0645\u0627\u0646\u0646\u062f \u0627\u06cc\u0646 \u062f\u0627\u0631\u06cc\u062f A -> B -> C<\/code>\u060c \u0645\u0639\u0645\u0648\u0644\u0627\u064b \u0634\u0645\u0627 \u0628\u0627\u06cc\u062f \u0622\u0646 \u0631\u0627 \u0627\u06cc\u0646\u06af\u0648\u0646\u0647 \u0646\u0634\u0627\u0646 \u062f\u0647\u06cc\u062f:\n<\/p>\n
\n
graph<\/span> =<\/span> {<\/span>\n  \"<\/span>A<\/span>\"<\/span>:<\/span> [<\/span>\"<\/span>B<\/span>\"<\/span>],<\/span>\n  \"<\/span>B<\/span>\"<\/span>:<\/span> [<\/span>\"<\/span>C<\/span>\"<\/span>],<\/span>\n  \"<\/span>C<\/span>\"<\/span>:<\/span> [],<\/span>\n}<\/span>\n<\/code><\/pre>\n<\/div>\n
\u0627\u0645\u0627 TopologicalSorter<\/code> \u0645\u06cc \u062e\u0648\u0627\u0647\u062f \u0627\u06cc\u0646 \u0646\u0645\u0648\u062f\u0627\u0631 \u062f\u0631 \u062c\u0647\u062a \u0644\u0628\u0647 \u0645\u0639\u06a9\u0648\u0633 \u0634\u0648\u062f:<\/p>\n
\n
\u0627\u06af\u0631 \u0622\u0631\u06af\u0648\u0645\u0627\u0646 \u06af\u0631\u0627\u0641 \u0627\u062e\u062a\u06cc\u0627\u0631\u06cc \u0627\u0631\u0627\u0626\u0647 \u0634\u0648\u062f\u060c \u0628\u0627\u06cc\u062f \u0641\u0631\u0647\u0646\u06af \u0644\u063a\u062a\u06cc \u0628\u0627\u0634\u062f \u06a9\u0647 \u06cc\u06a9 \u06af\u0631\u0627\u0641 \u063a\u06cc\u0631 \u0686\u0631\u062e\u0647 \u0627\u06cc \u062c\u0647\u062a \u062f\u0627\u0631 \u0631\u0627 \u0646\u0634\u0627\u0646 \u0645\u06cc \u062f\u0647\u062f \u06a9\u0647 \u062f\u0631 \u0622\u0646 \u06a9\u0644\u06cc\u062f\u0647\u0627 \u06af\u0631\u0647 \u0647\u0633\u062a\u0646\u062f \u0648 \u0645\u0642\u0627\u062f\u06cc\u0631 \u062a\u06a9\u0631\u0627\u0631\u067e\u0630\u06cc\u0631 \u0647\u0645\u0647 \u067e\u06cc\u0634\u06cc\u0646\u06cc\u0627\u0646 \u0622\u0646 \u06af\u0631\u0647 \u062f\u0631 \u06af\u0631\u0627\u0641 \u0647\u0633\u062a\u0646\u062f.<\/p>\n<\/blockquote>\n
\u067e\u0633 \u0631\u0627\u0647 \u062f\u0631\u0633\u062a \u0646\u0645\u0627\u06cc\u0646\u062f\u06af\u06cc A -> B -> C<\/code> \u0628\u0631\u0627\u06cc TopologicalSorter<\/code> \u0627\u06cc\u0646 \u0627\u0633\u062a:\n<\/p>\n
\n
graph<\/span> =<\/span> {<\/span>\n  \"<\/span>C<\/span>\"<\/span>:<\/span> [<\/span>\"<\/span>B<\/span>\"<\/span>],<\/span>\n  \"<\/span>B<\/span>\"<\/span>:<\/span> [<\/span>\"<\/span>A<\/span>\"<\/span>],<\/span>\n  \"<\/span>A<\/span>\"<\/span>:<\/span> [],<\/span>\n}<\/span>\n<\/code><\/pre>\n<\/div>\n
\u0627\u0637\u0644\u0627\u0639\u0627\u062a \u0628\u06cc\u0634\u062a\u0631 \u0648 \u06cc\u06a9 \u0628\u062d\u062b \u0646\u0633\u0628\u062a\u0627\u064b \u062f\u0627\u063a \u062f\u0631 \u0627\u06cc\u0646 \u0645\u0648\u0631\u062f \u0631\u0627 \u0645\u06cc\u200c\u062a\u0648\u0627\u0646\u06cc\u062f \u062f\u0631 \u0627\u06cc\u0646\u062c\u0627 \u067e\u06cc\u062f\u0627 \u06a9\u0646\u06cc\u062f: https:\/\/bugs.python.org\/issue46071.<\/p>\n
\u06a9\u062f \u0646\u0648\u06cc\u0633\u06cc \u0645\u0628\u0627\u0631\u06a9!<\/p>\n","protected":false},"excerpt":{"rendered":"
Summarize this content to 400 words in Persian Lang \u0627\u062e\u06cc\u0631\u0627\u064b \u0628\u0627 \u06cc\u06a9 \u0645\u0627\u0698\u0648\u0644 \u062c\u0627\u0644\u0628 \u062f\u0631 \u06a9\u062a\u0627\u0628\u062e\u0627\u0646\u0647 \u0627\u0633\u062a\u0627\u0646\u062f\u0627\u0631\u062f \u0628\u06cc \u0627\u0646\u062a\u0647\u0627 \u067e\u0627\u06cc\u062a\u0648\u0646 \u0645\u0648\u0627\u062c\u0647 \u0634\u062f\u0645: graphlib. \u0627\u06af\u0631 \u0642\u0628\u0644\u0627\u064b \u0628\u0627 \u0622\u0646 \u06a9\u0627\u0631 \u0646\u06a9\u0631\u062f\u0647 \u0627\u06cc\u062f\u060c \u0627\u06cc\u0646 \u06cc\u06a9 \u0627\u0628\u0632\u0627\u0631 \u06a9\u0648\u0686\u06a9 \u0627\u0633\u062a \u06a9\u0647 \u062f\u0631 Python 3.9 \u0627\u0636\u0627\u0641\u0647 \u0634\u062f\u0647 \u0627\u0633\u062a \u0648 \u0641\u0642\u0637 \u06cc\u06a9 \u06a9\u0644\u0627\u0633 \u0631\u0627 \u067e\u06cc\u0627\u062f\u0647 \u0633\u0627\u0632\u06cc \u0645\u06cc \u06a9\u0646\u062f: TopologicalSorter. \u0646\u0627\u0645 \u062e\u0648\u062f \u062a\u0648\u0636\u06cc\u062d\u06cc …<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"fifu_image_url":"","fifu_image_alt":"","footnotes":""},"categories":[339],"tags":[],"class_list":["post-74840","post","type-post","status-publish","format-standard","hentry","category-dev"],"_links":{"self":[{"href":"https:\/\/nabfollower.com\/blog\/wp-json\/wp\/v2\/posts\/74840","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/nabfollower.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/nabfollower.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/nabfollower.com\/blog\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/nabfollower.com\/blog\/wp-json\/wp\/v2\/comments?post=74840"}],"version-history":[{"count":0,"href":"https:\/\/nabfollower.com\/blog\/wp-json\/wp\/v2\/posts\/74840\/revisions"}],"wp:attachment":[{"href":"https:\/\/nabfollower.com\/blog\/wp-json\/wp\/v2\/media?parent=74840"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/nabfollower.com\/blog\/wp-json\/wp\/v2\/categories?post=74840"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/nabfollower.com\/blog\/wp-json\/wp\/v2\/tags?post=74840"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}