Struct DagAnalysis
pub struct DagAnalysis<N, S = FixedHasher>where
N: GraphNodeId,
S: BuildHasher,{ /* private fields */ }Expand description
Stores the results of a call to Dag::analyze.
Implementations§
§impl<N, S> DagAnalysis<N, S>where
N: GraphNodeId,
S: BuildHasher,
impl<N, S> DagAnalysis<N, S>where
N: GraphNodeId,
S: BuildHasher,
pub fn new(
graph: &Graph<true, N, S>,
topological_order: &[N],
) -> DagAnalysis<N, S>where
S: Default,
pub fn new(
graph: &Graph<true, N, S>,
topological_order: &[N],
) -> DagAnalysis<N, S>where
S: Default,
Processes a DAG and computes its:
- transitive reduction (along with the set of removed edges)
- transitive closure
- reachability matrix (as a bitset)
- pairs of nodes connected by a path
- pairs of nodes not connected by a path
The algorithm implemented comes from “On the calculation of transitive reduction-closure of orders” by Habib, Morvan and Rampon.
pub fn reachable(&self) -> &FixedBitSet
pub fn reachable(&self) -> &FixedBitSet
Returns the reachability matrix.
pub fn connected(&self) -> &HashSet<(N, N), S>
pub fn connected(&self) -> &HashSet<(N, N), S>
Returns the set of node pairs that are connected by a path.
pub fn disconnected(&self) -> &[(N, N)]
pub fn disconnected(&self) -> &[(N, N)]
Returns the list of node pairs that are not connected by a path.
pub fn transitive_edges(&self) -> &[(N, N)]
pub fn transitive_edges(&self) -> &[(N, N)]
Returns the list of redundant edges because a longer path exists.
pub fn transitive_reduction(&self) -> &Graph<true, N, S>
pub fn transitive_reduction(&self) -> &Graph<true, N, S>
Returns the transitive reduction of the graph.
pub fn transitive_closure(&self) -> &Graph<true, N, S>
pub fn transitive_closure(&self) -> &Graph<true, N, S>
Returns the transitive closure of the graph.
pub fn check_for_redundant_edges(&self) -> Result<(), DagRedundancyError<N>>where
S: Clone,
pub fn check_for_redundant_edges(&self) -> Result<(), DagRedundancyError<N>>where
S: Clone,
Checks if the graph has any redundant (transitive) edges.
§Errors
If there are redundant edges, returns a DagRedundancyError
containing the list of redundant edges.
pub fn check_for_cross_dependencies(
&self,
other: &DagAnalysis<N, S>,
) -> Result<(), DagCrossDependencyError<N>>
pub fn check_for_cross_dependencies( &self, other: &DagAnalysis<N, S>, ) -> Result<(), DagCrossDependencyError<N>>
Checks if there are any pairs of nodes that have a path in both this graph and another graph.
§Errors
Returns DagCrossDependencyError if any node pair is connected in
both graphs.
pub fn check_for_overlapping_groups<K, V>(
&self,
groups: &DagGroups<K, V>,
) -> Result<(), DagOverlappingGroupError<K>>
pub fn check_for_overlapping_groups<K, V>( &self, groups: &DagGroups<K, V>, ) -> Result<(), DagOverlappingGroupError<K>>
Checks if any connected node pairs that are both keys have overlapping groups.
§Errors
If there are overlapping groups, returns a DagOverlappingGroupError
containing the first pair of keys that have overlapping groups.
Trait Implementations§
§impl<N, S> Debug for DagAnalysis<N, S>where
N: GraphNodeId,
S: BuildHasher,
impl<N, S> Debug for DagAnalysis<N, S>where
N: GraphNodeId,
S: BuildHasher,
§impl<N, S> Default for DagAnalysis<N, S>
impl<N, S> Default for DagAnalysis<N, S>
§fn default() -> DagAnalysis<N, S>
fn default() -> DagAnalysis<N, S>
Auto Trait Implementations§
impl<N, S> Freeze for DagAnalysis<N, S>where
S: Freeze,
impl<N, S> RefUnwindSafe for DagAnalysis<N, S>where
S: RefUnwindSafe,
N: RefUnwindSafe,
<N as GraphNodeId>::Edge: RefUnwindSafe,
<N as GraphNodeId>::Adjacent: RefUnwindSafe,
impl<N, S> Send for DagAnalysis<N, S>
impl<N, S> Sync for DagAnalysis<N, S>
impl<N, S> Unpin for DagAnalysis<N, S>
impl<N, S> UnsafeUnpin for DagAnalysis<N, S>where
S: UnsafeUnpin,
impl<N, S> UnwindSafe for DagAnalysis<N, S>where
S: UnwindSafe,
N: UnwindSafe,
<N as GraphNodeId>::Edge: UnwindSafe,
<N as GraphNodeId>::Adjacent: 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
§impl<T> Conv for T
impl<T> Conv for T
§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>, which can then be
downcast into Box<dyn ConcreteType> where ConcreteType implements Trait.§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Rc<Trait> (where Trait: Downcast) to Rc<Any>, which can then be further
downcast into Rc<ConcreteType> where ConcreteType implements Trait.§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
&Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &Any’s vtable from &Trait’s.§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
&mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &mut Any’s vtable from &mut Trait’s.§impl<T> DowncastSend for T
impl<T> DowncastSend for T
§impl<T> FmtForward for T
impl<T> FmtForward for T
§fn fmt_binary(self) -> FmtBinary<Self>where
Self: Binary,
fn fmt_binary(self) -> FmtBinary<Self>where
Self: Binary,
self to use its Binary implementation when Debug-formatted.§fn fmt_display(self) -> FmtDisplay<Self>where
Self: Display,
fn fmt_display(self) -> FmtDisplay<Self>where
Self: Display,
self to use its Display implementation when
Debug-formatted.§fn fmt_lower_exp(self) -> FmtLowerExp<Self>where
Self: LowerExp,
fn fmt_lower_exp(self) -> FmtLowerExp<Self>where
Self: LowerExp,
self to use its LowerExp implementation when
Debug-formatted.§fn fmt_lower_hex(self) -> FmtLowerHex<Self>where
Self: LowerHex,
fn fmt_lower_hex(self) -> FmtLowerHex<Self>where
Self: LowerHex,
self to use its LowerHex implementation when
Debug-formatted.§fn fmt_octal(self) -> FmtOctal<Self>where
Self: Octal,
fn fmt_octal(self) -> FmtOctal<Self>where
Self: Octal,
self to use its Octal implementation when Debug-formatted.§fn fmt_pointer(self) -> FmtPointer<Self>where
Self: Pointer,
fn fmt_pointer(self) -> FmtPointer<Self>where
Self: Pointer,
self to use its Pointer implementation when
Debug-formatted.§fn fmt_upper_exp(self) -> FmtUpperExp<Self>where
Self: UpperExp,
fn fmt_upper_exp(self) -> FmtUpperExp<Self>where
Self: UpperExp,
self to use its UpperExp implementation when
Debug-formatted.§fn fmt_upper_hex(self) -> FmtUpperHex<Self>where
Self: UpperHex,
fn fmt_upper_hex(self) -> FmtUpperHex<Self>where
Self: UpperHex,
self to use its UpperHex implementation when
Debug-formatted.§fn fmt_list(self) -> FmtList<Self>where
&'a Self: for<'a> IntoIterator,
fn fmt_list(self) -> FmtList<Self>where
&'a Self: for<'a> IntoIterator,
§impl<T> FromWorld for Twhere
T: Default,
impl<T> FromWorld for Twhere
T: Default,
§fn from_world(_world: &mut World) -> T
fn from_world(_world: &mut World) -> T
Creates Self using default().
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
§impl<T> IntoResult<T> for T
impl<T> IntoResult<T> for T
§fn into_result(self) -> Result<T, RunSystemError>
fn into_result(self) -> Result<T, RunSystemError>
§impl<T> Pipe for Twhere
T: ?Sized,
impl<T> Pipe for Twhere
T: ?Sized,
§fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere
Self: Sized,
fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere
Self: Sized,
§fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere
R: 'a,
fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere
R: 'a,
self and passes that borrow into the pipe function. Read more§fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere
R: 'a,
fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere
R: 'a,
self and passes that borrow into the pipe function. Read more§fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
§fn pipe_borrow_mut<'a, B, R>(
&'a mut self,
func: impl FnOnce(&'a mut B) -> R,
) -> R
fn pipe_borrow_mut<'a, B, R>( &'a mut self, func: impl FnOnce(&'a mut B) -> R, ) -> R
§fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
self, then passes self.as_ref() into the pipe function.§fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
self, then passes self.as_mut() into the pipe
function.§fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
self, then passes self.deref() into the pipe function.§impl<T> PolicyExt for Twhere
T: ?Sized,
impl<T> PolicyExt for Twhere
T: ?Sized,
§impl<T> Tap for T
impl<T> Tap for T
§fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
Borrow<B> of a value. Read more§fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
BorrowMut<B> of a value. Read more§fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
AsRef<R> view of a value. Read more§fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
AsMut<R> view of a value. Read more§fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
Deref::Target of a value. Read more§fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
Deref::Target of a value. Read more§fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
.tap() only in debug builds, and is erased in release builds.§fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
.tap_mut() only in debug builds, and is erased in release
builds.§fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
.tap_borrow() only in debug builds, and is erased in release
builds.§fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
.tap_borrow_mut() only in debug builds, and is erased in release
builds.§fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
.tap_ref() only in debug builds, and is erased in release
builds.§fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
.tap_ref_mut() only in debug builds, and is erased in release
builds.§fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
.tap_deref() only in debug builds, and is erased in release
builds.