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

更新日時:

2016/03/15 18:40:34 (10 年 前)

更新者:

atsuko

ログメッセージ:

新クローラに対応

ファイル:

• SPARQLBuilderWWW2016/src/java/org/biohackathon/SPARQLBuilder/OWL/OWLClassGraph.java (変更) (11 diff)

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

@@ -17 +17 @@
     List<String> nodeType;
     String sparqlEndpoint;
-    Map<String, Boolean> checkedpaths;
     
-    /*
-    public class LinkAndPath{
-        String originalClassURI; // originalClasssURI -classLink.propertyURI-> classLink.linkedClassURL
-        ClassLink classLink;
-        List<ClassLink> path;
-        Set<String> classURIs; // apearing class URIs in the path
-        
-        
-        public LinkAndPath(ClassLink classLink, List<ClassLink> path){
-           this.classLink = classLink;
-           this.path = path;
-        }
-        
-        public LinkAndPath(ClassLink classLink, List<ClassLink> path, String originalClassURI){
-           this.classLink = classLink;
-           this.path = path;
-           this.originalClassURI = originalClassURI;
-        }
-
-        public LinkAndPath(ClassLink classLink, List<ClassLink> path, String originalClassURI, Set<String> classURIs){
-           this.classLink = classLink;
-           this.path = path;
-           this.originalClassURI = originalClassURI;
-           this.classURIs = classURIs;
-        }
-    }*/
-
     public OWLClassGraph(){ // not used
         super();
@@ -57 +29 @@
     }
     
-    /*
-    public OWLClassGraph(RDFSchemaAnalyzer rdfsa, String sparqlEndpoint, String startClass){ // used
+    public OWLClassGraph(RDFSchemaAnalyzerFactory rdfsaf){ 
         super();
         nodeType = new LinkedList<String>();
-        setPartClassGraph(rdfsa, sparqlEndpoint, startClass);
+        //setClassGraph(rdfsaf);
     }
-    */
-
-    public int getNumberOfEdge(String url){
-        Integer node = labelednodes.get(url);
-        if (node == null){
-            return 0;
-        }
-        return adjlist.get(node).size();
-    }
-        
+    
     public Path[] getPaths(String startClass, String endClass){
         List<List<ClassLink>> paths = searchPaths(startClass, endClass);
@@ -93 +55 @@
             }
             // using length of path
-            //int rankwidth = (int) ( ( min * nsteps )/ crrpath.size() );
             path.setWidth(500000 - crrpath.size()*100000 + min);
             sortedpaths.add(path);
@@ -110 +71 @@
     
     private List<List<ClassLink>> searchPaths(String startClass, String endClass){
-        //int asked = 0;
-        checkedpaths = new HashMap<String, Boolean>();
         List<List<ClassLink>> paths = new ArrayList<>();
         Integer snode = labelednodes.get(startClass);
@@ -118 +77 @@
         
         ListIterator<List<Integer>> pit = simplePaths.listIterator();
-        //System.out.println("SPATH:");
-        //System.out.println(simplePaths.size());
         while( pit.hasNext()){
             List<Integer> spath = pit.next();
@@ -142 +99 @@
                 List<Integer> crrpath = lit.next();
                 Integer crrnode = crrpath.get(crrpath.size()-1);
-                Set<Integer> nexts = gadjlist.get(crrnode).keySet();
+                Set<Integer> nexts = labelededges.get(crrnode).keySet();
                 Iterator<Integer> nit = nexts.iterator();
                 while( nit.hasNext() ){
@@ -157 +114 @@
             }
             lp = nextlp;
-        }        
+        }
         return simplePaths;
     }
@@ -168 +125 @@
         String startClass = this.labels.get(start);
         Integer end = spit.next();
