[2] | 1 | /* |
---|
| 2 | * To change this template, choose Tools | Templates |
---|
| 3 | * and open the template in the editor. |
---|
| 4 | */ |
---|
| 5 | package org.biohackathon.SPARQLBuilder.OWL; |
---|
| 6 | |
---|
| 7 | /** |
---|
| 8 | * |
---|
| 9 | * @author atsuko |
---|
| 10 | */ |
---|
| 11 | import java.util.*; |
---|
| 12 | |
---|
| 13 | public class OWLClassGraph extends LabeledMultiDigraph{ |
---|
| 14 | String startClass; |
---|
| 15 | String endClass; |
---|
| 16 | int nsteps; |
---|
| 17 | int limit; |
---|
[34] | 18 | int th; |
---|
[2] | 19 | |
---|
| 20 | public class LinkAndPath{ |
---|
| 21 | ClassLink classLink; |
---|
| 22 | List<ClassLink> path; |
---|
| 23 | public LinkAndPath(ClassLink classLink, List<ClassLink> path){ |
---|
| 24 | this.classLink = classLink; |
---|
| 25 | this.path = path; |
---|
| 26 | } |
---|
| 27 | } |
---|
| 28 | |
---|
[3] | 29 | public OWLClassGraph(String startClass, String endClass){ |
---|
[2] | 30 | super(); |
---|
[3] | 31 | this.startClass = startClass; |
---|
| 32 | addNode(startClass); |
---|
| 33 | this.endClass = endClass; |
---|
| 34 | addNode(endClass); |
---|
| 35 | nsteps = 2; |
---|
| 36 | limit = 1000; |
---|
[34] | 37 | th = 0; |
---|
[2] | 38 | } |
---|
| 39 | |
---|
[3] | 40 | public void generateGraph(List<List<ClassLink>> paths){ |
---|
[15] | 41 | ListIterator<List<ClassLink>> pit = paths.listIterator(); |
---|
| 42 | while( pit.hasNext() ){ |
---|
[21] | 43 | List<ClassLink> cls = pit.next(); |
---|
| 44 | String start = startClass; |
---|
| 45 | ListIterator<ClassLink> cit = cls.listIterator(); |
---|
| 46 | while ( cit.hasNext() ){ |
---|
| 47 | // KOKO |
---|
| 48 | } |
---|
[15] | 49 | } |
---|
[2] | 50 | } |
---|
| 51 | |
---|
[29] | 52 | public Path[] getPaths(OWLQueryBuilderImpl qb, int mode, boolean countLink){ |
---|
| 53 | List<List<ClassLink>> paths = searchPaths(qb, mode, countLink); |
---|
[2] | 54 | Path[] patharray = new Path[paths.size()]; |
---|
| 55 | ListIterator<List<ClassLink>> pit = paths.listIterator(); |
---|
| 56 | int i = 0; |
---|
| 57 | while ( pit.hasNext() ){ |
---|
[3] | 58 | patharray[i] = new Path(); |
---|
[2] | 59 | patharray[i].setStartClass(startClass); |
---|
| 60 | List<ClassLink> path = pit.next(); |
---|
| 61 | patharray[i].setClassLinks(path); |
---|
[8] | 62 | ListIterator<ClassLink> cit = path.listIterator(); |
---|
| 63 | int min = Integer.MAX_VALUE; |
---|
| 64 | while ( cit.hasNext() ){ |
---|
| 65 | ClassLink cl = cit.next(); |
---|
| 66 | if ( cl.getNumOfLinks() < min ){ |
---|
| 67 | min = cl.getNumOfLinks(); |
---|
| 68 | } |
---|
| 69 | } |
---|
| 70 | patharray[i].setWidth(min); |
---|
[2] | 71 | i++; |
---|
| 72 | } |
---|
| 73 | return patharray; |
---|
| 74 | } |
---|
| 75 | |
---|
[15] | 76 | /* |
---|
[2] | 77 | private List<List<ClassLink>> searchPathsFromOWL(OWLQueryBuilderImpl qb){ |
---|
[3] | 78 | return searchPathsEngine(qb, 0); |
---|
| 79 | } |
---|
| 80 | |
---|
| 81 | private List<List<ClassLink>> searchPathsFromInstances(OWLQueryBuilderImpl qb){ |
---|
| 82 | return searchPathsEngine(qb, 1); |
---|
| 83 | } |
---|
[15] | 84 | */ |
---|
[3] | 85 | |
---|
[32] | 86 | private List<List<ClassLink>> searchPaths(OWLQueryBuilderImpl qb, int mode, boolean countLinks){ |
---|
[15] | 87 | List<List<ClassLink>> paths = new ArrayList<>(); |
---|
[8] | 88 | ClassLink crrLink = new ClassLink(null,startClass,Direction.both,0); |
---|
[15] | 89 | List<LinkAndPath> lp = new LinkedList<>(); |
---|
[2] | 90 | lp.add(new LinkAndPath(crrLink, new LinkedList<ClassLink>())); |
---|
| 91 | try{ |
---|
| 92 | for ( int i = 0; i < nsteps; i++ ){ |
---|
| 93 | ListIterator<LinkAndPath> lit = lp.listIterator(); |
---|
[15] | 94 | List<LinkAndPath> nextlp = new LinkedList<>(); |
---|
[2] | 95 | while ( lit.hasNext() ){ |
---|
| 96 | LinkAndPath crrlp = lit.next(); |
---|
[3] | 97 | ClassLink[] classLinks = null; |
---|
| 98 | // Mode |
---|
| 99 | if ( mode == 0 ){ |
---|
[32] | 100 | classLinks = qb.getNextClass(null, crrlp.classLink.getLinkedClassURI(), limit, countLinks); |
---|
[3] | 101 | }else if ( mode == 1 ){ |
---|
| 102 | classLinks = qb.getNextClassViaInstanceLink(null, crrlp.classLink.getLinkedClassURI(), limit); |
---|
| 103 | }else{ System.err.println("Mode is not correct."); } |
---|
[2] | 104 | for ( int j = 0 ; j < classLinks.length; j++ ){ |
---|
[15] | 105 | List<ClassLink> crrpath = new LinkedList<>(crrlp.path); |
---|
[2] | 106 | crrpath.add(classLinks[j]); |
---|
| 107 | if ( classLinks[j].getLinkedClassURI().equals(endClass) ){ |
---|
[15] | 108 | paths.add(new LinkedList<>(crrpath)); |
---|
[34] | 109 | continue; |
---|
[2] | 110 | } |
---|
[34] | 111 | if ( countLinks == true && classLinks[j].getNumOfLinks() <= th){ |
---|
| 112 | continue; |
---|
| 113 | } |
---|
[2] | 114 | nextlp.add(new LinkAndPath(classLinks[j],crrpath)); |
---|
| 115 | } |
---|
| 116 | } |
---|
[3] | 117 | lp = nextlp; |
---|
[2] | 118 | } |
---|
[15] | 119 | }catch(Exception e){ |
---|
| 120 | System.err.println(e); |
---|
| 121 | } |
---|
[21] | 122 | return paths; |
---|
[2] | 123 | } |
---|
| 124 | } |
---|