Question concerning the use of the graph

[hanito]

adperezmorales Excuse me for asking this question here. After I upload basekb by using gsoc. What library should I use in order to compute the shortest path between nodes for example?

Should I use Tinkerpop Blueprints in order to manage the graph that I constructed?

Sorry again.
thank you

[adperezmorales]

I used tinkerpop to abstract the underlying implementation, so you could easily change the graph used under the hood.
In my case, I used Neo4j using tinkerpop (Neo4jGraph) as implementation.

After that, you should have a directory with the graph, so you can use tinkerpop neo4j to open it, or using normal neo4j graphs.
In the stanbol-freebase-disambiguation project , I used the generated graph to calculate the shortest path in order to be used in the disambiguation. For that, I got a Dijkstra algorithm implementation which accepted a Tinkerpop Graph instance, and configuring the way to get the weight of the edge, the rest if managed by the algorithm giving you the result about the shortest path between two nodes.

Hope this help