Graphs

make_graph(edges::AbstractVector{<:AbstractEdge};  directed::Union{Bool,Missing}=missing)

return MetaGraph made up of the edges

Also the graph[:intbusmap] is created with the dicts for bus => int and int => bus (because Graphs.jl only works with integer nodes)

julia> g["13", :bus]
10

julia> g[13, :bus]
"24"

julia> get_prop(g, :int_bus_map)[13]
"24"

all_inneighbors(g::MetaGraphsNext.MetaGraph, j::String, innies::Vector{String})

A recursive function for finding all of the busses above bus j. Use like:

busses_above_j = all_inneighbors(g, j, Vector{String}())

all_outneighbors(g::MetaGraphsNext.MetaGraph, j::String, outies::Vector{String})

A recursive function for finding all of the busses below bus j. Use like:

busses_above_j = all_outneighbors(g, j, Vector{String}())

i_to_j(j::String, net::Network)

all the inneighbors of bus j

j_to_k(j::String, net::Network)

all the outneighbors of bus j

busses_from_deepest_to_source(g::MetaGraphsNext.MetaGraph, source::String)

return the busses and their integer depths in order from deepest from shallowest

busses_with_multiple_inneighbors(g::MetaGraphsNext.MetaGraph)

Find all the busses in g with indegree > 1

leaf_busses(net::Network)

returns Vector{String} containing all of the leaf busses in net.graph

next_bus_above_with_outdegree_more_than_one(g::MetaGraphsNext.MetaGraph, b::String)

Find the next bus above b with outdegree more than one. If none are found than nothing is returned. Throws an error if a bus with indegree > 1 is found above b.

paths_between(g::MetaGraphsNext.MetaGraph, b1::String, b2::String)::Vector{Vector{String}}

Returns all the paths (as vectors of bus strings) between b1 and b2

trim_above_bus!(g::MetaGraphsNext.MetaGraph, bus::String)

Remove all the busses and edges that are inneighbors (recursively) of bus

vertices_from_deepest_to_source(g::Graphs.AbstractGraph, source::Int64)

returns the integer vertices of g and their depths from the leafs to source