API

MINDFulCompanion.jointrmsagenerilizeddijkstra!Method
jointrmsagenerilizeddijkstra!(
    myibn::MINDFul.IBN,
    neibn::MINDFul.IBN,
    idagnode::MINDFul.IntentDAGNode{T<:MINDFul.ConnectivityIntent},
    iid::MINDFul.InterIntent{R<:MINDFul.IntentDirection};
    args...
)

Handles interdomain connectivity intents

source
MINDFulCompanion.mlnodegraphtomlgraphMethod
mlnodegraphtomlgraph(
    ibn::MINDFul.IBN,
    rate::Real;
    bordergroomingenabled
) -> NestedGraphs.NestedGraph{Int64, AttributeGraphs.OAttributeGraph{Int64, WrappedMultiGraphs.MultiDiGraph{Int64}, Tuple{MINDFulCompanion.NodeType, Int64}, MINDFulCompanion.LinkCostVector, Missing}, AttributeGraphs.OAttributeGraph{Int64, WrappedMultiGraphs.MultiDiGraph{Int64}, Tuple{MINDFulCompanion.NodeType, Int64}, MINDFulCompanion.LinkCostVector, Missing}}

Add virtual links and ip cost

source
MINDFulCompanion.mlnodegraphtomlgraphMethod
mlnodegraphtomlgraph(
    ngr::NestedGraphs.NestedGraph
) -> NestedGraphs.NestedGraph{Int64, AttributeGraphs.OAttributeGraph{Int64, WrappedMultiGraphs.MultiDiGraph{Int64}, Tuple{MINDFulCompanion.NodeType, Int64}, MINDFulCompanion.LinkCostVector, Missing}, AttributeGraphs.OAttributeGraph{Int64, WrappedMultiGraphs.MultiDiGraph{Int64}, Tuple{MINDFulCompanion.NodeType, Int64}, MINDFulCompanion.LinkCostVector, Missing}}

Convert a nested graph composed by MLNodes to a multi layer nested graph. New multi layer graph loses all info about nested stuctures Return also a data structure to nodes of the new nested graph to the nodes of the old one.

There are 2 layers in the multi layer graph: PHY, IP

source

Index