src/main/java/com/mxgraph/analysis/mxTraversal.java
public static void bfs(mxAnalysisGraph aGraph, Object startVertex, mxICellVisitor visitor)
	{
		if (aGraph != null && startVertex != null && visitor != null)
		{
			Set<Object> queued = new HashSet<Object>();
			LinkedList<Object[]> queue = new LinkedList<Object[]>();
			Object[] q = { startVertex, null };
			queue.addLast(q);
			queued.add(startVertex);

			bfsRec(aGraph, queued, queue, visitor);
		}
	}
/**
	 * Implements a recursive breadth first search starting from the specified
	 * cell. Process on the cell is performing by the visitor class passed in.
	 * The visitor has access to the current cell and the edge traversed to
	 * find this cell. Every cell is processed once only.
	 * <pre>
	 * mxTraversal.bfs(analysisGraph, startVertex, new mxICellVisitor()
	 * {
	 * 	public boolean visit(Object vertex, Object edge)
	 * 	{
	 * 		// perform your processing on each cell here
	 *		return false;
	 *	}
	 * });
	 * </pre>
	 * @param aGraph the graph 
	 * @param startVertex
	 * @param visitor
	 */
Implements a recursive breadth first search starting from the specified
cell. Process on the cell is performing by the visitor class passed in.
The visitor has access to the current cell and the edge traversed to
find this cell. Every cell is processed once only.

mxTraversal.bfs(analysisGraph, startVertex, new mxICellVisitor()
{
public boolean visit(Object vertex, Object edge)
{
perform your processing on each cell here
return false;
}
});

@param aGraph the graph
@param startVertex
@param visitor
Implements a recursive breadth first search starting from the specified cell . Process on the cell is performing by the visitor class passed in . The visitor has access to the current cell and the edge traversed to find this cell . Every cell is processed once only . mxTraversal . bfs ( analysisGraph startVertex new mxICellVisitor () { public boolean visit ( Object vertex Object edge ) { perform your processing on each cell here return false ; } } ) ; @param aGraph the graph @param startVertex @param visitor
public static void bfs(mxAnalysisGraph aGraph, Object startVertex, mxICellVisitor visitor)
	{
		if (aGraph != null && startVertex != null && visitor != null)
		{
			Set<Object> queued = new HashSet<Object>();
			LinkedList<Object[]> queue = new LinkedList<Object[]>();
			Object[] q = { startVertex, null };
			queue.addLast(q);
			queued.add(startVertex);
			bfsRec(aGraph, queued, queue, visitor);
		}
	}
public static void bfs ( mxAnalysisGraph aGraph , Object startVertex , mxICellVisitor visitor ) { if ( aGraph != null && startVertex != null && visitor != null ) { Set < Object > queued = new HashSet < Object > ( ) ; LinkedList < Object [ ] > queue = new LinkedList < Object [ ] > ( ) ; Object [ ] q = { startVertex , null } ; queue . addLast ( q ) ; queued . add ( startVertex ) ; bfsRec ( aGraph , queued , queue , visitor ) ; } }
Implements a recursive breadth first search starting from the specified
 cell.
Implements a recursive breadth first search starting from the specified cell .