|
Adaptagrams
|
Topology representation of an edge. More...
#include <topology_graph.h>

Public Member Functions | |
| Edge (unsigned id, double idealLength, EdgePoints &vs) | |
Public Attributes | |
| unsigned | id |
| id specified by user. Can be used to match to external edge. | |
| double | idealLength |
| the ideal length which the layout should try to obtain for this edge | |
| Segment * | firstSegment |
| Segment * | lastSegment |
Topology representation of an edge.
An edge provides a doubly linked list of segments, each involving a pair of EdgePoints.
|
inline |
Construct an edge from a list of EdgePoint in sequence
References Avoid::Edge::a, and Avoid::Edge::b.
| Segment* topology::Edge::firstSegment |
Head of a doubly-linked list of Segment each involving a pair of EdgePoints
| Segment* topology::Edge::lastSegment |
End of list of Segment
1.8.14