ReverseDepthFirstSearch


1   /*
2    * Generic graph library
3    * Copyright (C) 2000,2003,2004 University of Maryland
4    * 
5    * This library is free software; you can redistribute it and/or
6    * modify it under the terms of the GNU Lesser General Public
7    * License as published by the Free Software Foundation; either
8    * version 2.1 of the License, or (at your option) any later version.
9    * 
10   * This library is distributed in the hope that it will be useful,
11   * but WITHOUT ANY WARRANTY; without even the implied warranty of
12   * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
13   * Lesser General Public License for more details.
14   * 
15   * You should have received a copy of the GNU Lesser General Public
16   * License along with this library; if not, write to the Free Software
17   * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
18   */
19  
20  package edu.umd.cs.findbugs.graph;
21  
22  import java.util.Iterator  ;
23  
24  /**
25   * Perform a reverse depth first search of a graph.
26   * (I.e., depth first search of reversed graph.)
27   *
28   * @author David Hovemeyer
29   * @see Graph
30   * @see AbstractDepthFirstSearch
31   */
32  public class ReverseDepthFirstSearch
33          <
34          GraphType extends Graph<EdgeType, VertexType>,
35          EdgeType extends GraphEdge<EdgeType, VertexType>,
36          VertexType extends GraphVertex<VertexType>
37          >
38      extends AbstractDepthFirstSearch<GraphType, EdgeType, VertexType> {
39  
40      /**
41       * Constructor.
42       *
43       * @param graph the graph to perform a reverse depth first search of
44       */
45      public ReverseDepthFirstSearch(GraphType graph) {
46          super(graph);
47      }
48  
49      @Override  
50           protected Iterator  <EdgeType> outgoingEdgeIterator(GraphType graph, VertexType vertex) {
51          return graph.incomingEdgeIterator(vertex);
52      }
53  
54      @Override  
55           protected VertexType getTarget(EdgeType edge) {
56          return edge.getSource();
57      }
58  
59      @Override  
60           protected VertexType getSource(EdgeType edge) {
61          return edge.getTarget();
62      }
63  
64  }
65  
66  // vim:ts=4
67
A to Z: JavaDoc & Examples Daily Java News & Articles Open Source Projects Open Source Codes Free Computer Books Remove Frame
Popular Tags