Struct Atlas 

pub struct Atlas { /* private fields */ }

Atlas of Resonance Classes

A 96-vertex graph with canonical labels and mirror symmetry.

Implementations

impl Atlas

pub fn new() -> Self

Construct the Atlas from first principles

Generates all 96 canonical labels and builds the graph structure.

pub const fn num_vertices(&self) -> usize

Get number of vertices

pub fn num_edges(&self) -> usize

Get number of edges

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

Get degree of a vertex

pub fn neighbors(&self, vertex: usize) -> &HashSet<usize>

Get neighbors of a vertex

pub fn is_adjacent(&self, v1: usize, v2: usize) -> bool

Check if two vertices are adjacent

pub fn label(&self, vertex: usize) -> Label

Get label of a vertex

pub fn labels(&self) -> &[Label]

Get all labels

pub fn mirror_pair(&self, vertex: usize) -> usize

Get mirror pair of a vertex

pub fn is_mirror_pair(&self, v1: usize, v2: usize) -> bool

Check if two vertices are mirror pairs

pub fn unity_positions(&self) -> &[usize]

Get unity positions (2 vertices)

pub fn find_vertex(&self, label: &Label) -> Option<usize>

Find vertex index for a given label

Trait Implementations

impl Clone for Atlas

fn clone(&self) -> Atlas

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Atlas

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

Formats the value using the given formatter.

impl Default for Atlas

fn default() -> Self

Returns the “default value” for a type.

impl ResGraphObject for Atlas

fn num_vertices(&self) -> usize

Get the number of vertices (or roots) in this object

fn object_name(&self) -> &'static str

Get a human-readable name for this object

fn has_adjacency(&self) -> bool

Check if this object has explicit adjacency information

fn is_adjacent(&self, v1: usize, v2: usize) -> bool

Check if two vertices are adjacent (if adjacency information available)