Struct CyclesQuery 

pub struct CyclesQuery;

Returns every cycle in the graph as a sorted vector of NodeId lists.

Each inner Vec<NodeId> is a strongly connected component (SCC) whose size meets the CycleBounds criteria. Non-trivial SCCs are reported unconditionally; size-1 SCCs are included only when the node carries a self-edge and should_include_self_loops is true. The outer vector is truncated to bounds.max_results.

Invalidation

TRACKS_EDGE_REVISION = true: any edge change rebuilds the SCC data (via SccQuery) and therefore the filtered cycle list.

Trait Implementations

impl DerivedQuery for CyclesQuery

const QUERY_TYPE_ID: u32 = crate::queries::type_ids::CYCLES

Stable on-disk discriminator for PN3 derived-cache persistence.

const TRACKS_EDGE_REVISION: bool = true

Whether this query depends on the global edge topology.

type Key = CyclesKey

The input key for this query.

type Value = Arc<Vec<Vec<NodeId>>>

The output value. Must be Clone for cache retrieval.

fn execute( key: &CyclesKey, db: &QueryDb, snapshot: &GraphSnapshot, ) -> Arc<Vec<Vec<NodeId>>>

Computes the query result.

const PERSISTENT: bool = true

Whether this query’s Value satisfies the serde bounds required for PN3 cold-start persistence.

const TRACKS_METADATA_REVISION: bool = false

Whether this query depends on node metadata.