[igraph] how do you check for connectedness?

[Figa Pelosa]

hi Tamas,
I'm writing a little program in matlab and I'd need to check if a graph is 
connected.
What I do now is basically an iteration on the exponentiation of the adjacency 
matrix: I do that until two subsequent steps produce equal results and then I 
check if every node is connected to other nodes.

It's quite a slow tecnique, so I was wondering if in iGraph (which can do this 
check pretty fast) you use a different method.

Thanks a lot
FP


--- Mar 17/11/09, Tamas Nepusz <address@hidden> ha scritto:

> Da: Tamas Nepusz <address@hidden>
> Oggetto: Re: [igraph] the graph format edgelist could not save weights?
> A: address@hidden, "Help for igraph users" <address@hidden>
> Data: Martedì 17 novembre 2009, 09:29
> No, the edgelist format cannot, but
> you can use the "NCOL" format which is essentially
> equivalent to the edgelist format, but stores the edge
> weights in a third column.
> 
> -- 
> T.
> 
> On 2009.11.17., at 8:15, Zhijiang Wang wrote:
> 
> > 
> > -- 
> > Best wishes,
> > Zhijiang Wang
> > --------------------------------------------
> > PHD Student
> > Room 212, Science buliding,
> > The International WIC Institute,
> > College of Computer Science and Technology,
> > Beijing University of Technology,
> > Beijing, China.
> > _______________________________________________
> > igraph-help mailing list
> > address@hidden
> > http://lists.nongnu.org/mailman/listinfo/igraph-help
> 
> 
> 
> _______________________________________________
> igraph-help mailing list
> address@hidden
> http://lists.nongnu.org/mailman/listinfo/igraph-help
>