-        List<LabeledEdge> edges = gadjlist.get(start).get(end);
+        List<LabeledEdge> edges = labelededges.get(start).get(end);
         ListIterator<LabeledEdge> eit = edges.listIterator();
         while ( eit.hasNext() ){
@@ -179 +136 @@
             end = spit.next();
             // start-end
-            edges = gadjlist.get(start).get(end);
+            edges = labelededges.get(start).get(end);
             List<List<ClassLink>> tmppaths = new LinkedList<List<ClassLink>>();            
             // current path
@@ -195 +152 @@
             paths = tmppaths;
             start = end;
-        }        
+        }
         return paths;
     }
@@ -233 +190 @@
             }
         }       
-    }
-
-    /*
-    public void setPartClassGraph(RDFSchemaAnalyzer rdfsa, String sparqlEndpoint, String startClass){
-        // set endpoint
-        this.sparqlEndpoint = sparqlEndpoint;
-        visited = new HashSet<Integer>();
-        edgeweight = new LinkedList<Map<Integer,Integer>>();
-        nodeweight = new LinkedList<Integer>();
-        // setNodes for all classes
-        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");
-           edgeweight.add(new HashMap<Integer,Integer>());
-           nodeweight.add(classes[i].getNumOfInstances());
-        }
-        // setEdges
-        Integer snode = labelednodes.get(startClass);
-        Set<Integer> nodes = new HashSet<Integer>();
-        nodes.add(snode);
-        visited.add(snode);
-        for (int i = 0 ; i < nsteps; i++ ){
-            Iterator<Integer> nit = nodes.iterator();
-            Set<Integer> nextnodes = new HashSet<Integer>();
-            while ( nit.hasNext() ){
-                Integer crr = nit.next();
-                try{
-                    ClassLink[] classLinks = rdfsa.getNextClass(null, labels.get(crr), limit, true);
-                    for (int j = 0 ; j < classLinks.length; j++){
-                        Integer nn = labelednodes.get(classLinks[j].getLinkedClassURI());
-                        if ( nn == null ){
-                            continue;
-                        }
-                        if ( !visited.contains(nn) ){
-                            nextnodes.add(nn);
-                        }
-                        addEdge(crr, nn, classLinks[j]);
-                        updateWeight(crr, nn, classLinks[j]);
-                    }
-                }catch(Exception e){
-                    e.printStackTrace();
-                }
-            }
-            nodes = nextnodes;
-            visited.addAll(nodes);
-        }
-        // cut visited
-        Iterator<Integer> nit = visited.iterator();
-        while(nit.hasNext()){
-            Integer node = nit.next();
-            if ( ! node.equals(snode) ){
-                List<List<Integer>> paths = searchSimplePaths(snode, node);
-                if ( paths.isEmpty()){
-                    nit.remove();
-                }
-            }
-        }
-    }       
-    */
-    /*
-    private void updateWeight(Integer node1, Integer node2, ClassLink edge){
-        Map<Integer, Integer> weight = edgeweight.get(node1);
-        Integer crr = weight.get(node2);
-        if (crr == null ){
-            crr = edge.getNumOfLinkedClassInstances();
-            weight.put(node2, crr);           
-        }
-        if ( crr < edge.getNumOfLinkedClassInstances() ){
-            crr = edge.getNumOfLinkedClassInstances();
-            weight.put(node2, crr);
-        }
-        weight = edgeweight.get(node2);
-        crr = weight.get(node1);
-        if (crr == null ){
-            crr = edge.getNumOfOriginClassInstances();
-            weight.put(node1, crr);
-        }
-        if ( crr < edge.getNumOfOriginClassInstances() ){
-            crr = edge.getNumOfOriginInstances();
-            weight.put(node1, crr);
-        }
-    }
-    
-    public List<String> getReachableClasses(){
-        List<String> clURIs = new LinkedList<String>();
-        if ( visited == null ){
-            return null;
-        }
-        Iterator<Integer> vit = visited.iterator();
-        while( vit.hasNext() ){
-            Integer vn = vit.next();
-            clURIs.add(labels.get(vn));
-        }
-        return clURIs;
-    }
-    */
+    }    
 }