[Jung-support] closeness and betweenness

[Adeeb N. <ade...@co...>]

I am a graduate student who is doing a research on semantic web. I am using
the Jung library to calculate the closeness and betweenness for my network
and I have two questions:

1-Hers is my code to find betweenness:

System.out.println("Applying BetweennessCentrality");

BetweennessCentrality<RDFNode, Statement> Betweenness
= new BetweennessCentrality<RDFNode, Statement>(graph);

Betweenness.evaluate();

Betweenness.printRankings(true, true);

I got the betweenness score but is there a function to normalize it ? if
not, what is the best way to do such a thing ?

2-  How can I get the closeness score for all vertices on my graph ? below
is the code:

System.out.println("Applying ClosenessCentrality");

ClosenessCentrality<RDFNode, Statement> closeness
= new ClosenessCentrality<RDFNode, Statement>(graph);

closeness.getVertexScore(arg0);

This function will give me the score for only one vertices, however and as
I said before I want to calculate the closeness score for all vertices in
my graph. How

finally, I am using java 6 and JUNG 2.0.1 release as api.

Thanks.

-- 
Adeeb Noor
Ph.D. Candidate
Dept of Computer Science
University of Colorado at Boulder
Cell: 571-484-3303
Email: Ade...@co...