[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [igraph] Edge betweenness
From: |
Gabor Csardi |
Subject: |
Re: [igraph] Edge betweenness |
Date: |
Mon, 21 Apr 2008 17:16:58 +0200 |
User-agent: |
Mutt/1.5.13 (2006-08-11) |
Sylvian,
NeAT looks like a nice tool, congratulations!
Here is a starting point:
http://cneurocvs.rmki.kfki.hu/igraph/doc/html/ch03s01.html
The "REAL" solution would be to write a simple interface from
perl to the igraph functions you need, and then you would not
need any temporary files.
Some more pointers, loading a graph:
http://cneurocvs.rmki.kfki.hu/igraph/doc/html/igraph_read_graph_gml.html
closeness/betweenness/edge betweenness calculation:
http://cneurocvs.rmki.kfki.hu/igraph/doc/html/ch10s05.html
For writing the result you need to be familiar with igraph vectors:
http://cneurocvs.rmki.kfki.hu/igraph/doc/html/igraph-Vectors.html
If you're new to C, then this will be quite tough, i recommend
reading the Kernighan/Ritchie book first.
Gabor
ps. if you want to post more emails to this list, please consider
joining the list, otherwise i have to acknowledge your emails
by hand and that can cause delays.
On Mon, Apr 21, 2008 at 05:00:41PM +0200, Sylvain Brohée wrote:
> Dear all,
>
> Since a few months, I have developed a quite powerful tool in Perl doing
> efficiently very simple graph analysis (node degree, graph
> intersection, ...). This is called NeAT (http://rsat.scmbb.ulb.ac.be/neat/)
> and is publicly available.
>
> However, in some cases, I am very limited by Perl.
>
> It is for example the case, when I want to compute the betweenness and the
> closeness of the nodes in a graph as for this, I need to compute all geodesic
> paths. So, I would like to create a small C executable based on the igraph
> library that would be called by my Perl program.
>
> Unfortunately, I am complete newbie in C / C++ and I do not know how to start
> with.
>
> Could you give some advices?
>
> I want only to load a (directed weighted) graph, calculate the closeness and
> the betweenness for each node and to display the output.
>
> I would be very thankful if you could help me,
>
> Sylvain (desperate biologist)
>
>
> _______________________________________________
> igraph-help mailing list
> address@hidden
> http://lists.nongnu.org/mailman/listinfo/igraph-help
--
Csardi Gabor <address@hidden> UNIL DGM