Struct LocalGraph 

pub struct LocalGraph { /* private fields */ }

Local view of the swarm: known nodes, edges, and a dedup cache for incoming pingwaves. Holds the proximity-routing state — see BehaviorContext::propagate for the consumer side and mesh.rs pingwave dispatch for the producer side.

Implementations

impl LocalGraph

pub fn new(my_id: u64, radius: u8) -> Self

Create a new local graph

pub fn with_node_timeout(self, timeout: Duration) -> Self

Set node timeout

pub fn my_id(&self) -> u64

Get local node ID

pub fn radius(&self) -> u8

Get radius

pub fn create_pingwave(&self) -> Pingwave

Create a new pingwave to broadcast

pub fn on_pingwave(&self, pw: Pingwave, from: SocketAddr) -> Option<Pingwave>

Process an incoming pingwave.

Returns Some(pingwave) if it should be forwarded, None otherwise.

seen_pingwaves and nodes are soft-capped via MAX_SEEN_PINGWAVES / MAX_GRAPH_NODES: existing entries continue to update, but novel keys are dropped once the cap is reached. The next periodic evict_stale_* sweep reclaims slots for legitimate nodes/pingwaves so admission resumes once memory pressure eases. Without the caps, a peer flooding pingwaves with random (origin_id, seq) could grow both maps at line-rate between the periodic eviction sweeps.

pub fn on_capability(&self, ad: CapabilityAd, from: SocketAddr)

Process a capability advertisement

pub fn add_edge(&self, from: u64, to: u64, latency_us: u32)

Add or update an edge

pub fn get_node(&self, node_id: u64) -> Option<NodeInfo>

Get node info

pub fn all_nodes(&self) -> Vec<NodeInfo>

Get all known nodes

pub fn nodes_within_hops(&self, max_hops: u8) -> Vec<NodeInfo>

Get nodes within a specific hop distance

pub fn find_by_tool(&self, tool: &str) -> Vec<NodeInfo>

Find nodes with a specific capability (tool)

pub fn find_by_tag(&self, tag: &str) -> Vec<NodeInfo>

Find nodes with a specific tag

pub fn find_with_gpu(&self) -> Vec<NodeInfo>

Find nodes with GPU

pub fn path_to(&self, dest: u64) -> Option<Vec<u64>>

Get shortest path to a node (BFS).

Reconstructs the path from a parent map at the end rather than cloning the full path per neighbor — avoids quadratic behavior on long paths or wide frontiers.

pub fn cleanup(&self) -> (usize, usize)

Clean up stale nodes and old pingwave cache entries

pub fn stats(&self) -> GraphStats

Get graph statistics

pub fn node_count(&self) -> usize

Get node count

pub fn edge_count(&self) -> usize

Get edge count

Trait Implementations

impl Debug for LocalGraph

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.