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

更新日時:

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

更新者:

atsuko

ログメッセージ:

新クローラに対応

ファイル:

• SPARQLBuilderWWW2016/src/java/org/biohackathon/SPARQLBuilder/OWL/LabeledMultiDigraph.java (変更) (3 diff)

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

@@ -13 +13 @@
 
 public class LabeledMultiDigraph {
-    List<List<LabeledEdge>> adjlist;
+    //List<List<LabeledEdge>> adjlist;
+    List<Map<Integer,List<LabeledEdge>>> labelededges;
     List<String> labels;
     HashMap<String,Integer> labelednodes;
-    List<Map<Integer,List<LabeledEdge>>> gadjlist; // grouped adj list: node, node-edge list
+    //List<Map<Integer,List<LabeledEdge>>> gadjlist; // grouped adj list: node, node-edge list
     
     public class LabeledEdge{
-        Integer node;
+        boolean direction;
         Object label;
         
-        public LabeledEdge(Integer node, Object label){
-            this.node = node;
+        public LabeledEdge(boolean dir, Object label){
+            this.direction = dir;
             this.label = label;
         }
@@ -33 +34 @@
     
     public LabeledMultiDigraph(){
-        adjlist = new ArrayList<List<LabeledEdge>>();
+        //adjlist = new ArrayList<List<LabeledEdge>>();
+        labelededges = new ArrayList<Map<Integer,List<LabeledEdge>>>();
         labels = new LinkedList<String>();
         labelednodes = new HashMap<String, Integer>();
-        gadjlist = new ArrayList<Map<Integer,List<LabeledEdge>>>();
+        //gadjlist = new ArrayList<Map<Integer,List<LabeledEdge>>>();
     }
     
@@ -42 +44 @@
         labelednodes.put(label, labels.size());
         labels.add(label);
-        adjlist.add(new LinkedList<LabeledEdge>());
-        gadjlist.add(new HashMap<Integer, List<LabeledEdge>>());
+        //adjlist.add(new LinkedList<LabeledEdge>());
+        //gadjlist.add(new HashMap<Integer, List<LabeledEdge>>());
+        labelededges.add(new HashMap<Integer, List<LabeledEdge>>());
     }
     
-    public void addEdge(Integer node1, Integer node2, Object elabel){
+    public void addEdge(Integer node1, Integer node2, Object elabel){ // node 1 -> node2
         if ( labels.size() < node1 || labels.size() < node2 ){
             System.err.println("Error for Edge Addition: No Node for the Edge");
             return;
         }
-        LabeledEdge edge = new LabeledEdge(node2, elabel);
-        adjlist.get(node1).add(edge);
         
-        Map<Integer, List<LabeledEdge>> edges = gadjlist.get(node1);
-        List<LabeledEdge> sedge = edges.get(node2);
-        if ( sedge == null ){
-            sedge = new LinkedList<LabeledEdge>();
-            edges.put(node2, sedge);
+        //LabeledEdge edge = new LabeledEdge(node2,elabel);
+        //adjlist.get(node1).add(edge);
+        List<LabeledEdge> edgesf = labelededges.get(node1).get(node2);
+        if ( edgesf == null ){
+            edgesf = new LinkedList<LabeledEdge>();
+            labelededges.get(node1).put(node2, edgesf);
         }
-        sedge.add(edge);
+        edgesf.add(new LabeledEdge(true, elabel));
+        
+        List<LabeledEdge> edgesr = labelededges.get(node2).get(node1);
+        if ( edgesr == null ){
+            edgesr = new LinkedList<LabeledEdge>();
+            labelededges.get(node2).put(node1, edgesr);
+        }
+        edgesr.add(new LabeledEdge(false, elabel));
     }
 }