Bobojy00/moonbit_factory_graph/src/algorithms does not have a README file

    CostCriteria

    pub(all) enum CostCriteria {
    MinimumTransportDelay
    MinimumCycleTime
    MinimumEnergyLoss
    BalancedManufacturingCost
    } derive(Eq,
    Debug
    )

    CriticalAssetReport

    pub(all) struct CriticalAssetReport {
    single_points_of_failure : Array[String]
    critical_bridges : Array[String]
    } derive(
    Debug
    )

    CycleClassification

    pub(all) enum CycleClassification {
    ValidPalletRecirculationLoop
    DeadlockingMaterialDependency
    } derive(Eq,
    Debug
    )

    DetectedCycle

    pub(all) struct DetectedCycle {
    nodes : Array[String]
    classification : CycleClassification
    description : String
    } derive(
    Debug
    )

    MaxFlowResult

    pub(all) struct MaxFlowResult {
    max_throughput_units_per_hour : Double
    bottleneck_min_cut_edges : Array[String]
    } derive(
    Debug
    )

    NodeCentralityRanking

    pub(all) struct NodeCentralityRanking {
    node_id : String
    degree_centrality : Int
    betweenness_score : Double
    closeness_score : Double
    } derive(
    Debug
    )

    PathResult

    pub(all) struct PathResult {
    nodes : Array[String]
    edges : Array[
    Edge
    ]
    total_cost : Double
    total_delay_sec : Double
    bottleneck_bandwidth : Double
    } derive(Eq,
    Debug
    )

    ScheduleCriticalPath

    pub(all) struct ScheduleCriticalPath {
    ordered_stations : Array[String]
    makespan_sec : Double
    earliest_finish_times : Map[String, Double]
    critical_path : Array[String]
    } derive(
    Debug
    )

    compute_asset_centrality

    detect_material_cycles

    dijkstra_shortest_path

    fn dijkstra_shortest_path(graph :
    FactoryGraph
    , source : String, target : String, flow_type? :
    FlowType
    , criteria? : CostCriteria) -> PathResult?

    edmonds_karp_max_flow

    fn edmonds_karp_max_flow(graph :
    FactoryGraph
    , source : String, sink : String) -> MaxFlowResult

    find_critical_spof_assets

    find_disjoint_paths

    fn find_disjoint_paths(graph :
    FactoryGraph
    , source : String, target : String, flow_type? :
    FlowType
    , node_disjoint? : Bool) -> Array[PathResult]

    k_shortest_paths

    fn k_shortest_paths(graph :
    FactoryGraph
    , source : String, target : String, k : Int, flow_type? :
    FlowType
    , criteria? : CostCriteria) -> Array[PathResult]

    strongly_connected_components

    topological_production_schedule