Struct SimpleGraph 

pub struct SimpleGraph { /* private fields */ }

A simple undirected graph with vertices labeled by generic type V.

Implementation note: This is a minimal educational implementation. The Atlas uses a more specialized representation in crate::atlas.

Examples

use atlas_embeddings::foundations::primitives::SimpleGraph;

// Create triangle graph
let mut g = SimpleGraph::new();
g.add_edge(0, 1);
g.add_edge(1, 2);
g.add_edge(2, 0);

assert_eq!(g.vertex_count(), 3);
assert_eq!(g.edge_count(), 3);
assert!(g.is_adjacent(0, 1));
assert!(g.is_adjacent(1, 0)); // Undirected

Implementations

impl SimpleGraph

pub const fn new() -> Self

Create an empty graph with no vertices.

pub fn add_vertex(&mut self) -> usize

Add a vertex to the graph, returning its index.

Vertices are numbered sequentially: 0, 1, 2, …

pub fn add_edge(&mut self, u: usize, v: usize)

Add an undirected edge between vertices u and v.

Automatically adds vertices if they don’t exist yet.

pub fn is_adjacent(&self, u: usize, v: usize) -> bool

Check if vertices u and v are adjacent.

pub fn degree(&self, v: usize) -> usize

Get the degree of vertex v (number of neighbors).

Definition: The degree of a vertex is the number of edges incident to it.

pub fn vertex_count(&self) -> usize

Get the number of vertices in the graph.

pub fn edge_count(&self) -> usize

Get the number of edges in the graph.

Since the graph is undirected, we count each edge once.

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

Get the neighbors of vertex v.

Trait Implementations

impl Clone for SimpleGraph

fn clone(&self) -> SimpleGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for SimpleGraph

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

Formats the value using the given formatter.

impl Default for SimpleGraph

fn default() -> Self

Returns the “default value” for a type.