チェンジセット 206 : SPARQLBuilderWWW/src/java/org/biohackathon/SPARQLBuilder/OWL

更新日時:

2014/11/18 14:16:47 (11 年 前)

更新者:

atsuko

ログメッセージ:

サーブレット側でクラスをソート＆パス検索を少し速く

ファイル:

• SPARQLBuilderWWW/src/java/org/biohackathon/SPARQLBuilder/OWL/OWLClassGraph.java (変更) (7 diff)

SPARQLBuilderWWW/src/java/org/biohackathon/SPARQLBuilder/OWL/OWLClassGraph.java

@@ -10 +10 @@
  */
 import java.util.*;
-//import java.util.LinkedList;
-//import java.util.List;
-//import java.util.ListIterator;
 
 public class OWLClassGraph extends LabeledMultiDigraph{
@@ -26 +23 @@
         ClassLink classLink;
         List<ClassLink> path;
+        Set<String> classURIs; // apearing class URIs in the path
         //boolean converge;
         
@@ -40 +38 @@
            //this.converge = converge;
         }
-    }
-        
+
+        public LinkAndPath(ClassLink classLink, List<ClassLink> path, String originalClassURI, Set<String> classURIs){
+           this.classLink = classLink;
+           this.path = path;
+           this.originalClassURI = originalClassURI;
+           this.classURIs = classURIs;
+           //this.converge = converge;
+        }
+    }
+
     public OWLClassGraph(String startClass, String endClass){
         super();
@@ -52 +58 @@
         nsteps = 3;
         limit = 1000;
-        prunecut = 100;        
+        prunecut = 100;
+        th = 5;
+    }
+
+    public OWLClassGraph(String startClass, String endClass, int th){
+        super();
+        
+        // start & end
+        this.startClass = startClass;
+        this.endClass = endClass;
+        // th of instances
+        this.th = th;
+        
+        // parameters
+        nsteps = 3;
+        limit = 1000;
+        prunecut = 100;
     }
 
     public Path[] getPaths(RDFSchemaAnalyzer rdfsa, boolean countLink){
         List<List<ClassLink>> paths = null;
-        paths = searchPaths(rdfsa, countLink);
+        //paths = searchPaths(rdfsa, countLink);
+        paths = searchPathsbyVisitingNodes(rdfsa, countLink);
         NavigableSet<Path> sortedpath = new TreeSet<Path>();
         ListIterator<List<ClassLink>> pit = paths.listIterator();
@@ -114 +137 @@
                            crrlp.classLink.getDirection() != classLinks[j].getDirection() &&
                            crrlp.originalClassURI.equals( classLinks[j].getLinkedClassURI()) ){
-                              //System.out.println("P1");
-                              continue;
-                          }
-                          if ( checkPruning(crrlp.classLink, classLinks[j]) ){
-                              //System.out.println("P2");
                               continue;
                           }
@@ -133 +151 @@
     }
 
-    //private
-    
-/*    
+    private List<List<ClassLink>> searchPathsbyVisitingNodes(RDFSchemaAnalyzer rdfsa, boolean countLinks){
+        List<List<ClassLink>> paths = new ArrayList<>();
+        List<LinkAndPath> lp = new LinkedList<>();
+        Set<String> urls = new HashSet<String>();
+        urls.add(startClass);
+        lp.add(new LinkAndPath(new ClassLink("",startClass,null,Direction.both,0,0,0,0,0,false,false), 
+                                 new LinkedList<ClassLink>(), startClass, urls));
+        try{
+          for ( int i = 0; i < nsteps; i++ ){
+              ListIterator<LinkAndPath> lit = lp.listIterator();
+              List<LinkAndPath> nextlp = new LinkedList<>();
+              while ( lit.hasNext() ){
+                  LinkAndPath crrlp = lit.next();
+                  ClassLink[] classLinks = rdfsa.getNextClass(null, crrlp.classLink.getLinkedClassURI(), limit, countLinks);
+                  // limit
+                  for ( int j = 0 ; j < classLinks.length; j++ ){
+                      if (crrlp.classURIs.contains(classLinks[j].getLinkedClassURI()) ){
+                          continue; // visited
+                      }
+                      List<ClassLink> crrpath = new LinkedList<>(crrlp.path);
+                      crrpath.add(classLinks[j]);
+                      Set<String> crrurls = new HashSet<String>(crrlp.classURIs);
+                      crrurls.add(classLinks[j].getLinkedClassURI());
+                      if ( classLinks[j].getLinkedClassURI() == null ){ continue; }
+                      if ( classLinks[j].getNumOfLinks() <= th){
+                          continue;
+                      }
+                      if ( classLinks[j].getLinkedClassURI().equals(endClass) ){
+                          paths.add(new LinkedList<>(crrpath));
+                          continue;
+                      }
+                      //crrlp.classURIs.add()
+                      nextlp.add(new LinkAndPath(classLinks[j], crrpath, crrlp.classLink.getLinkedClassURI(),crrurls));
+                  }
+              }
+              lp = nextlp;
+          }
+        }catch(Exception e){ 
+            System.err.println(e);
+        }
+        return paths;  
+    }
+    
+    /*
     private List<List<ClassLink>> searchPathsWithCut(OWLQueryBuilderImpl qb){
         List<List<ClassLink>> paths = new ArrayList<>();
@@ -261 +320 @@
    }
    
-   
+   /*
+   public Path[] getPathsByWholeGraph(RDFSchemaAnalyzer rdfsa){
+        setWholeGraph(rdfsa);
+        List<List<ClassLink>> paths = null;
+        //paths = searchPaths(rdfsa, countLink);
+        paths = searchPathsbyVisitingNodes(rdfsa, countLink);
+        NavigableSet<Path> sortedpath = new TreeSet<Path>();
+        ListIterator<List<ClassLink>> pit = paths.listIterator();
+        int j = 0;
+        while ( pit.hasNext() ){
+            Path path = new Path();
+            path.setStartClass(startClass);
+            List<ClassLink> crrpath = pit.next();
+            path.setClassLinks(crrpath);
+            ListIterator<ClassLink> cit = crrpath.listIterator();
+            int min = Integer.MAX_VALUE;
+            while ( cit.hasNext() ){
+                ClassLink cl = cit.next();
+                if ( cl.getNumOfLinks() < min ){
+                    min = cl.getNumOfLinks();
+                }
+            }
+            path.setWidth(min);
+            sortedpath.add(path);
+            j++;
+        }
+        Path[] patharray = new Path[paths.size()];
+        Iterator<Path> pait = sortedpath.descendingIterator();
+        int i = 0;
+        while ( pait.hasNext() ){
+            patharray[i] = pait.next();
+            i++;
+        }
+        return patharray;
+    }
+    */
 }