All Packages This Package Class Hierarchy Class Search Index
java.lang.Object | +----graphomat.util.LazyDouble | +----graphomat.graph.Edge
Summary |
public class Edge extends graphomat.util.LazyDouble implements java.util.Observer, java.io.Serializable { // Constructors 2 public Edge(); public Edge(Node, Node); // Methods 10 public double getLength(); public Node getn1(); public Node getn2(); public Node otherThan(Node); public void recalculate(); public boolean sameEdge(Edge); public boolean sameEdge(Node, Node); public String toString(); public boolean toucheEdge(Edge); public void update(Observable, Object); }
Data class for the Edges. Every Edge contains two Nodes.
Cross Reference |
Constructors |
· Edge | Summary | Top |
public Edge()
· Edge | Summary | Top |
public Edge(Node n1, Node n2)
Methods |
· getn1 | Summary | Top |
public Node getn1()
Returns first Node.
· getn2 | Summary | Top |
public Node getn2()
Returns second Node.
· update | Summary | Top |
public void update(Observable n, Object arg)
- Implements:
- update in interface Observer
· recalculate | Summary | Top |
public void recalculate()
Lazy Evulation of Edge length.
- Overrides:
- recalculate in class LazyDouble
· toucheEdge | Summary | Top |
public boolean toucheEdge(Edge otherEdge)
Return true is two Edges got one same Node.
· sameEdge | Summary | Top |
public boolean sameEdge(Edge otherEdge)
Return true if both Edges got both the same Node.
· sameEdge | Summary | Top |
public boolean sameEdge(Node n3, Node n4)
Return true if both Edges got both the same Node.
· getLength | Summary | Top |
public double getLength()
Returns distance between the Nodes.
· otherThan | Summary | Top |
public Node otherThan(Node n)
Retruns the other Node than the given one.
· toString | Summary | Top |
public String toString()
- Overrides:
- toString in class Object
All Packages This Package Class Hierarchy Class Search IndexFreshly brewed Java API Documentation automatically generated with polardoc Version 1.0.7