public class GraphUtilL
extends java.lang.Object
Constructor and Description |
---|
GraphUtilL() |
Modifier and Type | Method and Description |
---|---|
static boolean |
areEqual(prefuse.data.Tuple tu1,
prefuse.data.Tuple tu2) |
static prefuse.data.Graph |
copyAndMakeGraph(prefuse.data.Table nodeTable,
prefuse.data.Table edgeTable,
boolean directed) |
static void |
copyColumns(prefuse.data.Tuple source,
prefuse.data.Tuple target) |
static prefuse.data.Graph |
copySparseGraph(prefuse.data.Graph g) |
static prefuse.data.Table |
copySparseTable(prefuse.data.Table t) |
static prefuse.data.Table |
copyTable(prefuse.data.Table t) |
static prefuse.data.Tuple |
copyTuple(prefuse.data.Tuple t) |
static java.lang.String[] |
getColumnNames(prefuse.data.Table t) |
static prefuse.data.Node |
getMaximumDifferenceNode(prefuse.data.Graph graph)
Gets the node with the maximum difference of degree, that is, outdegree
minus indegree.
|
static prefuse.data.Node |
getSink(prefuse.data.Graph graph)
Gets the first node with out degree equals to 0, that is, a sink node.
|
static prefuse.data.Table |
getSorted(prefuse.data.Table t) |
static prefuse.data.Table |
getSortedByColumns(prefuse.data.Table t,
java.lang.String[] columnNames) |
static prefuse.data.Node |
getSource(prefuse.data.Graph graph)
Gets the first node with in degree equals to 0, that is, a source node.
|
static void |
printGraph(prefuse.data.Graph g) |
static void |
printTable(prefuse.data.Table t) |
static prefuse.data.Edge |
reverseEdge(prefuse.data.Graph graph,
prefuse.data.Edge e)
Reverses and edge, that is, changes the source and the target and puts in
the other way around.
|
static prefuse.data.Table |
sortCopyByColumn(prefuse.data.Table t,
java.lang.String sortAttribute,
boolean ascending) |
public static void copyColumns(prefuse.data.Tuple source, prefuse.data.Tuple target)
public static java.lang.String[] getColumnNames(prefuse.data.Table t)
public static prefuse.data.Tuple copyTuple(prefuse.data.Tuple t)
public static prefuse.data.Table copyTable(prefuse.data.Table t)
public static prefuse.data.Table copySparseTable(prefuse.data.Table t)
public static prefuse.data.Graph copySparseGraph(prefuse.data.Graph g)
public static void printTable(prefuse.data.Table t)
public static void printGraph(prefuse.data.Graph g)
public static prefuse.data.Table sortCopyByColumn(prefuse.data.Table t, java.lang.String sortAttribute, boolean ascending)
public static prefuse.data.Graph copyAndMakeGraph(prefuse.data.Table nodeTable, prefuse.data.Table edgeTable, boolean directed)
public static prefuse.data.Table getSorted(prefuse.data.Table t)
public static prefuse.data.Table getSortedByColumns(prefuse.data.Table t, java.lang.String[] columnNames)
public static boolean areEqual(prefuse.data.Tuple tu1, prefuse.data.Tuple tu2)
public static prefuse.data.Node getSink(prefuse.data.Graph graph)
public static prefuse.data.Node getSource(prefuse.data.Graph graph)
public static prefuse.data.Node getMaximumDifferenceNode(prefuse.data.Graph graph)
public static prefuse.data.Edge reverseEdge(prefuse.data.Graph graph, prefuse.data.Edge e)
e
- Edge to reverse