Skip to content

add keyword on shortest path #10

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
matbesancon merged 1 commit into from
Dec 15, 2024
Merged

add keyword on shortest path #10

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
9 changes: 4 additions & 5 deletions src/shortest_path.jl
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -13,18 +13,17 @@ function ShortestPathLMO(graph, src_node, dst_node)
return ShortestPathLMO{eltype(dist_matrix), typeof(graph)}(graph, src_node, dst_node, dist_matrix)
end

function FrankWolfe.compute_extreme_point(lmo::ShortestPathLMO, direction)
function FrankWolfe.compute_extreme_point(lmo::ShortestPathLMO, direction; v=falses(ne(lmo.graph)))
for (idx, edge) in enumerate(edges(lmo.graph))
lmo.dist_matrix[src(edge), dst(edge)] = direction[idx]
end
shortest_path_result = Set(Graphs.a_star(lmo.graph, lmo.src, lmo.dst, lmo.dist_matrix))
# resulting vertex as a BitVector
indicence_vector = falses(ne(lmo.graph))
v .= 0
for (idx, edge) in enumerate(edges(lmo.graph))
if edge in shortest_path_result
indicence_vector[idx] = 1
v[idx] = 1
delete!(shortest_path_result, edge)
end
end
return indicence_vector
return v
end
Loading