pub struct Ranking { /* private fields */ }
Expand description
The result of running a source-location algorithm on an infected network.
It is a Vec
of (suspect index, score) pairs, ordered by the score. The higher the node is
positioned, the higher the probability that it is the true information source.
Implementations
Returns immutable reference to the wrapped cn::IndexMap
.
Returns the recorded true source.
Returns the position of the true source in the ranking, None
if it’s not in the ranking.
Returns the score of the true source, None
if it’s not in the ranking.
Returns ranking precision.
Precision is # of true positives / # of all positives.
Trait Implementations
Auto Trait Implementations
impl RefUnwindSafe for Ranking
impl UnwindSafe for Ranking
Blanket Implementations
Mutably borrows from an owned value. Read more
The inverse inclusion map: attempts to construct self
from the equivalent element of its
superset. Read more
pub fn is_in_subset(&self) -> bool
pub fn is_in_subset(&self) -> bool
Checks if self
is actually part of its subset T
(and can be converted to it).
pub fn to_subset_unchecked(&self) -> SS
pub fn to_subset_unchecked(&self) -> SS
Use with care! Same as self.to_subset
but without any property checks. Always succeeds.
pub fn from_subset(element: &SS) -> SP
pub fn from_subset(element: &SS) -> SP
The inclusion map: converts self
to the equivalent element of its superset.