Just DFS? Isn't that slow? Maybe Tarjan's? Or Newman-Ziff's?


On Tue, Jun 10, 2014 at 5:30 PM, <graph-tool-request@skewed.de> wrote:
Send graph-tool mailing list submissions to
        graph-tool@skewed.de

To subscribe or unsubscribe via the World Wide Web, visit
        http://lists.skewed.de/mailman/listinfo/graph-tool
or, via email, send a message with subject or body 'help' to
        graph-tool-request@skewed.de

You can reach the person managing the list at
        graph-tool-owner@skewed.de

When replying, please edit your Subject line so it is more specific
than "Re: Contents of graph-tool digest..."


Today's Topics:

   1. Algorithm to find the largest connected cluster (Shubham Bhushan)
   2. Re: Algorithm to find the largest connected cluster
      (Tiago de Paula Peixoto)


----------------------------------------------------------------------

Message: 1
Date: Tue, 10 Jun 2014 11:01:39 +0530
From: Shubham Bhushan <shubphotons@gmail.com>
To: graph-tool@skewed.de
Subject: [graph-tool] Algorithm to find the largest connected cluster
Message-ID:
        <CACpvG2HkeACyDVLhkwUw2=qxtpj2chR8ROCYostkiPhz+f+HrA@mail.gmail.com>
Content-Type: text/plain; charset="utf-8"

Hi
I want to know what Algorithm Graph Tool uses to find the larges connected
cluster. If possible provide me the links to research paper/book/blog where
the algorithm is discussed.
Shubham

--
http://about.me/shubham.bhushan
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.skewed.de/pipermail/graph-tool/attachments/20140610/2aafdf5d/attachment-0001.html>

------------------------------

Message: 2
Date: Tue, 10 Jun 2014 11:39:27 +0100
From: Tiago de Paula Peixoto <tiago@skewed.de>
To: Main discussion list for the graph-tool project
        <graph-tool@skewed.de>
Subject: Re: [graph-tool] Algorithm to find the largest connected
        cluster
Message-ID: <5396E05F.5030906@skewed.de>
Content-Type: text/plain; charset="iso-8859-1"

On 06/10/2014 06:31 AM, Shubham Bhushan wrote:
> Hi
> I want to know what Algorithm Graph Tool uses to find the larges connected cluster. If possible provide me the links to research paper/book/blog where the algorithm is discussed.

The algorithm used is a Depth-first search (DFS):

    http://en.wikipedia.org/wiki/Depth-first_search

(A DFS is started from each unvisited node, such that all components are
identified)

Best,
Tiago

--
Tiago de Paula Peixoto <tiago@skewed.de>

-------------- next part --------------
A non-text attachment was scrubbed...
Name: signature.asc
Type: application/pgp-signature
Size: 901 bytes
Desc: OpenPGP digital signature
URL: <http://lists.skewed.de/pipermail/graph-tool/attachments/20140610/3afb173a/attachment-0001.sig>

------------------------------

Subject: Digest Footer

_______________________________________________
graph-tool mailing list
graph-tool@skewed.de
http://lists.skewed.de/mailman/listinfo/graph-tool


------------------------------

End of graph-tool Digest, Vol 77, Issue 6
*****************************************



--
http://about.me/shubham.bhushan