91 lines
2.9 KiB
Java
91 lines
2.9 KiB
Java
/*******************************************************************************
|
|
* Copyright (c) 2002 - 2006 IBM Corporation.
|
|
* All rights reserved. This program and the accompanying materials
|
|
* are made available under the terms of the Eclipse Public License v1.0
|
|
* which accompanies this distribution, and is available at
|
|
* http://www.eclipse.org/legal/epl-v10.html
|
|
*
|
|
* Contributors:
|
|
* IBM Corporation - initial API and implementation
|
|
*******************************************************************************/
|
|
package com.ibm.wala.util.graph.traverse;
|
|
|
|
import java.util.Iterator;
|
|
import java.util.Map;
|
|
|
|
import com.ibm.wala.util.collections.HashMapFactory;
|
|
import com.ibm.wala.util.collections.NonNullSingletonIterator;
|
|
import com.ibm.wala.util.graph.Graph;
|
|
|
|
/**
|
|
* This class implements depth-first search over a Graph, return an enumeration of the nodes of the graph in order of increasing
|
|
* discover time. This class follows the outNodes of the graph nodes to define the graph, but this behavior can be changed by
|
|
* overriding the getConnected method.
|
|
*/
|
|
public class SlowDFSDiscoverTimeIterator<T> extends GraphDFSDiscoverTimeIterator<T> {
|
|
public static final long serialVersionUID = 9439217987188L;
|
|
|
|
/**
|
|
* An iterator of child nodes for each node being searched A Map: Node -> Iterator
|
|
*/
|
|
final private Map<T, Iterator<? extends T>> pendingChildren = HashMapFactory.make(25);
|
|
|
|
/**
|
|
* For use with extreme care by subclasses that know what they're doing.
|
|
*/
|
|
protected SlowDFSDiscoverTimeIterator() {
|
|
}
|
|
|
|
/**
|
|
* Construct a depth-first enumerator starting with a particular node in a directed graph.
|
|
*
|
|
* @param G the graph whose nodes to enumerate
|
|
*/
|
|
public SlowDFSDiscoverTimeIterator(Graph<T> G, T N) {
|
|
init(G, new NonNullSingletonIterator<>(N));
|
|
}
|
|
|
|
/**
|
|
* Construct a depth-first enumerator across the (possibly improper) subset of nodes reachable from the nodes in the given
|
|
* enumeration.
|
|
*
|
|
* @param G the graph whose nodes to enumerate
|
|
* @param nodes the set of nodes from which to start searching
|
|
*/
|
|
public SlowDFSDiscoverTimeIterator(Graph<T> G, Iterator<T> nodes) {
|
|
if (nodes == null) {
|
|
throw new IllegalArgumentException("null nodes");
|
|
}
|
|
init(G, nodes);
|
|
}
|
|
|
|
/**
|
|
* Constructor SlowDFSDiscoverTimeIterator.
|
|
*
|
|
* @param G
|
|
* @throws NullPointerException if G is null
|
|
*/
|
|
public SlowDFSDiscoverTimeIterator(Graph<T> G) throws NullPointerException {
|
|
if (G == null) {
|
|
throw new IllegalArgumentException("G is null");
|
|
}
|
|
init(G, G.iterator());
|
|
}
|
|
|
|
@Override
|
|
protected Iterator<? extends T> getPendingChildren(Object n) {
|
|
return pendingChildren.get(n);
|
|
}
|
|
|
|
/**
|
|
* Method setPendingChildren.
|
|
*
|
|
* @param v
|
|
* @param iterator
|
|
*/
|
|
@Override
|
|
protected void setPendingChildren(T v, Iterator<? extends T> iterator) {
|
|
pendingChildren.put(v, iterator);
|
|
}
|
|
}
|