朱莉娅图表，dijkstra_shortest_paths

Question

我想有扩展的图形，能够增加顶点和边，并运行dijkstra_shortest_paths算法中。 我无法找到正确的方式来定义图形，以便dijkstra_shortest_paths可以工作。 以下是我的尝试。

using Graphs 
g1= graph(ExVertex[], ExEdge{ExVertex}[], is_directed=false) 
dist_key = "dist" 
v1 = add_vertex!(g1, "a") 
v2 = add_vertex!(g1, "b") 
v3 = add_vertex!(g1, "c") 
e12 = add_edge!(g1, v1, v2) 
e12.attributes[dist_key]=1.0 
e13 = add_edge!(g1, v1, v3) 
e13.attributes[dist_key]=1.0 
e23 = add_edge!(g1, v2, v3) 
e23.attributes[dist_key]=1.0 
epi = AttributeEdgePropertyInspector{Float64}(dist_key) 
dijkstra_shortest_paths(g1, epi, ["a"]) 

错误消息：

dijkstra_shortest_paths has no method matching dijkstra_shortest_paths(::GenericGraph{ExVertex,ExEdge{ExVertex},Array{ExVertex,1},Array{ExEdge{ExVertex},1},Array{Array{ExEdge{ExVertex},1},1}}, ::AttributeEdgePropertyInspector{Float64}, ::Array{ASCIIString,1}) 

Answer 1

我认为这个问题是["a"] - 你必须参考的实际顶点 “手动”，即

julia> sp = dijkstra_shortest_paths(g1, epi, [v1]) 
julia> sp.parents 
3-element Array{ExVertex,1}: 
vertex [1] "a" 
vertex [1] "a" 
vertex [1] "a" 
julia> sp.dists 
3-element Array{Float64,1}: 
0.0 
1.0 
1.0 

为我工作。