Want output of dijikstra_algorithm like A star Algorithm in edges Field instead of int64... or How we can convert integer into edges between nodes?

General Usage Performance
1

julia> using Graphs, GraphPlot

julia> using Symbolics, Statistics, LinearAlgebra

julia> using Plots, LaTeXStrings

julia> g = wheel_graph(10)
{10, 18} undirected simple Int64 graph

julia> ds = dijkstra_shortest_paths(g,2)
Graphs.DijkstraState{Int64, Int64}([2, 0, 2, 1, 1, 1, 1, 1, 1, 2], [1, 0, 1, 2, 2, 2, 2, 2, 2, 1], [Int64, Int64, Int64, Int64, Int64, Int64, Int64, Int64, Int64, Int64], [1.0, 1.0, 1.0, 2.0, 1.0, 1.0, 1.0, 1.0, 2.0, 1.0], Int64)

julia> A=ds.dists
10-element Vector{Int64}:
1
0
⋮
2
1

julia> A[6]
2
this is integer but i want this as 2 edges like below
julia> path = a_star(g,2,6)
2-element Vector{Graphs.SimpleGraphs.SimpleEdge{Int64}}:
Edge 2 => 1
Edge 1 => 6