Skip to content
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

Jump to bottom

[Dijkstra] Improve #22

Open
Kri5t0fK opened this issue Mar 25, 2023 · 0 comments
Open

[Dijkstra] Improve #22

Kri5t0fK opened this issue Mar 25, 2023 · 0 comments
Labels
enhancement New feature or request

Comments

@Kri5t0fK
Copy link
Owner

Kri5t0fK commented Mar 25, 2023 •
edited
Loading

For unvisitedVertices I'd suggest using PriorityQueue<TElement, TPriority> instead of looking for nearest vertex manually.

PriorityQueue<indexT, edgeWeightT(minCostToVertex)> unvisitedVertices = new PriorityQueue<indexT, edgeWeightT(minCostToVertex)>();

Originally posted by @Kri5t0fK in #21 (comment)
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
enhancement New feature or request
Projects
SouvlakiSearch
Status: Todo
Milestone
No milestone
Development

No branches or pull requests
1 participant
@Kri5t0fK