Uses of Class
org.wilmascope.graph.EdgeList

Packages that use EdgeList

org.wilmascope.graph

Uses of EdgeList in org.wilmascope.graph

Methods in org.wilmascope.graph that return EdgeList

EdgeList	Cluster.getAcyclicEdgeSet_EnhancedGreedy() Uses a tricky heuristic (Eades et al.
EdgeList	Cluster.getAcyclicEdgeSet_Greedy() Finds an acyclic subset Ea of this cluster's edges E such that |Ea|>=|E|/2 using a simple greedy heuristic (Berger and Shor, 1990).
EdgeList	Node.getCommonEdges(Node node) return a list of edges common to this node and the argument
EdgeList	NodeList.getEdges()
EdgeList	Node.getEdges()
EdgeList	Node.getInEdges()
EdgeList	Cluster.getInternalEdges() Get the edges internal to this cluster, ie, only those edges connecting a pair of nodes that are both inside this cluster
EdgeList	Node.getOutEdges()

Methods in org.wilmascope.graph with parameters of type EdgeList

void	EdgeList.addAll(EdgeList edgeList)
void	Node.setEdges(EdgeList edges) set the edges by which this node is connected to other nodes copies the values in to preserve external references to the original list
void	EdgeList.setEdges(EdgeList edges)

Constructors in org.wilmascope.graph with parameters of type EdgeList

EdgeList(EdgeList edgeList)