加入 GoJS 交流群
（769862113）This constructs a vertex that does not know about any Node.
Gets or sets the data object in the model that should be associated with this vertex, if any. The value will be non-null if this vertex is virtualized, not represented by a real Node in the Diagram. Each data object should have a 'bounds' property that is a Rect or any JavaScript Object with 'x', 'y', 'width', and 'height' properties that are real numbers, and non-negative numbers for the width and the height. Setting this data property will also set the bounds and focus properties.
This read-only property returns an iterator for all of the edges that go out of this vertex.
This read-only property returns an iterator for all of the vertexes that are connected with edges going out of this vertex.
This read-only property returns an iterator for all of the edges that are connected with this vertex in either direction.
This read-only property returns the total number of edges that are connected with this vertex in either direction.
Gets or sets the relative X position of the "center" point, the focus.
Gets or sets the relative Y position of the "center" point, the focus.
Gets or sets the height of this vertex. This is always the vertical distance reserved for the node.
Gets the LayoutNetwork that owns this vertex. The default value is null. It is set automatically for you in LayoutNetwork.createVertex.
Gets or sets the Node associated with this vertex, if any. The value may be null if this vertex is a "dummy" vertex, not represented by a real Node in the Diagram.
This property setter also sets the bounds and focus properties according to the value of the Node's actualBounds and its Part.locationObject's center point.
This read-only property returns an iterator for all of the edges that come into this vertex.
This read-only property returns an iterator for all of the vertexes that are connected with edges coming into this vertex.
This read-only property returns an iterator for all of the vertexes that are connected in either direction with this vertex.
Gets or sets the width of this vertex. This is always the horizontal distance reserved for the node.
Gets or sets the left point of this vertex.
Gets or sets the top point of this vertex.
Adds a LayoutEdge to the list of successors (the edge will be going out from this vertex). Calling this method does not modify the LayoutEdge.fromVertex of the LayoutEdge.
Adds a LayoutEdge to the list of predecessors (the edge will be coming into this vertex). Calling this method does not modify the LayoutEdge.toVertex of the LayoutEdge.
Moves the Node corresponding to this vertex so that its position is at the current bounds point.
To make the most common cases look right, the Node's Part.locationObject is centered. Thus iconic nodes will have the center of the icon be positioned according to the center of this vertex, ignoring any labels. Please read the Introduction page on Extensions for how to override methods and how to call this base method.
Deletes a LayoutEdge from the list of successors (the edge was going out from this vertex). Calling this method does not modify the LayoutEdge.fromVertex of the LayoutEdge.
Deletes a LayoutEdge from the list of predecessors (the edge was coming into this vertex). Calling this method does not modify the LayoutEdge.toVertex of the LayoutEdge.
This static function is used to compare the Part.text values of the nodes of the argument LayoutVertexes. If the text ends in a number, the values are compared as numbers rather than lexicographically. Naturally this comparison is significantly slower than LayoutVertex.standardComparer.
int -1, 0, or 1, depending on whether the comparison between M and N is less than, equal, or greater than.
This static function is used to compare the Part.text values of the nodes of the argument LayoutVertexes. This just does a simple case-sensitive string comparison. Alternatively you may wish to use LayoutVertex.smartComparer or write your own comparison function.
int -1, 0, or 1, depending on whether the comparison between M and N is less than, equal, or greater than.
（769862113）
A vertex represents a Node in a LayoutNetwork, along with its bounds and focus and collections of LayoutEdges that come into and go out of the vertex. The node property may be null for vertexes that represent "dummy" nodes, when the layout wants to work with a network that is not isomorphic with the collection of Nodes and Links being laid out.
This holds layout-specific data for the node. For each kind of layout that uses a LayoutNetwork there is a subclass of LayoutVertex and a subclass of LayoutEdge:
Modifying a LayoutNetwork or a LayoutVertex or a LayoutEdge does not invalidate the Layout or raise any changed events.