19package denoptim.graph;
An attachment point (AP) is a possibility to attach a Vertex onto the vertex holding the AP (i....
AttachmentPoint getLinkedAP()
Gets the attachment point (AP) that is connected to this AP via the edge user.
APClass getAPClass()
Returns the Attachment Point class.
int getID()
Returns a unique integer that is used to sort list of attachment points.
Edge getEdgeUser()
Gets the edge that is using this AP, or null if no edge is using this AP.
Query for searching AttachmentPoints.
APClass apClass
Query on the APClass of the target attachment point, or null.
Integer apIndex
Query on the index of the target attachment point, or null.
VertexQuery vertexQuery
Query on vertex owning the target attachment point, or null.
AttachmentPointQuery()
Constructor for an empty query.
Long apID
Query on the unique identifier of the target attachment point, or null.
EdgeQuery edgeQuery
Query on the Edge using the target attachment point, or null.
AttachmentPointQuery(Long apID, Integer apIndex, APClass apClass, VertexQuery vertexQuery, EdgeQuery edgeQuery, AttachmentPointQuery linkedAPQuery)
Constructor from individual criteria.
AttachmentPointQuery linkedAPQuery
Query defining the attachment point linked by an edge to the target attachment point,...
boolean matches(AttachmentPoint ap)
Tests whether the given attachment point satisfies all non-null criteria in this query.
This class represents the edge between two vertices.
A query for edges: a list of properties that target edges should possess in order to match this query...
boolean matches(Edge e)
Tests whether the given edge satisfies this query.
A vertex is a data structure that has an identity and holds a list of AttachmentPoints.
Query for searching vertices.
boolean matches(Vertex v)
Tests whether the given vertex satisfies all non-null criteria in this query.