 |  |  |  |  |  |  |  |
How to detect circle in a directed graph?
Please support our Java advertiser: Programming Forums - DaniWeb Sister Site
 |
•
•
Join Date: Aug 2005
Posts: 5,266
Reputation: 
Solved Threads: 377
•
•
•
•
I wonder why people think about graphics applications when they read "directed graph". Actually, it is clearly defined what that means.
To most intelligent people that would mean something completely different to cycle.
Isn't it possible that he could have had finished the first stage in his program, which is the algorithm you have outlined, and then has moved onto a 2d realisation, whereby there was a need to detect a circle?
:rolleyes:
*Voted best profile in the world*
•
•
•
•
Originally Posted by iamthwee
Actually if you read the entire post, he used the word circle, instead of cycle.
To most intelligent people that would mean something completely different to cycle.
Isn't it possible that he could have had finished the first stage in his program, which is the algorithm you have outlined, and then has moved onto a 2d realisation, whereby there was a need to detect a circle?
:rolleyes:
•
•
Join Date: Aug 2005
Posts: 5,266
Reputation:
Solved Threads: 377
•
•
•
•
Originally Posted by server_crash
And if you look a few posts before, you made a typo using cycles.
•
•
•
•
That person made a very nice (long) post.
•
•
•
•
I wonder why people think about graphics applications when they read "directed graph". Actually, it is clearly defined what that means.
•
•
•
•
Leave it up to the thread creator wether the post was helpful or not and get rid of your **** poor attitude.
I would never attack you though. You helped me create an executable jar file.
:cheesy: :cheesy:
*Voted best profile in the world*
•
•
Join Date: Feb 2002
Posts: 12,043
Reputation:
Solved Threads: 129
Let's get back on track to the question please. I would hate to see this thread turn sour.
Dani the Computer Science Gal 
Follow my Twitter feed! twitter.com/DaniWeb
And if you're interested in Internet marketing there is twitter.com/DaniWebAds
Follow my Twitter feed! twitter.com/DaniWeb
And if you're interested in Internet marketing there is twitter.com/DaniWebAds
Hi,
by the way DFS has linear growth ( O(n) ), meaning that it is pretty efficient.
I believe that there is no faster algorithm for your problem, in terms of efficiency.
by the way DFS has linear growth ( O(n) ), meaning that it is pretty efficient.
I believe that there is no faster algorithm for your problem, in terms of efficiency.
|
Other Threads in the Java Forum
- Previous Thread: File Not Found Exception
- Next Thread: help hw
| Thread Tools | Search this Thread |
You need to join our community in order to build your list of favorite forums. You can visit the forum index for a listing of all forums.
Latest Java Posts
- Today's Posts
- Unanswered Threads
Related Forum Features
-xlint add android api applet application array arrays automation bi binary blackberry bluetooth chat class classes client code compile compiler component converter database digit eclipse equation error event exception fractal freeze functiontesting game gameprogramming givemetehcodez graphics gui health html hyper ide idea image input int integer j2me java javame javaprojects jetbrains jni jpanel jtable julia learningresources linux list login loop main map method methods mobile myregfun netbeans newbie nonstatic notdisplaying oracle page pearl print problem program programming project qt recursion scanner screen scrollbar server set size sms sort spamblocker sql string swing system thread threads time tree variablebinding windows xor
