pub struct PageRankGraph<T> { /* private fields */ }Expand description
Precomputed graph structure for efficient PageRank computation
Implementations§
Source§impl<T> PageRankGraph<T>where
T: BixverseFloat + Sum,
impl<T> PageRankGraph<T>where
T: BixverseFloat + Sum,
Sourcepub fn from_indices(
node_count: usize,
from: &[usize],
to: &[usize],
weights: Option<&[T]>,
undirected: bool,
) -> Self
pub fn from_indices( node_count: usize, from: &[usize], to: &[usize], weights: Option<&[T]>, undirected: bool, ) -> Self
Sourcepub fn from_strings(
nodes: &[String],
from: &[String],
to: &[String],
weights: Option<&[T]>,
undirected: bool,
) -> Self
pub fn from_strings( nodes: &[String], from: &[String], to: &[String], weights: Option<&[T]>, undirected: bool, ) -> Self
Generate the structure directly from node names and edge lists
§Params
nodes- Slice of the node namesfrom- Slice of the names of the from nodesto- Slice of the names of the to nodesweights- Optional weight per edge. Defaults to 1.undirected- Whether to create bidirectional edges
§Returns
Initialised PageRankGraph structure
§Panics
If an edge names a node that is not in nodes.
Trait Implementations§
Auto Trait Implementations§
impl<T> Freeze for PageRankGraph<T>
impl<T> RefUnwindSafe for PageRankGraph<T>where
Vec<T>: RefUnwindSafe,
impl<T> Send for PageRankGraph<T>
impl<T> Sync for PageRankGraph<T>
impl<T> Unpin for PageRankGraph<T>
impl<T> UnsafeUnpin for PageRankGraph<T>where
Vec<T>: UnsafeUnpin,
impl<T> UnwindSafe for PageRankGraph<T>where
Vec<T>: UnwindSafe,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T, U> Imply<T> for U
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
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 moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
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 moreSource§impl<T> Pointable for T
impl<T> Pointable for T
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.