| Package | Description |
|---|---|
| salvo.jesus.graph | |
| salvo.jesus.graph.adaptor | |
| salvo.jesus.graph.algorithm | |
| salvo.jesus.graph.listener | |
| salvo.jesus.graph.visual | |
| salvo.jesus.graph.xml |
| Modifier and Type | Interface and Description |
|---|---|
interface |
BinaryTree
An interface for a binary tree.
|
interface |
CyclePath
An empty interface that denotes a CyclePath.
|
interface |
DirectedAcyclicGraph
The DirectedAcyclicGraph class represents a directed acyclic graph (DAG)
where there is no cyclic paths for any of its vertices.
|
interface |
DirectedGraph
A directed Graph where edges have a specified direction.
|
interface |
Path
An interface that abstracts a path in a graph.
|
interface |
SimplePath
An interface that denotes a Path that is simple.
|
interface |
Tree
The superinterface of all Trees.
|
interface |
WeightedGraph
A interface for a Graph where all edges have a specified weight.
|
| Modifier and Type | Class and Description |
|---|---|
class |
CyclePathImpl
Implementation of CyclePath that ensures that the first
and last vertices in the Path forms a cycle.
|
class |
DirectedAcyclicGraphImpl
The DirectedAcyclicGraph class represents a directed acyclic graph (DAG)
where there is no cyclic paths for any of its vertices.
|
class |
DirectedGraphImpl
A directed Graph where edges have a specified direction.
|
class |
GraphImpl
An implementation of the Graph interface.
|
class |
PathImpl
An implementation of the Path interface that is a non-simple path.
|
class |
SimplePathImpl
Implementation of SimplePath interface guaranteeing that the
path is simple, meaning no Vertex is repeated in the path.
|
class |
TreeImpl
An implementation of a Tree.
|
class |
WeightedGraphImpl
An implementation of the WeightedGraph interface where all
edges in the graph have a weight.
|
| Modifier and Type | Method and Description |
|---|---|
static void |
GraphUtil.addEdge(Graph g,
Edge e)
Add an Edge to a Graph, converting Exceptions into RuntimeExceptions.
|
static void |
GraphUtil.addEdge(Graph g,
Vertex v1,
Vertex v2)
Add an edge to a Graph, converting Exceptions into RuntimeExceptions.
|
static void |
GraphUtil.addVertex(Graph g,
Vertex v)
Add a Vertex to a Graph, converting Exceptions into RuntimeExceptions.
|
static void |
GraphUtil.contractVertices(Graph g,
Vertex vRemain,
Vertex vRemove,
GraphUtil.EdgeContractionRule rule)
Contract two vertices within a graph.
|
static void |
GraphUtil.mergeInto(Graph gDst,
Graph gSrc)
Merge two graphs.
|
static void |
GraphUtil.removeEdge(Graph g,
Edge e)
Remove an Edge from a Graph, converting Exceptions into
RuntimeExceptions.
|
static void |
GraphUtil.removeVertex(Graph g,
Vertex v)
Remove a Vertex from a Graph, converting Exceptions into
RuntimeExceptions.
|
| Modifier and Type | Class and Description |
|---|---|
class |
DirectedAcyclicGraphAdaptor
DirectedAcyclicGraphAdaptor allows an underlying DirectedGraph to be viewed
as a DirectedAcyclicGraph.
|
class |
DirectedGraphDelegator
DirectedGraphDelegator is a utility base for creating adaptors which need to
delegate most of their methods to an underlying DirectedGraph.
|
class |
GraphDelegator
GraphDelegator is a utility base for creating adaptors which need to
delegate most of their methods to an underlying Graph.
|
| Modifier and Type | Method and Description |
|---|---|
protected Graph |
GraphDelegator.getGraph() |
| Constructor and Description |
|---|
GraphDelegator(Graph graph) |
| Modifier and Type | Field and Description |
|---|---|
protected Graph |
CycleDetectionAlgorithm.m_graph |
| Modifier and Type | Method and Description |
|---|---|
static Graph |
EulerCircleFinder.clone(Graph g) |
Graph |
GraphUnionAlgorithm.getGraph() |
Graph |
GraphContractionAlgorithm.getGraph() |
| Modifier and Type | Method and Description |
|---|---|
static Graph |
EulerCircleFinder.clone(Graph g) |
static Path |
EulerCircleFinder.find(Graph g)
Returns a Path wich is a Euler circle in the given graph or
null
if there is no Euler circle in this graph. |
void |
CycleDetectionAlgorithmDFS.findCycleSubgraph(Graph subgraph) |
abstract void |
CycleDetectionAlgorithm.findCycleSubgraph(Graph subgraph)
Find the subgraph of all cycles.
|
void |
CycleDetectionAlgorithmDFS.findCycleSubgraph(Graph subgraph,
Edge e) |
abstract void |
CycleDetectionAlgorithm.findCycleSubgraph(Graph subgraph,
Edge e)
Find the subgraph of all cycles which contain a particular edge.
|
void |
CycleDetectionAlgorithmDFS.findCycleSubgraph(Graph subgraph,
Vertex v) |
abstract void |
CycleDetectionAlgorithm.findCycleSubgraph(Graph subgraph,
Vertex v)
Find the subgraph of all cycles which contain a particular vertex.
|
void |
GraphUnionAlgorithm.union(Graph gSrc)
Merge a graph into the union.
|
| Constructor and Description |
|---|
BreadthFirstTraversal(Graph graph)
Creates a BreadthFirstTraversal object
|
CycleDetectionAlgorithm(Graph graph)
Example constructor for the algorithm.
|
CycleDetectionAlgorithmDFS(Graph graph) |
DepthFirstGraphTraversal(Graph graph)
Creates a DepthFirstGraphTraversal object.
|
GraphContractionAlgorithm(Graph graph) |
GraphTraversal(Graph graph) |
GraphUnionAlgorithm(Graph gResult)
Begin a new union.
|
| Constructor and Description |
|---|
ConnectedSetListener(Graph graph)
Construct a new ConnectedSetListener, building sets based on any
existing graph components.
|
ImmutableGraphListener(Graph graph)
Creates a new ImmutableGraphListener, making the argument immutable
until this Listener is removed
|
| Modifier and Type | Method and Description |
|---|---|
Graph |
VisualGraph.getGraph()
Returns the Graph object that the VisualGraph object encapsulates.
|
Graph |
GraphEditor.getGraph()
Returns the Graph object that is encapsulated in GraphEditor.
|
| Modifier and Type | Method and Description |
|---|---|
void |
VisualGraph.emphasizeSubGraph(Graph subGraph,
VisualVertexPainter vPainter,
VisualEdgePainter ePainter)
Emphasizes a subgraph by changing the painters for the VisualGraphComponents of
the subgraph.
|
void |
VisualGraph.emphasizeSubGraph(Graph subGraph,
VisualVertexPainter mainGraphVPainter,
VisualEdgePainter mainGraphEPainter,
VisualVertexPainter subGraphVPainter,
VisualEdgePainter subGraphEPainter)
Emphasizes a subgraph by changing the both the painters for the VisualGraphComponents of
the subgraph and the painters for the main graph.
|
void |
VisualGraph.setGraph(Graph graph)
Sets the Graph object that the VisualGraph object encapsulates.
|
void |
GraphScrollPane.setGraph(Graph g)
Sets the Graph that is encapsulated within
GraphScrollPane.GraphPanelSizeable.
|
void |
GraphEditor.setGraph(Graph graph)
Sets the new Graph object that is encapsulated by GraphEditor.
|
void |
GraphPanel.setGraph(Graph g,
GraphScrollPane gp)
Sets the Graph that this class encapsulates.
|
| Constructor and Description |
|---|
GraphEditor(Graph graph)
Creates a GraphEditor object with a given Graph
|
GraphEditor(GraphPanelState gps,
Graph g)
Creates a GraphEditor object with a given Graph and a given state,
the GraphPanel property of GraphPanelState will be set.
|
VisualGraph(Graph g) |
| Modifier and Type | Method and Description |
|---|---|
Graph |
XMLToGraphHandler.getGraph() |
Graph |
XGMMLReader.parse() |
| Modifier and Type | Method and Description |
|---|---|
void |
GraphToXMLEventGeneratorImpl.notifyStartSerialize(Graph graph) |
void |
GraphToXMLEventGenerator.notifyStartSerialize(Graph graph) |
void |
GraphToXMLEventGeneratorImpl.serialize(Graph graph)
Serialize the Graph using the specified XMLSerializer
|
void |
GraphToXMLEventGenerator.serialize(Graph graph)
Method to be implemented by subclasses to serialize a Graph
|
void |
GraphToXMLHandler.startSerialize(Graph graph)
Called only once before the serialization process begins.
|
void |
GraphToXGMMLSAXHandler.startSerialize(Graph graph)
Initializes the delegate to be the inner class GraphHandler,
and calls the startSerialize() method of the delegate.
|
void |
GraphToXGMMLDOMHandler.startSerialize(Graph graph)
Initializes the delegate to be the inner class GraphHandler,
and calls the startSerialize() method of the delegate.
|
Copyright © 2019 JULIE Lab, Germany. All rights reserved.