package edu.princeton.cs.algs4;
import edu.princeton.cs.algs4.ch42.Digraph;
import edu.princeton.cs.algs4.ch42.DirectedDFS;
import edu.princeton.cs.introcs.*;
/*************************************************************************
* Compilation: javac TransitiveClosure.java
* Execution: java TransitiveClosure filename.txt
* Dependencies: Digraph.java DepthFirstDirectedPaths.java In.java StdOut.java
* Data files: http://algs4.cs.princeton.edu/42directed/tinyDG.txt
*
* Compute transitive closure of a digraph and support
* reachability queries.
*
* Preprocessing time: O(V(E + V)) time.
* Query time: O(1).
* Space: O(V^2).
*
* % java TransitiveClosure tinyDG.txt
* 0 1 2 3 4 5 6 7 8 9 10 11 12
* --------------------------------------------
* 0: T T T T T T
* 1: T
* 2: T T T T T T
* 3: T T T T T T
* 4: T T T T T T
* 5: T T T T T T
* 6: T T T T T T T T T T T
* 7: T T T T T T T T T T T T T
* 8: T T T T T T T T T T T T T
* 9: T T T T T T T T T T
* 10: T T T T T T T T T T
* 11: T T T T T T T T T T
* 12: T T T T T T T T T T
*
*************************************************************************/
/**
* The <tt>TransitiveClosure</tt> class represents a data type for
* computing the transitive closure of a digraph.
* <p>
* This implementation runs depth-first search from each vertex.
* The constructor takes time proportional to <em>V</em>(<em>V</em> + <em>E</em>)
* (in the worst case) and uses space proportional to <em>V</em><sup>2</sup>,
* where <em>V</em> is the number of vertices and <em>E</em> is the number of edges.
* <p>
* For additional documentation, see <a href="/algs4/42digraph">Section 4.2</a> of
* <i>Algorithms, 4th Edition</i> by Robert Sedgewick and Kevin Wayne.
*
* @author Robert Sedgewick
* @author Kevin Wayne
*/
public class TransitiveClosure {
private DirectedDFS[] tc; // tc[v] = reachable from v
/**
* Computes the transitive closure of the digraph <tt>G</tt>.
* @param G the digraph
*/
public TransitiveClosure(Digraph G) {
tc = new DirectedDFS[G.V()];
for (int v = 0; v < G.V(); v++)
tc[v] = new DirectedDFS(G, v);
}
/**
* Is there a directed path from vertex <tt>v</tt> to vertex <tt>w</tt> in the digraph?
* @param v the source vertex
* @param w the target vertex
* @return <tt>true</tt> if there is a directed path from <tt>v</tt> to <tt>w</tt>,
* <tt>false</tt> otherwise
*/
public boolean reachable(int v, int w) {
return tc[v].marked(w);
}
/**
* Unit tests the <tt>TransitiveClosure</tt> data type.
*/
public static void main(String[] args) {
In in = new In(args[0]);
Digraph G = new Digraph(in);
TransitiveClosure tc = new TransitiveClosure(G);
// print header
StdOut.print(" ");
for (int v = 0; v < G.V(); v++)
StdOut.printf("%3d", v);
StdOut.println();
StdOut.println("--------------------------------------------");
// print transitive closure
for (int v = 0; v < G.V(); v++) {
StdOut.printf("%3d: ", v);
for (int w = 0; w < G.V(); w++) {
if (tc.reachable(v, w)) StdOut.printf(" T");
else StdOut.printf(" ");
}
StdOut.println();
}
}
}
/*************************************************************************
* Copyright 2002-2012, Robert Sedgewick and Kevin Wayne.
*
* This file is part of algs4-package.jar, which accompanies the textbook
*
* Algorithms, 4th edition by Robert Sedgewick and Kevin Wayne,
* Addison-Wesley Professional, 2011, ISBN 0-321-57351-X.
* http://algs4.cs.princeton.edu
*
*
* algs4-package.jar is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* algs4-package.jar is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
* You should have received a copy of the GNU General Public License
* along with algs4-package.jar. If not, see http://www.gnu.org/licenses.
*************************************************************************/