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.
• 샘플 데이터 카탈로그(DL URL / 라이선스) —— 2-D 는 skimage.data(BSD/public)+ 합성, 3-D 는 실데이터 소스(Stanford/PDS 등)의 DL 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 연산자 레지스트리. 이 op 노트는 tools/opdocs.py md 가 자동 생성합니다(직접 편집하지 마세요).*
© 2026 Kazufumi Furuse — Fullseye operator documentation. Licensed under Apache-2.0.