Struct FleetGraph 

pub struct FleetGraph {
    pub agents: Vec<AgentNode>,
    pub edges: Vec<CommEdge>,
}

The fleet graph: a directed weighted graph of agents and communication channels.

Fields

agents: Vec<AgentNode>

edges: Vec<CommEdge>

Implementations

impl FleetGraph

pub fn new() -> Self

Create an empty fleet graph.

pub fn add_agent(&mut self, agent: AgentNode) -> usize

Add an agent and return its index.

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

Add a directed communication edge.

pub fn node_count(&self) -> usize

Number of agents (nodes).

pub fn edge_count(&self) -> usize

Number of edges.

pub fn len(&self) -> usize

Get the number of agents.

pub fn is_empty(&self) -> bool

Check if the graph is empty.

pub fn adjacency_matrix(&self) -> Vec<Vec<f64>>

Build the adjacency matrix (n×n). Entry [i][j] = total bandwidth from i→j. For undirected analysis, use undirected_adjacency.

pub fn undirected_adjacency(&self) -> Vec<Vec<f64>>

Build the undirected adjacency matrix: A[i][j] = A[j][i] = max bandwidth in either direction.

pub fn degree_matrix(&self) -> Vec<Vec<f64>>

Degree matrix (diagonal): D[i][i] = sum of weights incident to node i. Uses undirected version of the graph.

pub fn neighbors(&self, i: usize) -> Vec<usize>

Neighbors of node i (undirected).

pub fn is_connected(&self) -> bool

Check if the graph is connected (undirected BFS).

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

Number of connected components.

pub fn from_github_org( repos: Vec<(String, Vec<String>)>, dependencies: Vec<(String, String, f64)>, ) -> Self

Build from GitHub org data: repos as nodes, dependencies as edges. Each repo has a name (agent id) and list of capabilities (languages, topics). Dependencies are edges weighted by coupling strength.

pub fn complete(n: usize) -> Self

Create a complete graph on n nodes (all pairs connected).

pub fn path(n: usize) -> Self

Create a path graph: 0-1-2-…-(n-1).

pub fn cycle(n: usize) -> Self

Create a cycle graph: 0-1-2-…-(n-1)-0.

pub fn star(n: usize) -> Self

Create a star graph: center node 0 connected to all others.

pub fn barbell(k: usize) -> Self

Create a barbell graph: two cliques of size k joined by a single bridge edge.

pub fn two_cliques(k: usize) -> Self

Create two disconnected cliques of size k each.

pub fn random(n: usize, p: f64, seed: u64) -> Self

Create an Erdős–Rényi random graph with n nodes and edge probability p.

Trait Implementations

impl Clone for FleetGraph

fn clone(&self) -> FleetGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for FleetGraph

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

Formats the value using the given formatter.

impl Default for FleetGraph

fn default() -> Self

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for FleetGraph

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for FleetGraph

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.