rioko.searchers.breadth

Class UndirectedSearchIterator<V extends Vertex>

java.lang.Object

rioko.searchers.SearchIterator<V>

rioko.searchers.BreadthSearchIterator<V>

rioko.searchers.breadth.UndirectedSearchIterator<V>

Type Parameters:

V - Class of the vertex of the graph.

All Implemented Interfaces:

java.util.Iterator<V>

public class UndirectedSearchIterator<V extends Vertex>
extends BreadthSearchIterator<V>

Breadth Searcher for graphs where every edge is valid to explore. This means that the search ignores the directions of the edges.

Author:

Antonio

Field Summary

Fields inherited from class rioko.searchers.SearchIterator

parentOf

Constructor Summary

Constructors

Constructor and Description
UndirectedSearchIterator(AdjacencyListGraph<V,? extends Edge<V>> graph, V root)
UndirectedSearchIterator(AdjacencyListGraph<V,? extends Edge<V>> graph, V root, boolean searchAll)

Method Summary

Modifier and Type	Method and Description
protected boolean	isValidEdge(Edge<V> edge, V currentVertex) Abstract method to know if an edge is valid to explore in the breadth algorithm.

Methods inherited from class rioko.searchers.BreadthSearchIterator

hasNext, isValidVertex, next, setSearchAll

Methods inherited from class rioko.searchers.SearchIterator

getParent, isFound, remove

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Methods inherited from interface java.util.Iterator

forEachRemaining

Constructor Detail

UndirectedSearchIterator

public UndirectedSearchIterator(AdjacencyListGraph<V,? extends Edge<V>> graph,
                                V root)

UndirectedSearchIterator

public UndirectedSearchIterator(AdjacencyListGraph<V,? extends Edge<V>> graph,
                                V root,
                                boolean searchAll)

Method Detail

isValidEdge

protected boolean isValidEdge(Edge<V> edge,
                              V currentVertex)

Description copied from class: BreadthSearchIterator

Abstract method to know if an edge is valid to explore in the breadth algorithm.

Specified by:

isValidEdge in class BreadthSearchIterator<V extends Vertex>

Parameters:

edge - Edge we want to check.

currentVertex - Vertex where the algorithm is exploring currently.

Returns:

True if the edge should be explore in this step of the algorithm.