There are n points in the 2D plane. A robot wants to visit all of them but can only move horizontally or vertically. How should it visit all of them so that the total distance it covers is minimal?
algorithm to traverse points horizontally and vertically
542 Views Asked by SD. At
1
There are 1 best solutions below
Related Questions in PATH
- How to write a clickable link in VS Code terminal that points to a multiline range?
- Can't run Python's mapscript because of a missing DLL
- How change path to my new generated webp image in index.html?
- Correct way to compare file paths when one is canonical and other absolute
- make Error 2, The system cannot find the file specified
- Tkinter treeview displaying and selecting rows question
- Running clang64.exe or mingw64.exe incorrectly sets PATH
- Python project deployment on Ubuntu 18 server
- FileNotFoundError while trying to load dataset from drive
- Powershell Receive-File issue
- BlendMode does not work as expected with a path and circle in Jetpack Compose
- return all paths in a nested dictionary that also contains a list in python
- How to show and change Image inside a Flask Route?
- What is vue router :matchRest(.*)* and when should I use it?
- Cassandra Installation Issue on Windows 11- 64bit
Related Questions in ALGORITHM
- MCNP 6 - Doubts about cells
- Given partially sorted array of type x<y => first apperance of x comes before first of y, sort in average O(n)
- What is the algorithm behind math.gcd and why it is faster Euclidean algorithm?
- Purpose of last 2 while loops in the merge algorithm of merge sort sorting technique
- Dots and Boxes with apha-beta pruning
- What is the average and worst-case time complexity of my string searching algorithm?
- Building a School Schedule Generator
- TC problem 5-2:how to calculate the probability of the indicator random variable?
- LCA of a binary tree implemented in Python
- Identify the checksum algorithm
- Algorithm for finding a subset of nodes in a weighted connected graph such that the distance between any pair nodes are under a postive number?
- Creating an efficent and time-saving algorithm to find difference between greater than and lesser than combination
- Algorithm to find neighbours of point by distance with no repeats
- Asking code suggestions about data structure and algorithm
- Heap sort with multithreading
Related Questions in SHORTEST
- Shortest path finding in grid with turn cost
- BellmanFord with negative cycles
- how to get the shortest distance or path across several points in the map
- How to obtain all pairs shortest path length for large graph with 100k(100,000) nodes?
- Which algorithm to use when finding shortest path in multiple overlapping datasets?
- Incorrect shortest path in Python igraph?
- Javascript sorting array by shortest step
- Is there an implementation of the geodesic voronoi diagram in a simple polygon usable from Python?
- shortest path between two vertices after adding two new edges in a graph
- How to fin the shortest pass in matrix C++
- How to find the shortest route to complete the journey?
- Array value to properties name javascript
- bi-directional really gives shortest path?
- BFS print shortest path
- Tree k length, fewer nodes
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
Popular # Hahtags
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
This is the Travelling Salesman Problem where the distance between each pair of points is |y2-y1|+|x2-x1| (called Rectilinear distance or Manhattan distance). It's NP-hard which basically means that there is no known efficient solution.
Methods to solve it on Wikipedia.
The simplest algorithm is a naive brute force search, where you calculate the distance for every possible permutation of the points and find the minimum. This has a running time of O(n!). This will work for up to about 10 points, but it will very quickly become too slow for larger numbers of points.