visitor.visit(resultList.get(i)[0], resultList.get(i)[1]);
visitor.visit(resultList.get(i)[0], resultList.get(i)[1]);
if (visitor.visit(vertex, edge))
if (visitor.visit(vertex, edge))
/** * Core recursive BFS - for internal use * @param aGraph * @param queued * @param queue * @param visitor */ private static void bfsRec(mxAnalysisGraph aGraph, Set<Object> queued, LinkedList<Object[]> queue, mxICellVisitor visitor) { if (queue.size() > 0) { Object[] q = queue.removeFirst(); Object cell = q[0]; Object incomingEdge = q[1]; visitor.visit(cell, incomingEdge); final Object[] edges = aGraph.getEdges(cell, null, false, false); for (int i = 0; i < edges.length; i++) { Object[] currEdge = { edges[i] }; Object opposite = aGraph.getOpposites(currEdge, cell)[0]; if (!queued.contains(opposite)) { Object[] current = { opposite, edges[i] }; queue.addLast(current); queued.add(opposite); } } bfsRec(aGraph, queued, queue, visitor); } };
/** * Core recursive BFS - for internal use * @param aGraph * @param queued * @param queue * @param visitor */ private static void bfsRec(mxAnalysisGraph aGraph, Set<Object> queued, LinkedList<Object[]> queue, mxICellVisitor visitor) { if (queue.size() > 0) { Object[] q = queue.removeFirst(); Object cell = q[0]; Object incomingEdge = q[1]; visitor.visit(cell, incomingEdge); final Object[] edges = aGraph.getEdges(cell, null, false, false); for (int i = 0; i < edges.length; i++) { Object[] currEdge = { edges[i] }; Object opposite = aGraph.getOpposites(currEdge, cell)[0]; if (!queued.contains(opposite)) { Object[] current = { opposite, edges[i] }; queue.addLast(current); queued.add(opposite); } } bfsRec(aGraph, queued, queue, visitor); } };
/** * Core recursive DFS - for internal use * @param aGraph * @param cell * @param edge * @param seen * @param visitor */ private static void dfsRec(mxAnalysisGraph aGraph, Object cell, Object edge, Set<Object> seen, mxICellVisitor visitor) { if (cell != null) { if (!seen.contains(cell)) { visitor.visit(cell, edge); seen.add(cell); final Object[] edges = aGraph.getEdges(cell, null, false, true); final Object[] opposites = aGraph.getOpposites(edges, cell); for (int i = 0; i < opposites.length; i++) { dfsRec(aGraph, opposites[i], edges[i], seen, visitor); } } } }
/** * Core recursive DFS - for internal use * @param aGraph * @param cell * @param edge * @param seen * @param visitor */ private static void dfsRec(mxAnalysisGraph aGraph, Object cell, Object edge, Set<Object> seen, mxICellVisitor visitor) { if (cell != null) { if (!seen.contains(cell)) { visitor.visit(cell, edge); seen.add(cell); final Object[] edges = aGraph.getEdges(cell, null, false, true); final Object[] opposites = aGraph.getOpposites(edges, cell); for (int i = 0; i < opposites.length; i++) { dfsRec(aGraph, opposites[i], edges[i], seen, visitor); } } } }