• Post Reply Bookmark Topic Watch Topic
  • New Topic

Appropriate algorithm to find all the transitive closure loops in graph?  RSS feed

 
roulz arora
Greenhorn
Posts: 3
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
Hi Team,

I want to find all the transitive closure loops in my graph having following conditions:

1. if all nodes present in identified loop is a sub set of another identified loop, then we will consider superset only.
2. find all distinct loops.

NOTE: read "loop" as--> transitive closure loop (i..e set of nodes in transitive closure)[/b]

Thank you.
 
fred rosenberger
lowercase baba
Bartender
Posts: 12565
49
Chrome Java Linux
  • Likes 1
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
We really would prefer it if you would post a link to any other sites where you have posted this exact question. Nothing is more frustrating than spending time answering the question here, only to find you've already gotten an answer somewhere else.

If you post the link to the other sites, folks can at least check the others before answering to see if help is still needed.
 
roulz arora
Greenhorn
Posts: 3
 
It is sorta covered in the JavaRanch Style Guide.
  • Post Reply Bookmark Topic Watch Topic
  • New Topic
Boost this thread!