Struct TeloidGraph 

pub struct TeloidGraph { /* private fields */ }

A graph structure representing the relationships between Teloids (norms).

This struct wraps UltraGraphWeighted, storing only TeloidIDs in the nodes for memory efficiency. The edges are weighted with TeloidRelation to represent inheritance or defeasance between norms.

For more details, see section 5 (Causality as EPP) and 8 (Teleology) in The EPP reference paper: https://github.com/deepcausality-rs/papers/blob/main/effect_propagation_process/epp.pdf

Implementations

impl TeloidGraph

pub fn number_nodes(&self) -> usize

pub fn number_edges(&self) -> usize

pub fn contains_edge(&self, a: usize, b: usize) -> bool

pub fn is_empty(&self) -> bool

pub fn clear(&mut self) -> Result<(), DeonticError>

impl TeloidGraph

pub fn is_frozen(&self) -> bool

pub fn freeze(&mut self)

pub fn unfreeze(&mut self)

impl TeloidGraph

pub fn new() -> Self

Creates a new, empty TeloidGraph.

Returns

A new TeloidGraph instance with an empty internal graph.

pub fn with_capacity(capacity: usize) -> Self

Creates a new TeloidGraph with a pre-allocated capacity for its internal graph.

This can be useful for performance optimization when the approximate number of nodes (Teloids) is known in advance, reducing the need for reallocations.

Arguments

• capacity - The initial capacity for the internal graph’s storage.

Returns

A new TeloidGraph instance with the specified capacity.

Trait Implementations

impl Clone for TeloidGraph

fn clone(&self) -> TeloidGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for TeloidGraph

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

Formats the value using the given formatter.

impl Default for TeloidGraph

fn default() -> TeloidGraph

Returns the “default value” for a type.

impl Teloidable for TeloidGraph

fn add_teloid(&mut self, id: TeloidID) -> Result<usize, DeonticError>

Adds a new teloid (node) to the graph.

Arguments

• id - The TeloidID of the teloid to add.

Returns

A Result which is Ok(usize) containing the index of the newly added teloid, or Err(GraphError) if the operation fails.

fn get_teloid_id(&self, index: usize) -> Option<TeloidID>

Retrieves the TeloidID associated with a given node index.

Arguments

• index - The index of the teloid (node) to retrieve the ID for.

Returns

An Option<TeloidID> which is Some(TeloidID) if the teloid exists at the given index, or None otherwise.

fn contains_teloid(&self, index: usize) -> bool

Checks if a teloid (node) exists at the given index in the graph.

Arguments

• index - The index to check for the presence of a teloid.

Returns

true if a teloid exists at the specified index, false otherwise.

fn add_inheritance_edge( &mut self, parent_idx: usize, child_idx: usize, ) -> Result<(), DeonticError>

Adds an inheritance edge between a parent teloid and a child teloid.

Arguments

• parent_idx - The index of the parent teloid.
• child_idx - The index of the child teloid.

Returns

A Result which is Ok(()) if the edge was added successfully, or Err(GraphError) if the operation fails.

fn add_defeasance_edge( &mut self, defeater_idx: usize, defeated_idx: usize, ) -> Result<(), DeonticError>

Adds a defeasance edge between a defeater teloid and a defeated teloid.

Arguments

• defeater_idx - The index of the defeater teloid.
• defeated_idx - The index of the defeated teloid.

Returns

A Result which is Ok(()) if the edge was added successfully, or Err(GraphError) if the operation fails.