src/io/github/marwlod/word_net/SAP.java
// length of shortest ancestral path between v and w; -1 if no such path
length of shortest ancestral path between v and w; -1 if no such path
length of shortest ancestral path between v and w ; - 1 if no such path
public int length(int v, int w) {
        validateVertex(v);
        validateVertex(w);
        int[] distToV = computeDists(v);
        int[] distToW = computeDists(w);
        return findSapLen(distToV, distToW);
    }
public int length ( int v , int w ) { validateVertex ( v ) ; validateVertex ( w ) ; int [ ] distToV = computeDists ( v ) ; int [ ] distToW = computeDists ( w ) ; return findSapLen ( distToV , distToW ) ; }
length of shortest ancestral path between v and w; -1 if no such path
length of shortest ancestral path between v and w ; - 1 if no such path