Running betweenness centrality algorithm seems to throw
exceptions randomly. This is most likely due to the way JUNG's
centrality computation method looks. That method simply throws an
exception if some property of the graph is not satisfied. The
algorithm needs to catch this exception. Even better would be if the
algorithm didn't throw an exception in the first place.
Logged In: YES
user_id=1061200
We should replace this with the FORTRAN version next week. That will
give us a chance to code and test the behind-the-scenes conversion of
data.