flow op• 資料種類:image2d → table
• 呼叫: import fullseye as fs; fs.ledger.physarum_route(cost, start=None, end=None, connectivity=4, dt=0.1, max_iters=5000, tol=1e-06, frac=0.5, snapshots=0)(要直接呼叫實作,import physarum_search; physarum_search.physarum_route(cost, start=None, end=None, connectivity=4, dt=0.1, max_iters=5000, tol=1e-06, frac=0.5, snapshots=0);從台帳取用則 opsgraph.get("physarum_route"))
> 該運算子的說明尚無譯文,以下照原文給出。
Minimum-cost route through a cost image found by the slime mould's tube dynamics.
Every pixel is a node; neighbouring pixels (connectivity 4 or 8) are joined by a tube of length (c_u + c_v) / 2 (times sqrt(2) on diagonals), so the length of a route equals the sum of the pixel costs it visits minus half the cost of its two ends — the same quantity skimage.graph.route_through_array(..., geometric=False) minimises (it counts both ends fully). start / end are (row, col); defaults are the top-left and bottom-right corners. Dynamics and convergence as in graph_physarum_path.
Returns conductance (an image: each pixel's thickest incident tube, 1 on the route when converged), path ((k, 2) pixel coordinates start → end), path_cost (sum of the pixel costs along it, comparable to route_through_array), route_length (sum of the tube lengths), flow_length, iters, converged, history, and, with snapshots = m > 0, snapshots (m conductance images at evenly spaced iterations, the last one final) for watching the tubes thicken, snapshot_iters and snapshot_cost = sum L_e D_e at those iterations (Bonifaci's Lyapunov function, which never increases in continuous time).
Raises ValueError: cost not a 2-D finite image of positive values; start / end outside the image or equal; connectivity not 4 or 8; and as graph_physarum_path.
• 範例資料目錄(下載 URL / 授權) —— 2-D 用 skimage.data(BSD/公有領域)加合成圖,3-D 給出真實資料源(Stanford/PDS 等)的下載 URL。
• 運算子來歷與參考文獻 —— 該運算子族所依據的研究/方法出處。
• 演算法的正典(作者、年份)與用途見上面的族使用指南。
• poc_physarum_maze — py -3.11 examples/poc_physarum_maze.py
table 作為輸入)graph_edge_consensus · graph_core_persistence · tree_morphometry · tree_sholl · tree_run_length
flow)graph_physarum_path · graph_physarum_transport · physarum_transport_image
*Provenance: physarum_search.py — GRAPH 運算子登記表。本條目由 tools/opdocs.py md 自動產生(請勿手動編輯)。*
© 2026 Kazufumi Furuse — Fullseye operator documentation. Licensed under Apache-2.0.