Hi
Thanks for such a smooth ride with virtuoso, with so many resources to
guide. I am working on a dbpedia database in virtuoso, but I am facing
following issues:
1. I need to work on undirected graph
2. I need to work on a weigted graph where every edge is weighted (I will
be assigning the weights directly).
The precise problem that I am trying to solve is to find "shortest path"
between two nodes in an undirected weighted graph. Any pointers will be
appreciated. I am using virtuoso-opensource and this isn't a homework ;)
Thanks
Abhishek Gupta
Co-founder, Zumbl
------------------------------------------------------------------------------
Android is increasing in popularity, but the open development platform that
developers love is also attractive to malware creators. Download this white
paper to learn more about secure code signing practices that can help keep
Android apps secure.
http://pubads.g.doubleclick.net/gampad/clk?id=65839951&iu=/4140/ostg.clktrk
_______________________________________________
Virtuoso-users mailing list
Virtuoso-users@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/virtuoso-users
