What is the most efficient way to determine if a directed graph is singly connected?

Posted by zebraman on Stack Overflow See other posts from Stack Overflow or by zebraman
Published on 2010-03-24T20:50:39Z Indexed on 2010/03/24 20:53 UTC
Read the original article Hit count: 275

Filed under:

directed-graph

|

algorithm

|

adjacency-list

I am working on an assignment where one of the problems asks to derive an algorithm to check if a directed graph G=(V,E) is singly connected (there is at most one simple path from u to v for all distinct vertices u,v of V.

Of course you can brute force check it, which is what I'm doing right now, but I want to know if there's a more efficient way. Could anyone point me in the right direction?

© Stack Overflow or respective owner

Related posts about directed-graph

Sample Directed Graph and Topological Sort Code

as seen on Stack Overflow - Search for 'Stack Overflow'
Hello Anyone know where I can obtain sample code for a Directed Graph and sample code for performing a topological sort on a directed graph? (preferably in Java) Thanks >>> More
Directed graph layout engines on .NET / Silverlight / JavaScript / Flash

as seen on Stack Overflow - Search for 'Stack Overflow'
Hi! Who knows good graph layout engines with clear customization and managment? Flare is an cool one but it is written on Flex (may be you know how it can be customized without re-compilation and writing code?). I also know about JavaScript InfoVis Toolkit but it not good enough. >>> More
algorithm to use to return a specific range of nodes in a directed graph

as seen on Stack Overflow - Search for 'Stack Overflow'
I have a class Graph with two lists types namely nodes and edges I have a function List<int> GetNodesInRange(Graph graph, int Range) when I get these parameters I need an algorithm that will go through the graph and return the list of nodes only as deep (the level) as the range. The algorithm… >>> More
BFS traversal of directed graph from a given node

as seen on Stack Overflow - Search for 'Stack Overflow'
Hi, My understanding of basic BFS traversal for a graph is: BFS { Start from any node . Add it to que. Add it to visited array While(que is not empty) { remove head from queue. Print node; add all unvisited direct subchilds to que; mark them as visited } } However, if we have to… >>> More
how to visualize a directed graph on webpage?

as seen on Stack Overflow - Search for 'Stack Overflow'
I want to visualize a directed graph on a web page. Are there any Javascript or Flash solution for this? free :) >>> More

Related posts about algorithm

Jpeg Algorithm vs BMP Algorithm?

as seen on Super User - Search for 'Super User'
I'm just wonder, what the differences are between creating a BMP file algorithm and JPG file algorithm ? If you know the others images' format algorithm, please post them. Thanks. >>> More
word disambiguation algorithm (Lesk algorithm)

as seen on Stack Overflow - Search for 'Stack Overflow'
Hii.. Can anybody help me to find an algorithm in Java code to find synonyms of a search word based on the context and I want to implement the algorithm with WordNet database. For example, "I am running a Java program". From the context, I want to find the synonyms for the word "running", but the… >>> More
Search algorithm (with a sort algorithm already implemented)

as seen on Stack Overflow - Search for 'Stack Overflow'
Hello, Im doing a Java application and Im facing some doubts in which concerns performance. I have a PriorityQueue which guarantees me the element removed is the one with greater priority. That PriorityQueue has instances of class Event (which implements Comparable interface). Each Event is associated… >>> More
Is there any algorithm for finding LINES by PIXEL COLORS on picture?

as seen on Stack Overflow - Search for 'Stack Overflow'
So I have Image like this I want to get something like this (I hevent drawn all lines I want but I hope you can get my idea) I need algorithm for finding all straight lines on it by just reading colors of pixels. No hard math, no Haar, no Hough. Some algorithm which would be based on points… >>> More
collsion issues with quadtree [on hold]

as seen on Game Development - Search for 'Game Development'
So i implemented a Quad tree in Java for my 2D game and everything works fine except for when i run my collision detection algorithm, which checks if a object has hit another object and which side it hit.My problem is 80% of the time the collision algorithm works but sometimes the objects just go… >>> More