flow op• Data kinds: image2d → table
• Call: 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) (implementation को सीधे call करना हो तो 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), registry से लेना हो तो opsgraph.get("physarum_route"))
slime mould की tube dynamics से मिला cost image के आर-पार minimum-cost route।
> नीचे का विस्तृत विवरण मूल text में है — सारांश और headings का अनुवाद हो चुका है।
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.
• Sample data catalog (DL URL / license) — 2-D के लिए skimage.data (BSD/public) + synthetic, 3-D के लिए real data sources (Stanford/PDS आदि) के DL URL।
• Operators का स्रोत और संदर्भ — इस op family के मूल research/methods के स्रोत।
• Algorithm का मानक स्रोत (लेखक, वर्ष) और उपयोग ऊपर की family usage guide में दिए गए हैं।
• poc_physarum_maze — py -3.11 examples/poc_physarum_maze.py
table को input के रूप में लेते हैं)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 operator registry. यह per-op note tools/opdocs.py md से अपने-आप generate होता है (हाथ से edit न करें)।*
© 2026 Kazufumi Furuse — Fullseye operator documentation. Licensed under Apache-2.0.