pub struct TriangleCounting;Expand description
Count triangles in the graph
Triangles indicate tightly connected clusters. High triangle count in attack graphs suggests multiple redundant paths.
Implementations§
Source§impl TriangleCounting
impl TriangleCounting
Sourcepub fn count(graph: &GraphStore) -> TriangleResult
pub fn count(graph: &GraphStore) -> TriangleResult
Count all triangles in the graph (treating as undirected)
Auto Trait Implementations§
impl Freeze for TriangleCounting
impl RefUnwindSafe for TriangleCounting
impl Send for TriangleCounting
impl Sync for TriangleCounting
impl Unpin for TriangleCounting
impl UnsafeUnpin for TriangleCounting
impl UnwindSafe for TriangleCounting
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
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
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> IntoRequest<T> for T
impl<T> IntoRequest<T> for T
Source§fn into_request(self) -> Request<T>
fn into_request(self) -> Request<T>
Wrap the input message
T in a tonic::Request