I have a directed graph and I want to find a path that visits every node exactly one time. I want to do this with a good complexity. Is this possible? And if yes, how?
Visit all nodes exactly once in a directed graph
8.1k views Asked by John Smith At
1
There are 1 answers
Related Questions in C++
- How to immediately apply DISPLAYCONFIG_SCALING display scaling mode with SetDisplayConfig and DISPLAYCONFIG_PATH_TARGET_INFO
- Why can't I use templates members in its specialization?
- How to fix "Access violation executing location" when using GLFW and GLAD
- Dynamic array of structures in C++/ cannot fill a dynamic array of doubles in structure from dynamic array of structures
- How do I apply the interface concept with the base-class in design?
- File refuses to compile std::erase() even if using -std=g++23
- How can I do a successful map when the number of elements to be mapped is not consistent in Thrust C++
- Can std::bit_cast be applied to an empty object?
- Unexpected inter-thread happens-before relationships from relaxed memory ordering
- How i can move element of dynamic vector in argument of function push_back for dynamic vector
- Brick Breaker Ball Bounce
- Thread-safe lock-free min where both operands can change c++
- Watchdog Timer Reset on ESP32 using Webservers
- How to solve compiler error: no matching function for call to 'dmhFS::dmhFS()' in my case?
- Conda CMAKE CXX Compiler error while compiling Pytorch
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 DIRECTED-GRAPH
- Gravis with Networkx Edge style modification
- Calculation of Shortest Paths in a Directed Graph takes much longer than calculating Betweenness Centrality
- Networkx weights meaning for centrality & communities
- Given an directed acyclic graph, create a strategy so that there is a bidirectional path between all possible Vertices
- How to limit path length in A*?
- How to generate a random directed cyclic graph with a defined "average" number of edges for each node? (in R language)
- Propagating traits in a directed graph
- SQLAlchemy: Load directed graph in fewer queries
- Cytoscape; Directed network betweenness & closeness centrality
- Error in getting specific node shape, edge color and edge weight
- How can I draw SVG diagrams that dynamically resize to fit the width of their HTML container, but with fixed-sized text?
- Check if T is the shortest path tree rooted at s
- Cycle in directed graph
- Is there a way to find semi-connected( unilaterally connected ) components in a directed graph with networkX?
- Building a directed graph from Voiceflow (json)
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?
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)
You are searching for a Hamiltonian path, which is a simple open path that contains each node exactly once.
Finding a Hamiltonian path in a given graph is NP-complete. In fact, determining whether a given (directed or undirected) graph contains a Hamiltonian path is already NP-complete (proven via reduction from e.g. the vertex cover problem).
If you still want to code it, here is an implementation on github. If you want a fast solution, maybe a heuristic is sufficient (for instance inspired by DNA molecules, or a solution that works fast on a subset of graphs. For instance, if you have a DAG, you can do a topological sort and then check if successive vertices are connected. If so, the topological sort gives a Hamiltonian path.