Shortest Paths algorithm #2

Activity

1. lucaspg96

   added

   enhancementNew feature or requestNew feature or request

   on Apr 15, 2019
2. castelojb

   added 9 commits that reference this issue on Apr 17, 2019

   [#2]Starting MP algorithm

   a1c578d

   [#2] buidPath development

   47c7e4c

   [#2] buidPath first version

   455f7c4

   [#2] start of test phase, creation of test class

   3252fb4

   [#2] first version of tests with two graphs

   51bbae3

   [#2] End of tests with 2 graphs with multiple different minimum paths

   5e084e7

   [#2] Tests with graphs with multiple different paths, cross paths, wi…

   ...

   0accd53

   [#2] tests with redundant edges and return change

   224558d

   [#2] Return type (List [Path]), new auxiliary classes: Path, PathEdge…

   ...

   7147be7
3. lucaspg96

   added a commit that references this issue on Apr 29, 2019

   [#2] Refactoring packages and classes

   e6e362d
4. castelojb

   added 3 commits that reference this issue on Apr 29, 2019

   [#2] inclusion of comments in each function used in MPFinder

   9ff8c3d

   [#2] Change in edge detection without addressing. Documentation of co…

   ...

   c09c2ec

   [#2] complement of documentation

   7b6bca7
5. lucaspg96 commented on May 8, 2019

   

   lucaspg96

   on May 8, 2019

   MemberAuthor

   More actions

   Divergence between MinimalPaths result and Dijkstra. To identify the error, just run:

   def main(args: Array[String]): Unit = {
       val graph = NTripleParser.parse("src/main/resources/dbpedia.nt")
       
       val fromNode = graph.getNodeByURI("person@en")
       val toNode = graph.getNodeByURI("Tony Award@en")
       
       val nodes = List(fromNode, toNode)
   
       graph.getLinksAsStream
         .foreach(link => link match {
           case Relation(_, l, t) =>
             if ((l.uri.endsWith("#type") && (t.uri.endsWith("#Class") || t.uri.endsWith("Property"))) ||
               (l.uri.endsWith("#range") && t.uri.contains("XMLSchema#")))
               link.setWeight(100)
             else if (l.uri.contains("rdf-schema#subClassOf"))
               link.setWeight(1)
             else if (l.uri.contains("rdf-schema#sub"))
               link.setWeight(10)
   
           case Attribute(_, l, _) =>
             if(l.uri.endsWith("#label"))
               link.setWeight(10)
   
           case _ =>
         })
   
       MinimalPathsClosure(graph)(nodes)
   
       val path = new DijkstraStrategy(graph).run(nodes.head.getId, nodes(1).getId)
   
       print("Dijkstra cost: "+path.getDistance(nodes(1).getId)+"| Path: ")
       path.printPathTo(nodes(1).getId)
   
     }
   
6. castelojb

   added a commit that references this issue on May 8, 2019

   [#2] Divergence resolved, data structure change used to collect FromN…

   ...

   5c2891d
7. lucaspg96

   added a commit that references this issue on May 9, 2019

   [#2] Merge branch 'issue-2' into develop

   190b699