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.
|
Modifier and Type | Method and Description |
---|---|
static void |
mxTraversal.bfs(mxGraph graph,
java.lang.Object cell,
mxGraph.mxICellVisitor visitor,
java.util.Map<java.lang.String,java.lang.Object> properties) |
static void |
mxTraversal.dfs(mxGraph graph,
java.lang.Object cell,
java.lang.Object edge,
java.util.Set<java.lang.Object> seen,
mxGraph.mxICellVisitor visitor,
java.util.Map<java.lang.String,java.lang.Object> properties)
Implements a recursive depth first search starting from the specified
cell.
|
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.