Function constrained_path 

pub fn constrained_path(
    blueprint: &AuditBlueprint,
    must_visit: &[String],
    preconditions: &HashMap<String, Vec<String>>,
) -> ConstrainedPathResult

Compute the shortest paths for a constrained set of procedures.

Starting from must_visit, the function expands the required set by following preconditions transitively (DFS / BFS over the precondition graph). It then delegates to analyze_shortest_paths for the full blueprint and returns only the entries that belong to the required set.

Arguments

• blueprint – The audit blueprint to analyse.
• must_visit – Procedure ids that must be covered.
• preconditions – Map from procedure id to its direct preconditions.