Hi,
Please see: http://bit.ly/9Gli76
it always seems to show the T_SHORTEST_ONLY (shortest path) between two
nodes; any way to see all paths?
SELECT ?x ?y ?via ?dist WHERE
{
{ SELECT * WHERE { ?x skos:broader ?y } }
OPTION ( TRANSITIVE, t_distinct, t_in(?x), t_out(?y), t_max(10),
t_step(?x) as ?via, t_step('step_no') AS ?dist ) .
FILTER ( ?x =
<http://dbpedia.org/resource/Category:XML-based_standards> && ?y =
<http://dbpedia.org/resource/Category:Main_topic_classifications> )
}
whilst an "issue" this is only an interim query en-route to what I'm
trying to do; in reality what I want to do is find all paths between
multiple nodes and a route node which i specify (all paths between
?category in(x,y,z) and Category:Main_topic_classifications) then find
the intersections with the shortest route; ie that if you follow the
skos:broader of the cat tree up you'll find that Category:Semantic_Web
and Category:HTML intersect at Category:World_Wide_Web so that one can
infer that when something has these two categories it is in the broader
topic of World_Wide_Web.
If the aforementioned isn't an easy hit then just how to find all paths
will do the trick and I can UNION up some results and filter to get what
I want.
Many Regards,
Nathan
