Modifier and Type | Method and Description |
---|---|
Graph |
Node.getGraph()
Parent graph.
|
Graph |
GraphFactory.newInstance(String id,
String graphClass)
Instantiate a new graph from the given class name.
|
Modifier and Type | Method and Description |
---|---|
T |
NodeFactory.newInstance(String id,
Graph graph)
Create a new instance of node.
|
Modifier and Type | Class and Description |
---|---|
class |
AbstractGraph
This class provides a basic implementation of
Graph interface, to minimize the effort
required to implement this interface. |
class |
AdjacencyListGraph
A lightweight graph class intended to allow the construction of big graphs
(millions of elements).
|
class |
DefaultGraph
Default implementation of graph.
|
class |
MultiGraph
A graph implementation that supports multiple edges between two nodes.
|
class |
SingleGraph
An implementation of graph that supports only one edge between two nodes.
|
Modifier and Type | Method and Description |
---|---|
static Graph |
Graphs.clone(Graph g)
Clone a given graph with same node/edge structure and same attributes.
|
Graph |
AbstractNode.getGraph()
This implementation returns
AbstractNode.graph . |
static Graph |
Graphs.merge(Graph... graphs)
Merge several graphs in one.
|
static Graph |
Graphs.synchronizedGraph(Graph g)
Synchronizes a graph.
|
static Graph |
Graphs.unmutableGraph(Graph g) |
Modifier and Type | Method and Description |
---|---|
static Graph |
Graphs.clone(Graph g)
Clone a given graph with same node/edge structure and same attributes.
|
static Graph |
Graphs.merge(Graph... graphs)
Merge several graphs in one.
|
static void |
Graphs.mergeIn(Graph result,
Graph... graphs)
Merge several graphs in one.
|
static void |
Graphs.mergeIn(Graph result,
Graph... graphs)
Merge several graphs in one.
|
static Graph |
Graphs.synchronizedGraph(Graph g)
Synchronizes a graph.
|
static Graph |
Graphs.unmutableGraph(Graph g) |
Modifier and Type | Method and Description |
---|---|
Iterator<Graph> |
Timeline.iterator() |
Modifier and Type | Method and Description |
---|---|
void |
Timeline.begin(Graph source) |
void |
GraphReplay.replay(Graph graph)
Echo each element and attribute of the graph to the registered sinks.
|
Modifier and Type | Method and Description |
---|---|
void |
FileSinkSVG2.writeAll(Graph graph,
OutputStream stream) |
void |
FileSinkImages.writeAll(Graph g,
OutputStream stream) |
void |
FileSinkBase.writeAll(Graph graph,
OutputStream stream) |
void |
FileSink.writeAll(Graph graph,
OutputStream stream)
Write the current graph state in one big non-interruptible operation.
|
void |
FileSinkGEXF2.writeAll(Graph graph,
OutputStream stream) |
void |
FileSinkSVG2.writeAll(Graph graph,
String fileName) |
void |
FileSinkImages.writeAll(Graph g,
String filename) |
void |
FileSinkBase.writeAll(Graph graph,
String fileName) |
void |
FileSink.writeAll(Graph graph,
String fileName)
Write the current graph state in one big non-interruptible operation.
|
void |
FileSinkGEXF2.writeAll(Graph graph,
String fileName) |
void |
FileSinkSVG2.writeAll(Graph g,
Writer w) |
void |
FileSinkImages.writeAll(Graph g,
Writer writer) |
void |
FileSinkBase.writeAll(Graph graph,
Writer writer) |
void |
FileSink.writeAll(Graph graph,
Writer writer)
Write the current graph state in one big non-interruptible operation.
|
void |
FileSinkGEXF2.writeAll(Graph graph,
Writer writer) |
Constructor and Description |
---|
ThreadProxyPipeOld(Graph inputGraph)
Deprecated.
Listen at an input graph in a given thread and redirect all events to
GraphListeners that may be in another thread.
|
ThreadProxyPipeOld(Graph inputGraph,
boolean replayGraph)
Deprecated.
Like
#ThreadProxyPipe(Graph) but allow to avoid replaying the
graph. |
ThreadProxyPipeOld(Graph inputGraph,
Sink firstListener,
boolean replayGraph)
Deprecated.
Like
#ThreadProxyPipe(Graph,boolean) but allows to pass an
initial listener, therefore specifying the input and output at once. |
ThreadProxyPipeOld(Graph inputGraph,
Sink firstListener,
boolean replayGraph,
org.miv.mbox.MBox sharedMBox)
Deprecated.
Like
#ThreadProxyPipe(Graph,Sink,boolean) , but allows to share
the message box with another message processor. |
Modifier and Type | Class and Description |
---|---|
class |
GraphicGraph
Graph representation used in display classes.
|
Modifier and Type | Method and Description |
---|---|
Graph |
GraphicNode.getGraph() |
Graph |
StyleGroupSet.getGraph(String id)
Get a graph element knowing its identifier.
|
Modifier and Type | Method and Description |
---|---|
Iterator<? extends Graph> |
StyleGroupSet.getGraphIterator()
Iterator on the set of graphs.
|
Iterable<? extends Graph> |
StyleGroupSet.graphs()
Iterable set of graphs.
|
Modifier and Type | Method and Description |
---|---|
static double |
GraphPosLengthUtils.edgeLength(Graph graph,
String id)
Compute the edge length of the given edge according to its two nodes
positions.
|
StyleGroup |
StyleGroupSet.getStyleFor(Graph graph)
Get the style of a given graph.
|
static Point3 |
GraphPosLengthUtils.nodePointPosition(Graph graph,
String id)
Retrieve a node position from its attributes ("x", "y", "z", or "xy", or
"xyz").
|
static double[] |
GraphPosLengthUtils.nodePosition(Graph graph,
String id)
Retrieve a node position from its attributes ("x", "y", "z", or "xy", or
"xyz").
|
static void |
GraphPosLengthUtils.nodePosition(Graph graph,
String id,
double[] xyz)
Like
GraphPosLengthUtils.nodePosition(Graph,String) , but instead of returning a
newly allocated array, fill up the array given as parameter. |
static void |
GraphPosLengthUtils.nodePosition(Graph graph,
String id,
Point3 pos)
Like
GraphPosLengthUtils.nodePointPosition(Graph,String) , but instead of returning a
newly allocated array, fill up the array given as parameter. |
void |
GraphicNode.setGraph(Graph graph) |
Constructor and Description |
---|
LayoutRunner(Graph graph,
Layout layout,
boolean start,
boolean replay)
New layout runner that listen at the given graph and compute a layout on
its graph structure in a distinct thread.
|
Constructor and Description |
---|
SpriteManager(Graph graph)
Create a new manager for sprite and bind it to the given graph.
|
Constructor and Description |
---|
Viewer(Graph graph,
Viewer.ThreadingModel threadingModel)
New viewer on an existing graph.
|
Modifier and Type | Method and Description |
---|---|
void |
GraphDiff.start(Graph g)
Start to record changes.
|
Constructor and Description |
---|
FilteredEdgeIterator(Graph g,
Filter<Edge> filter) |
FilteredNodeIterator(Graph g,
Filter<Node> filter) |
GraphDiff(Graph g1,
Graph g2)
Create a diff between two graphs.
|
GraphListeners(Graph g) |
Copyright © 2015. All rights reserved.