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

更新日時:

2015/04/08 17:05:11 (9 年 前)

更新者:

atsuko

ログメッセージ:

コスト関数導入

ファイル:

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

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

@@ -17 +17 @@
     int limit = 100;
     int th = 1;
+    double cth = 1.0; // 0.0(no path) - 1.0(all paths)
+    
     List<String> nodeType;
     ArrayList<HashSet<Integer>> connectionTable;
@@ -24 +26 @@
     List<Map<Integer, Integer>> edgeweight;
     List<Integer> nodeweight;
+    Map<String, Boolean> checkedpaths;
     
     public class LinkAndPath{
@@ -56 +59 @@
     }
         
-    public OWLClassGraph(RDFSchemaAnalyzer rdfsa){ // not used
+    public OWLClassGraph(RDFSchemaAnalyzer rdfsa){ // for experiment
         super();
         nodeType = new LinkedList<String>();
+        this.askcheck = false;
+        setClassGraph(rdfsa);
     }
     
@@ -124 +129 @@
     private List<List<ClassLink>> searchPaths(String startClass, String endClass){
         //int asked = 0;
-        Map<String,Boolean> checkedpaths = new HashMap<String, Boolean>();
+        checkedpaths = new HashMap<String, Boolean>();
         List<List<ClassLink>> paths = new ArrayList<>();
         Integer snode = labelednodes.get(startClass);
@@ -163 +168 @@
                     nextpath.add(nextnode);
                     // tmp
-                    if ( i >= 1 ){
+                    if ( i >= 1  && askcheck == true ){
                         int wn = nodeweight.get(crrnode);
                         int in = edgeweight.get(crrpath.get(crrpath.size()-2)).get(crrnode);
@@ -182 +187 @@
                                 }
                             }else{                      
-                                boolean chk = EndpointAccess.check3SimplePathwithJoin(nextnode, crrpath.get(crrpath.size()-1),
+                                boolean chk = EndpointAccess.check3SimplePath(nextnode, crrpath.get(crrpath.size()-1),
                                     crrpath.get(crrpath.size()-2), this, sparqlEndpoint);
                                 checkedpaths.put(key1, chk);
@@ -235 +240 @@
                     addedpath.add(cl);
                     // check
-                    //if ( EndpointAccess.checkPath(startClass, addedpath, sparqlEndpoint) ){
+                    if (checkPath(startClass, addedpath)){
                         tmppaths.add(addedpath);
-                    //}
+                    }
                 }
             }
@@ -246 +251 @@
     }
     
-/*              
-   private void setClassGraph(RDFSchemaAnalyzer rdfsa){
-       // setNodes
-       SClass[] classes = null;
-       try{
-           classes = rdfsa.getOWLClasses(null, null, null, true);
-       }catch(Exception e){
-           System.err.println(e); return;
-       }
-       for (int i = 0 ; i < classes.length; i++){
-           addNode(classes[i].getClassURI());
-           nodeType.add("class");
-       }
-       // setEdges
-       for (int i = 0 ; i < classes.length; i++ ){
-           try{
-               ClassLink[] classLinks = rdfsa.getNextClass(null, classes[i].getClassURI(), limit, true);
-               for (int j = 0 ; j < classLinks.length; j++){
-                   Integer n = labelednodes.get(classLinks[j].getLinkedClassURI());
-                   if ( n != null ){
-                       addEdge(i, n, classLinks[j]);
-                   }else{
-                       n = labelednodes.get(classLinks[j].getLinkedLiteralDatatypeURI());
-                       if ( n == null ){
+    private void setClassGraph(RDFSchemaAnalyzer rdfsa){
+        // setNodes
+        SClass[] classes = null;
+        try{
+            classes = rdfsa.getOWLClasses(null, null, null, true);
+        }catch(Exception e){
+            System.err.println(e); return;
+        }
+        for (int i = 0 ; i < classes.length; i++){
+            addNode(classes[i].getClassURI());
+            nodeType.add("class");
+        }
+        // setEdges
+        for (int i = 0 ; i < classes.length; i++ ){
+            try{
+                ClassLink[] classLinks = rdfsa.getNextClass(null, classes[i].getClassURI(), limit, true);
+                for (int j = 0 ; j < classLinks.length; j++){
+                    Integer n = labelednodes.get(classLinks[j].getLinkedClassURI());
+                    if ( n != null ){
+                        addEdge(i, n, classLinks[j]);
+                    }else{
+                        n = labelednodes.get(classLinks[j].getLinkedLiteralDatatypeURI());
+                        if ( n == null ){
                            addNode(classLinks[j].getLinkedLiteralDatatypeURI());
                            n = nodeType.size();
                            nodeType.add("literal");
-                       }
-                       addEdge(i, n, classLinks[j]);
-                   }
-               }
-           }catch(Exception e){
-               System.err.println(e);
-           }
-       }       
-   }*/
+                        }
+                        addEdge(i, n, classLinks[j]);
+                    }
+                }
+            }catch(Exception e){
+                System.err.println(e);
+            }
+        }       
+    }
 
     public void setPartClassGraph(RDFSchemaAnalyzer rdfsa, String sparqlEndpoint, String startClass){
@@ -332 +336 @@
             visited.addAll(nodes);
         }
-        // cut visited 
+        // cut visited         
         Iterator<Integer> nit = visited.iterator();
         while(nit.hasNext()){
@@ -405 +409 @@
    }
    
+   private boolean checkPath(String startClass, List<ClassLink> paths){
+       // KOKO
+       return false;
+   }
    // old codes
    /*