title: Calculate length of path betwen nodes (with unknown edges)?
body: <p>The problem is how to calculate the distance between two nodes (concepts) in a Triple Store (RDF) using sparql queries without know the type of edges. Essencially, is to use Dijkstras_algorithm 
  to find the shorter path between two concepts in a Triple Store.</p>
  
  <p>It is possible if we know the type of egde:
   <a href="https://stackoverflow.com/questions/5198889/calculate-length-of-path-between-nodes">Calculate length of path between nodes?</a></p>
  
  <p>One other solution is to use classes distances(do not work if concepts are not extended from the main classes):
  <a href="https://stackoverflow.com/questions/7890886/measuring-distances-among-classes-in-rdf-owl-graphs">Measuring distances among classes in RDF/OWL graphs</a></p>
  
  <h3>Example:</h3>
  
  <p>Find the shorter distance between <a href="http://bioinformatics.ua.pt/coeus/resource/uniprot_P01008" rel="nofollow noreferrer">http://bioinformatics.ua.pt/coeus/resource/uniprot_P01008</a>    and <a href="http://bioinformatics.ua.pt/coeus/resource/go_GO:0005576" rel="nofollow noreferrer">http://bioinformatics.ua.pt/coeus/resource/go_GO:0005576</a></p>