API

MappedNodeGraph{N, G} <: AbstractJSMDGraph{Int}

Create a graph with mapped nodes.

Fields

• graph – Graph
• mid – Mapped id to nodes dictionary
• nodes – Mapped nodes
• edges – List of the edges between the nodes
• paths – List of the available paths in the graph

Constructors

• MappedNodeGraph{N}(g::G) where {G <: AbstractGraph, N <: AbstractGraphNode}

MappedDiGraph(::Type{N}) where {N}

Construct a directed MappedNodeGraph from node type N.

MappedGraph(::Type{N}) where {N}

Construct a MappedNodeGraph from node type N.

add_edge_cost!(g::MappedNodeGraph{T, <:SimpleGraph}, fid::Int, tid::Int, cost::Int)

For a SimpleGraph type, register the edge cost between the nodes with mapped IDs fid and tid in both directions.

add_edge_cost!(g::MappedNodeGraph, fid::Int, tid::Int, cost::Int)

Register the cost between of the edge from the node with mapped ID fid to the node with mapped ID tid.

compute_paths(g::MappedNodeGraph)

Compute all possible paths in the graph.

get_edgecosts(g::MappedNodeGraph, from::Int, to::Int)

Get all costs assigned to the edges between from and to. Returns an empty array if either from or to are not a part of g or if there is no path between them.

get_mappedid(g::MappedNodeGraph, node::Int)

Get the mappedid associated with a node. The mappedid is the internal ID that is assigned to the node within the graph.

get_mappednode(g::MappedNodeGraph, mid::Int)

Get the node associated to the given mapped id.

get_node(g::MappedNodeGraph, node::Int)

Get the node associated with a node index.

get_node_id(b::AbstractJSMDGraphNode)

Get the mapped-id of an AbstractJSMDGraphNode.

get_outerid(g::MappedNodeGraph, id::Int)

Return the id of the node associated to the mapped id id. The outer ID is the ID that is assigned to the node by the user.