Tagged Questions
0
votes
1answer
58 views
Help in understanding search of Vantage-Point tree
This is my reference: http://stevehanov.ca/blog/index.php?id=130
A vantage-point tree is a way of organizing a set of points so that finding the n-nearest neighbors is as efficient as possible. It ...
1
vote
0answers
30 views
How to formulate a best-search algorithm limited by a count of nodes visited?
The problem
I'm doing a search by computer program. Each node takes about 5 minutes of wall time to get a result so I'm looking to carefully choose the nodes to inspect so as to find the best result ...
3
votes
4answers
825 views
Need an efficient algorithm to visit all nodes of a graph, revisiting edges and nodes is allowed
Update:
This is my solution with Kruskal's Algorithm, although it doesn't take into account real "path". Brute force may be the only solution.
http://www.youtube.com/watch?v=VbSwwos4R2E
Hi, I ...
