Struct DiGraph

Source
pub struct DiGraph<N: Node, E: EdgeWeight, Ix: IndexType = u32> { /* private fields */ }
Expand description

A directed graph structure

Implementations§

Source§

impl<N: Node, E: EdgeWeight, Ix: IndexType> DiGraph<N, E, Ix>

Source

pub fn new() -> Self

Create a new empty directed graph

Source

pub fn add_node(&mut self, node: N) -> NodeIndex<Ix>

Add a node to the graph

Source

pub fn add_edge(&mut self, source: N, target: N, weight: E) -> Result<()>

Add a directed edge from source to target with a given weight

Source

pub fn adjacency_matrix(&self) -> Array2<E>
where E: Zero + One + Copy,

Get the adjacency matrix representation of the graph

Source

pub fn in_degree_vector(&self) -> Array1<usize>

Get the in-degree vector of the graph

Source

pub fn out_degree_vector(&self) -> Array1<usize>

Get the out-degree vector of the graph

Source

pub fn nodes(&self) -> Vec<&N>

Get all nodes in the graph

Source

pub fn edges(&self) -> Vec<Edge<N, E>>
where N: Clone, E: Clone,

Get all edges in the graph

Source

pub fn node_count(&self) -> usize

Number of nodes in the graph

Source

pub fn edge_count(&self) -> usize

Number of edges in the graph

Source

pub fn has_node(&self, node: &N) -> bool

Check if the graph has a node

Source

pub fn successors(&self, node: &N) -> Result<Vec<N>>
where N: Clone,

Get successors (outgoing neighbors) of a node

Source

pub fn predecessors(&self, node: &N) -> Result<Vec<N>>
where N: Clone,

Get predecessors (incoming neighbors) of a node

Source

pub fn has_edge(&self, source: &N, target: &N) -> bool

Check if an edge exists between two nodes

Source

pub fn edge_weight(&self, source: &N, target: &N) -> Result<E>
where E: Clone,

Get the weight of an edge between two nodes

Source

pub fn contains_node(&self, node: &N) -> bool

Check if the graph contains a specific node

Source

pub fn inner(&self) -> &PetGraph<N, E, Directed, Ix>

Get the internal petgraph structure for more advanced operations

Source

pub fn inner_mut(&mut self) -> &mut PetGraph<N, E, Directed, Ix>

Get a mutable reference to the internal petgraph structure

Trait Implementations§

Source§

impl<N: Node, E: EdgeWeight, Ix: IndexType> Default for DiGraph<N, E, Ix>

Source§

fn default() -> Self

Returns the “default value” for a type. Read more
Source§

impl<N, E, Ix: IndexType> WeightedOps<N, E> for DiGraph<N, E, Ix>
where N: Clone + Debug + Node, E: Clone + Debug + Into<f64> + From<f64> + PartialOrd + Zero + Add<Output = E> + Div<f64, Output = E> + Mul<f64, Output = E> + EdgeWeight,

Source§

fn weight_statistics(&self) -> Result<WeightStatistics<E>>

Calculate weight statistics for the graph
Source§

fn filter_by_weight( &self, min_weight: Option<E>, max_weight: Option<E>, ) -> Result<Self>

Filter edges by weight threshold
Source§

fn edges_by_weight(&self, ascending: bool) -> Result<Vec<(N, N, E)>>

Get edges sorted by weight
Source§

fn subgraph_by_weight_range(&self, min_weight: E, max_weight: E) -> Result<Self>

Extract subgraph with edges in weight range
Source§

fn normalize_weights(&self, method: NormalizationMethod) -> Result<Self>

Normalize edge weights using specified method
Source§

fn transform_weights(&self, transform: WeightTransform) -> Result<Self>

Transform edge weights using specified transformation
Source§

fn weight_distribution(&self, bins: usize) -> Result<Vec<(E, usize)>>

Get weight distribution as histogram
Source§

fn weighted_degree_centrality(&self) -> Result<HashMap<N, f64>>

Calculate weight-based centrality measures
Source§

fn total_weight(&self) -> Result<E>

Get total weight of the graph
Source§

fn average_weight(&self) -> Result<f64>

Get average edge weight

Auto Trait Implementations§

§

impl<N, E, Ix> Freeze for DiGraph<N, E, Ix>

§

impl<N, E, Ix> RefUnwindSafe for DiGraph<N, E, Ix>

§

impl<N, E, Ix> Send for DiGraph<N, E, Ix>
where Ix: Send,

§

impl<N, E, Ix> Sync for DiGraph<N, E, Ix>
where Ix: Sync,

§

impl<N, E, Ix> Unpin for DiGraph<N, E, Ix>
where N: Unpin, E: Unpin, Ix: Unpin,

§

impl<N, E, Ix> UnwindSafe for DiGraph<N, E, Ix>
where N: UnwindSafe, Ix: UnwindSafe, E: UnwindSafe,

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<U> 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§

impl<T> Pointable for T

Source§

const ALIGN: usize

The alignment of pointer.
Source§

type Init = T

The type for initializers.
Source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
Source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
Source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
Source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

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

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V