summaryrefslogtreecommitdiffstats
path: root/Algorithms/Part-II/1-WordNet/SAP.java
diff options
context:
space:
mode:
authorJérémy Zurcher <jeremy@asynk.ch>2013-11-21 18:18:06 +0100
committerJérémy Zurcher <jeremy@asynk.ch>2013-11-21 18:18:06 +0100
commit4020858e2a7ca3557d6ddfa40ceec0a191ef2605 (patch)
tree7aa6747d6470b24ac384987610f8416a212e1b50 /Algorithms/Part-II/1-WordNet/SAP.java
parentb748bc695362b353af08a9d9019876761500012f (diff)
downloadcoursera-4020858e2a7ca3557d6ddfa40ceec0a191ef2605.zip
coursera-4020858e2a7ca3557d6ddfa40ceec0a191ef2605.tar.gz
Algorithms-II : 1-WordNet: add prototypes and data
Diffstat (limited to 'Algorithms/Part-II/1-WordNet/SAP.java')
-rw-r--r--Algorithms/Part-II/1-WordNet/SAP.java65
1 files changed, 65 insertions, 0 deletions
diff --git a/Algorithms/Part-II/1-WordNet/SAP.java b/Algorithms/Part-II/1-WordNet/SAP.java
new file mode 100644
index 0000000..864b8d0
--- /dev/null
+++ b/Algorithms/Part-II/1-WordNet/SAP.java
@@ -0,0 +1,65 @@
+/* vim: set expandtab tabstop=4 shiftwidth=4 : */
+
+public class SAP
+{
+ // data type use space proportional to E + V
+
+ // all methods take time at most proportional to E + V in the worst case
+
+ // constructor takes a digraph (not necessarily a DAG)
+ public SAP(Digraph G)
+ {
+ }
+
+ // length of shortest ancestral path between v and w
+ // -1 if no such path
+ public int length(int v, int w)
+ {
+ // throws java.lang.IndexOutOfBoundsException if args not in [0 ; G.V()-1]
+
+ return -1;
+ }
+
+ // a common ancestor of v and w that participates in a shortest ancestral path
+ // -1 if no such path
+ public int ancestor(int v, int w)
+ {
+ // throws java.lang.IndexOutOfBoundsException if args not in [0 ; G.V()-1]
+
+ return -1;
+ }
+
+ // length of shortest ancestral path between any vertex in v and any vertex in w
+ // -1 if no such path
+ public int length(Iterable<Integer> v, Iterable<Integer> w)
+ {
+ // throws java.lang.IndexOutOfBoundsException if args not in [0 ; G.V()-1]
+
+ return -1;
+ }
+
+ // a common ancestor that participates in shortest ancestral path
+ // -1 if no such path
+ public int ancestor(Iterable<Integer> v, Iterable<Integer> w)
+ {
+ // throws java.lang.IndexOutOfBoundsException if args not in [0 ; G.V()-1]
+
+ return -1;
+ }
+
+ // for unit testing of this class (such as the one below)
+ public static void main(String[] args)
+ {
+ In in = new In(args[0]);
+ Digraph G = new Digraph(in);
+ SAP sap = new SAP(G);
+ while (!StdIn.isEmpty()) {
+ int v = StdIn.readInt();
+ int w = StdIn.readInt();
+ int length = sap.length(v, w);
+ int ancestor = sap.ancestor(v, w);
+ StdOut.printf("length = %d, ancestor = %d\n", length, ancestor);
+ }
+ }
+}
+