[jgrapht-users] DirectedNeighborIndex

[Claudio M. <cla...@gm...>]

Hi,

I'm implementing a few algorithms that make extensive use of local
neighborhoods of Vertexes. Therefore I'd like to use
DirectedNeighborIndex class to speed up the computation. At the moment
I've extended SimpleDirectedWeightedGraph and added the methods
outgoingVertexesOf(V) and incomingVertexesOf(V), both cycling over the
results of outgoingEdgesOf() and incomingEdgesOf(). What I'm trying to
understand is re-implementing these outgoingVertexesOf() and
incomingVertexesOf() with calls to  predecessorOf() and successorOf()
of DirectedNeighborhorIndex is the smartest way to optimize my code.
My second question, connected to the first one, is if it's possible,
if it's not already been used, to ask the graph to cache the calls
internally for some computation.

TIA

/CM

-- 
    Claudio Martella
    cla...@gm...