Struct DerivedGraph

Source

pub struct DerivedGraph(pub UnGraph<(Species, Connections), Shared>);

Expand description

A derived graph representing the relationships among species in a single stratum.

Nodes represent species within one stratum (e.g., parasites or hosts). Edges represent the number of shared connections they have to the opposing stratum.

Node weights: (Species, Connections)
Edge weights: Shared

Tuple Fields§

§0: UnGraph<(Species, Connections), Shared>

Implementations§

Source §

impl DerivedGraph

Source

pub fn overlap_measure()

Compute an overlap measure for the derived graph.

This function is a placeholder and will calculate overlap metrics (e.g., Jaccard similarity) for species in the same stratum. Not yet implemented.

Source

pub fn plot(&self, diameter: f64, remove: f64)

Plot the derived graph as a circular layout in SVG format.

§Arguments

diameter - The diameter of the circular layout.
remove - A threshold value. Edges with fewer shared partners than this value are ignored in the plot.

§Details

Nodes are placed evenly on a circle. Edges are drawn between nodes, scaled by the number of shared partners.

Modified from a reference here: https://observablehq.com/@euphrasiologist/hybridisation-in-the-genus-saxifraga

Trait Implementations§

Source §

impl Debug for DerivedGraph

Source §

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

Formats the value using the given formatter. Read more

Auto Trait Implementations§

§

impl UnwindSafe for DerivedGraph

Blanket Implementations§

Source §

impl<T> Any for T
where T: 'static + ?Sized,

Source §

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

Source §

impl<T> Borrow<T> for T
where T: ?Sized,

Source §

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

Source §

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source §

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

Source §

impl<T> From<T> for T

Source §

fn from(t: T) -> T

Returns the argument unchanged.

Source §

impl<T, U> Into for T
where U: From<T>,

Source §

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source §

impl<T> IntoEither for T

Source §

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more

Source §

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more

Source §