Skip to main content
Version: Next

EdgeSet

class compolyx.EdgeSet(graph, obj=None, parent=None)

Edge Set class.

Attributes

NameDescription
EdgeSet.activeActive status of object
EdgeSet.changedStatus boolean
EdgeSet.display_dataThe edge set mesh plot
EdgeSet.edge_set_typeEdge Set Types. Available options: "By Reference", "By Nodes"
EdgeSet.element_set
EdgeSet.enabledWhether this object is currently enabled or not
EdgeSet.idID of object
EdgeSet.is_closedEdge Set is closed
EdgeSet.is_dict_itemSpecifies whether the object is an item of a dict
EdgeSet.is_list_itemSpecifies whether the object is an item of a list
EdgeSet.limit_angleEdge Set limit angle for creation of edge set by reference
EdgeSet.link_pathRoot path of the current node in the tree for links to this object
EdgeSet.lockedEdge Set is imported and cannot be changed
EdgeSet.meshThe edge set mesh
EdgeSet.nameName of object
EdgeSet.node_labelsNode labels defining the NodeSet (only if type='By Nodes')
EdgeSet.nodesNode indexes/labels of the Edge Set
EdgeSet.originEdge Set origin for createion of edge set by reference
EdgeSet.parentParent object in tree
EdgeSet.root_pathRoot path of the current node in the tree
EdgeSet.statusStatus of the object
EdgeSet.status_changedBoolean flag which is set to true in C++ when up-to-date status of object changes
EdgeSet.uidUID of object
EdgeSet.vertexThrows an error if the object has been removed from the graph.

Methods

NameDescription
EdgeSet.average_normal_direction()
EdgeSet.center()
EdgeSet.find_parent(type)Steps up the tree and returns the first parent with given type
EdgeSet.get_nodes()Return Python list with nodes as objects
EdgeSet.get_short_description()
EdgeSet.obj_exists()Checks if __obj still references the C++ object (i.e. has not been reset to None by self._delete) and exists in the graph
EdgeSet.serialize()Serialize to Python string
EdgeSet.serialize_name_and_id()Helper function to serialize name and ID
EdgeSet.update()
EdgeSet.visit(visitor)Walk through the tree and let the visitor perform an action on every descendant node