Usually a client using a PlanarGraph will subclass Edge to add its own application-specific data and methods.
@version 1.7
Title: Edge
Description: Represents an edge to a vertex
Copyright: Copyright (c) 2007
Company:
@author John Valentino II @version 1.0Positions that are edges. All the functionality is in the InspectableGraph interface.
@author Luca Vismara (lv)
@version JDSL 2.1.1
A graph edge. Includes the from and to nodes, an arbitrary user object, and a weight. Edges can be either directed or undirected.
@author Abe White @since 1.0.0 @nojavadocThe following features are supported:
If working with several {@link GraphView}, note that source and target are always nodes in the main view. To obtain nodes in other views, do:
GraphView view = ...; Node node = node.getNodeData().getNode(view.getViewId());@author Mathieu Bastian
complexity tag.
@since July 12 2007
On creation of an edge, an arbitrary object can be associated with the edge as the weight of the edge. We say that an edge is unweighted if it does not have an assigned weight. It is an error to attempt to access the weight of an unweighted edge.
Self-loop edges (edges whose source and sink nodes are identical) are allowed.
Once an edge is created, its source node and sink node cannot be changed. @author Shuvra S. Bhattacharyya @version $Id: Edge.java,v 1.31 2005/07/08 19:58:59 cxh Exp $ @since Ptolemy II 2.0 @Pt.ProposedRating Red (cxh) @Pt.AcceptedRating Red (cxh) @see ptolemy.graph.Node
Edges contained in a Graph. An Edge represents a 2D path that connects two Nodes, that has the option to have a label.
@see Graph
@see Edge
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |