|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectedu.uci.ics.jung.graph.AbstractGraph<V,E>
edu.uci.ics.jung.graph.AbstractTypedGraph<Linkable,GuiLink>
edu.memphis.ccrg.lida.framework.gui.utils.NodeStructureGuiAdapter
public class NodeStructureGuiAdapter
Utility to convert NodeStructure
to AbstractTypedGraph
for
use with the NodeStructurePanel
Field Summary |
---|
Fields inherited from class edu.uci.ics.jung.graph.AbstractTypedGraph |
---|
edge_type |
Constructor Summary | |
---|---|
NodeStructureGuiAdapter(NodeStructure ns)
Default constructor |
Method Summary | |
---|---|
boolean |
addEdge(GuiLink arg0,
edu.uci.ics.jung.graph.util.Pair<? extends Linkable> arg1,
edu.uci.ics.jung.graph.util.EdgeType arg2)
|
boolean |
addVertex(Linkable arg0)
|
boolean |
containsEdge(GuiLink arg0)
|
boolean |
containsVertex(Linkable arg0)
|
Linkable |
getDest(GuiLink guiLink)
|
int |
getEdgeCount()
|
java.util.Collection<GuiLink> |
getEdges()
|
edu.uci.ics.jung.graph.util.Pair<Linkable> |
getEndpoints(GuiLink arg0)
|
java.util.Collection<GuiLink> |
getIncidentEdges(Linkable arg0)
Returns all edges attached to specified Linkable |
java.util.Collection<GuiLink> |
getInEdges(Linkable arg0)
|
java.util.Collection<Linkable> |
getNeighbors(Linkable arg0)
|
NodeStructure |
getNodeStructure()
|
java.util.Collection<GuiLink> |
getOutEdges(Linkable arg0)
Creates and returns GuiLink s for all Link s in the NodeStructure whose
source is the argument |
java.util.Collection<Linkable> |
getPredecessors(Linkable arg0)
|
Linkable |
getSource(GuiLink arg0)
|
java.util.Collection<Linkable> |
getSuccessors(Linkable arg0)
|
int |
getVertexCount()
|
java.util.Collection<Linkable> |
getVertices()
|
boolean |
isDest(Linkable arg0,
GuiLink arg1)
Returns true if arg0 is a destination of GuiLink arg1 |
boolean |
isSource(Linkable arg0,
GuiLink arg1)
Returns true if arg0 is a source of GuiLink arg1 |
boolean |
removeEdge(GuiLink arg0)
|
boolean |
removeVertex(Linkable arg0)
|
void |
setNodeStructure(NodeStructure nodeStructure)
|
Methods inherited from class edu.uci.ics.jung.graph.AbstractTypedGraph |
---|
getDefaultEdgeType, getEdgeCount, getEdges, getEdgeType, hasEqualEdgeType, validateEdgeType |
Methods inherited from class edu.uci.ics.jung.graph.AbstractGraph |
---|
addEdge, addEdge, addEdge, addEdge, addEdge, degree, findEdge, findEdgeSet, getIncidentCount, getIncidentVertices, getNeighborCount, getOpposite, getPredecessorCount, getSuccessorCount, getValidatedEndpoints, inDegree, isIncident, isNeighbor, isPredecessor, isSuccessor, outDegree, toString |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
Constructor Detail |
---|
public NodeStructureGuiAdapter(NodeStructure ns)
ns
- NodeStructure
to be adapted.Method Detail |
---|
public NodeStructure getNodeStructure()
public void setNodeStructure(NodeStructure nodeStructure)
nodeStructure
- the nodeStructure to setpublic boolean addEdge(GuiLink arg0, edu.uci.ics.jung.graph.util.Pair<? extends Linkable> arg1, edu.uci.ics.jung.graph.util.EdgeType arg2)
addEdge
in class edu.uci.ics.jung.graph.AbstractGraph<Linkable,GuiLink>
public Linkable getDest(GuiLink guiLink)
public Linkable getSource(GuiLink arg0)
public edu.uci.ics.jung.graph.util.Pair<Linkable> getEndpoints(GuiLink arg0)
public java.util.Collection<GuiLink> getInEdges(Linkable arg0)
public java.util.Collection<GuiLink> getOutEdges(Linkable arg0)
GuiLink
s for all Link
s in the NodeStructure
whose
source is the argument
Graph.getOutEdges(java.lang.Object)
public java.util.Collection<Linkable> getPredecessors(Linkable arg0)
public java.util.Collection<Linkable> getSuccessors(Linkable arg0)
public boolean isDest(Linkable arg0, GuiLink arg1)
GuiLink
arg1
Graph.isDest(java.lang.Object,
java.lang.Object)
public boolean isSource(Linkable arg0, GuiLink arg1)
GuiLink
arg1
Graph.isSource(java.lang.Object,
java.lang.Object)
public boolean addVertex(Linkable arg0)
public boolean containsEdge(GuiLink arg0)
public boolean containsVertex(Linkable arg0)
public int getEdgeCount()
public java.util.Collection<GuiLink> getEdges()
public java.util.Collection<GuiLink> getIncidentEdges(Linkable arg0)
Linkable
Hypergraph.getIncidentEdges(java.lang.Object)
public java.util.Collection<Linkable> getNeighbors(Linkable arg0)
public int getVertexCount()
public java.util.Collection<Linkable> getVertices()
public boolean removeEdge(GuiLink arg0)
public boolean removeVertex(Linkable arg0)
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |