Re: A graph problem

On Mar 30, 11:29 am, "Mahdi" <mahdi.dabest...@xxxxxxxxx> wrote:
Hello!
We have a graph that is not directional. We want an algorithm to find
out if this graph is divided to two parts or not.

Sounds like connected components or transitive closure might be what
you are after.
http://www.cs.sunysb.edu/~algorith/files/dfs-bfs.shtml

http://www.cs.sunysb.edu/~algorith/files/transitive-closure.shtml

Perhaps related:
http://gdea.informatik.uni-koeln.de/archive/00000738/

http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6V0C-45H0FCM-3&_user=10&_coverDate=06%2F30%2F2002&_rdoc=1&_fmt=&_orig=search&_sort=d&view=c&_acct=C000050221&_version=1&_urlVersion=0&_userid=10&md5=bb8d2cc33e739f4f797b5de6a0eaa4ba

http://www.boost.org/libs/graph/doc/fruchterman_reingold.html

http://www.cs.usyd.edu.au/~shhong/dis.ps

.

Relevant Pages

  • Re: Standard graph API?
    ... isomorphism graph library. ... It's pretty uniformly agreed that there is no standard graph ... the algorithm can't be specialized for the graph at ... My thought is to use some sort of templating system. ...
    (comp.lang.python)
  • Difference between two systems of DAGs
    ... I am looking for a graph algorithm, ... carry no label or other information except direction. ... edit operations are to change the label of a vertex or the ...
    (comp.theory)
  • Re: Vertex Cover implementation
    ... i code this simple greedy algorithm for the vertex cover: ... As you are constructing your graph you can update the vertex ... each edge appears on two adjacency lists. ... reason to use a priority queue for your algorithm. ...
    (comp.theory)
  • Re: combinatorial optimization problem (six-pick wager grouping)
    ... versed in graph theoretic approaches could comment on my ideas below - ... I'n not a graph theorist, nor a graph algorithm buff, so I can't really ... attempt to merge it with each bet already in the pool. ... million edges when I ignored wager size. ...
    (comp.programming)
  • Re: Pathfinding in community
    ... > Each member is able to add his own contacts at the community. ... Dijkstra's algorithm is simply a refined breadth first search. ... In your case all the edges on the graph have the same weight, ... I would suggest loading this data into an array of arrays. ...
    (comp.lang.php)