## Uses of Interface
com.mxgraph.view.mxGraph.mxICellVisitor

- Packages that use mxGraph.mxICellVisitor
  Package | Description
  --- | ---
  com.mxgraph.analysis | This package provides various algorithms for graph analysis, such as shortest path and minimum spanning tree.
  com.mxgraph.view | This package implements the graph component, represented by the mxGraph class.

- - ### Uses of mxGraph.mxICellVisitor in com.mxgraph.analysis

    Methods in com.mxgraph.analysis with parameters of type mxGraph.mxICellVisitor
    Modifier and Type | Method and Description
    --- | ---
    `static void` | mxTraversal.`bfs(mxAnalysisGraph aGraph, java.lang.Object startVertex, mxGraph.mxICellVisitor visitor)` Implements a recursive breadth first search starting from the specified cell.
    `static void` | mxTraversal.`dfs(mxAnalysisGraph aGraph, java.lang.Object startVertex, mxGraph.mxICellVisitor visitor)` Implements a recursive depth first search starting from the specified cell.
    `static void` | mxTraversal.`dijkstra(mxAnalysisGraph aGraph, java.lang.Object startVertex, java.lang.Object endVertex, mxGraph.mxICellVisitor visitor)` Implements the Dijkstra's shortest path from startVertex to endVertex.

  - ### Uses of mxGraph.mxICellVisitor in com.mxgraph.view

    Methods in com.mxgraph.view with parameters of type mxGraph.mxICellVisitor
    Modifier and Type | Method and Description
    --- | ---
    `void` | mxGraph.`traverse(java.lang.Object vertex, boolean directed, mxGraph.mxICellVisitor visitor)` Traverses the tree starting at the given vertex.
    `void` | mxGraph.`traverse(java.lang.Object vertex, boolean directed, mxGraph.mxICellVisitor visitor, java.lang.Object edge, java.util.Set<java.lang.Object> visited)` Traverses the (directed) graph invoking the given function for each visited vertex and edge.

Copyright (c) 2010 Gaudenz Alder. All rights reserved.