Struct NetworkTopologyMapper 

pub struct NetworkTopologyMapper {
    pub local_id: String,
    pub nodes: HashMap<String, TopoNode>,
    pub edges: Vec<TopoEdge>,
    pub adjacency: HashMap<String, Vec<String>>,
}

Discovers and maps the P2P network topology.

Example

use ipfrs_network::topology_mapper::{NetworkTopologyMapper, TopoNode, TopoEdge};

let mut mapper = NetworkTopologyMapper::new("local".to_string());
mapper.add_node(TopoNode {
    node_id: "peer-1".to_string(),
    address: "/ip4/127.0.0.1/tcp/4001".to_string(),
    discovered_at: 0,
    hop_distance: 1,
});
mapper.add_edge(TopoEdge {
    from: "local".to_string(),
    to: "peer-1".to_string(),
    latency_ms: 5.0,
    bandwidth_bps: 10_000_000,
    discovered_at: 0,
});
let path = mapper.shortest_path("local", "peer-1");
assert!(path.is_some());

Fields

local_id: String

Identifier of the local node (the observer).

nodes: HashMap<String, TopoNode>

All known nodes keyed by node_id.

edges: Vec<TopoEdge>

All directed edges (flat list; may contain duplicate from→to pairs if the caller adds them; the last-added is preferred for path finding).

adjacency: HashMap<String, Vec<String>>

Adjacency list: node_id → [neighbour_ids] (outgoing only).

Implementations

impl NetworkTopologyMapper

pub fn new(local_id: String) -> Self

Create a new mapper with the given local node ID.

pub fn add_node(&mut self, node: TopoNode)

Insert or update a node. When a node is updated its hop_distance and address are refreshed; discovered_at is kept if the new value is 0.

pub fn remove_node(&mut self, node_id: &str) -> bool

Remove a node and all edges that reference it (as source or destination).

Returns true if the node existed, false otherwise.

pub fn add_edge(&mut self, edge: TopoEdge)

Add a directed edge and update the adjacency list for from.

Duplicate from→to edges are allowed; path queries always use the edge with the lowest latency between a pair.

pub fn remove_edge(&mut self, from: &str, to: &str) -> bool

Remove all edges from from to to.

Returns true if at least one edge was removed.

pub fn shortest_path(&self, from: &str, to: &str) -> Option<PathResult>

Dijkstra shortest path weighted by latency_ms.

Returns None if either node is unknown or no path exists.

pub fn hop_shortest_path(&self, from: &str, to: &str) -> Option<PathResult>

BFS shortest path (unweighted; minimises hop count).

Returns None if either node is unknown or no path exists.

pub fn neighbors(&self, node_id: &str) -> Vec<&str>

Return the outgoing neighbour IDs for node_id.

pub fn in_degree(&self, node_id: &str) -> usize

Number of edges pointing into node_id.

pub fn out_degree(&self, node_id: &str) -> usize

Number of outgoing edges from node_id.

pub fn is_reachable(&self, from: &str, to: &str) -> bool

BFS reachability check.

pub fn connected_components(&self) -> Vec<Vec<String>>

Compute weakly connected components (treat directed edges as undirected).

Each component is a sorted list of node IDs. The returned list of components is sorted by the first element of each component.

pub fn diameter(&self) -> Option<f64>

Graph diameter: the maximum shortest-path latency over all reachable pairs.

Returns None when there are fewer than two nodes. This is O(V × Dijkstra) and is expensive for large graphs.

pub fn average_clustering_coefficient(&self) -> f64

Mean clustering coefficient (undirected interpretation).

For each node whose combined (in+out) neighbour set has size ≥ 2, the local clustering coefficient is:

C(v) = (actual triangles through v) / (k * (k-1) / 2)

where k is the size of the undirected neighbourhood, and a “triangle” exists when two neighbours are themselves connected (in either direction).

Returns 0.0 if no node has k ≥ 2.

pub fn snapshot(&self) -> TopologySnapshot

Take a snapshot of the current topology.

pub fn node_count(&self) -> usize

Total number of known nodes.

pub fn edge_count(&self) -> usize

Total number of edges (including duplicates for the same pair).

pub fn evict_stale(&mut self, max_age_ms: u64, now: u64) -> usize

Remove nodes whose discovered_at is older than max_age_ms relative to now. All edges referencing removed nodes are also cleaned up.

Returns the number of nodes removed.

pub fn stats(&self) -> TopologyStats

Compute aggregate statistics for the current topology.

Trait Implementations

impl Clone for NetworkTopologyMapper

fn clone(&self) -> NetworkTopologyMapper

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for NetworkTopologyMapper

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

Formats the value using the given formatter.