I have been studying Tarjan's articulation points finding algorithm and it says that the root node is an articulation point if it has more that 1 child. But if the graph is strongly connected, the root node shouldn't be an articulation point even if it has more than 1 child. Can someone please explain?
Tarjan's articulation point algorithm on strongly connected graph
262 Views Asked by Rocky Johnson At
1
There are 1 best solutions below
Related Questions in TARJANS-ALGORITHM
- Trying to run the java implementation of Tarjan algorithm
- Logic behind Tarjan's Algorithm for finding articulating points
- Finding no. of strongly connected components - wrong answer by my code
- Segmentation Fault - unordered_map(tarjan's algorithm)
- Tarjan algorithm - Python to scala
- Collapse vertices after Tarjan found the strongly connected component
- can we use only one index array in Tarjan algorithm?
- Find all cycles in the directed graph?
- The special case for using Tarjan's algorithm to find bridges in directed graphs
- Tarjan's algorithm: do lowest-links have to be similar for two or more nodes to be inside the same SCC
- Tarjan's Algorithm: Time Complexity and slight modification possibility
- How to take the output of Tarjan's algorithm (Strongly Connected Components) and then iterate over the nodes in topologically sorted order?
- Tarjan's strongly-connected components algorithm - why index in the back edge?
- Tarjan's articulation point algorithm on strongly connected graph
- Creating a graph and finding strongly connected components in a single pass (not just Tarjan!)
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 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?
If a graph is strongly connected then its root will never have 2 child. Remember , we are talking about DFS tree here. Hence in strongly connected graph , DFS-tree's root will only have one child and thats for sure.Try it urself.