# encoding: utf-8 # module vtkmodules.vtkCommonDataModel # from C:\Users\xukai\Downloads\发票2\venv\Lib\site-packages\vtkmodules\vtkCommonDataModel.cp311-win_amd64.pyd # by generator 1.147 # no doc # imports import vtkmodules.vtkCommonCore as __vtkmodules_vtkCommonCore import vtkmodules.vtkCommonMath as __vtkmodules_vtkCommonMath import vtkmodules.vtkCommonTransforms as __vtkmodules_vtkCommonTransforms from .vtkDirectedGraph import vtkDirectedGraph class vtkDirectedAcyclicGraph(vtkDirectedGraph): """ vtkDirectedAcyclicGraph - A rooted tree data structure. Superclass: vtkDirectedGraph vtkDirectedAcyclicGraph is a connected directed graph with no cycles. A tree is a type of directed graph, so works with all graph algorithms. vtkDirectedAcyclicGraph is a read-only data structure. To construct a tree, create an instance of vtkMutableDirectedGraph. Add vertices and edges with AddVertex() and AddEdge(). You may alternately start by adding a single vertex as the root then call graph->AddChild(parent) which adds a new vertex and connects the parent to the child. The tree MUST have all edges in the proper direction, from parent to child. After building the tree, call tree->CheckedShallowCopy(graph) to copy the structure into a vtkDirectedAcyclicGraph. This method will return false if the graph is an invalid tree. vtkDirectedAcyclicGraph provides some convenience methods for obtaining the parent and children of a vertex, for finding the root, and determining if a vertex is a leaf (a vertex with no children). @sa vtkDirectedGraph vtkMutableDirectedGraph vtkGraph """ def GetData(self, info): # real signature unknown; restored from __doc__ """ GetData(info:vtkInformation) -> vtkDirectedAcyclicGraph C++: static vtkDirectedAcyclicGraph *GetData(vtkInformation *info) GetData(v:vtkInformationVector, i:int=0) -> vtkDirectedAcyclicGraph C++: static vtkDirectedAcyclicGraph *GetData( vtkInformationVector *v, int i=0) Retrieve a graph from an information vector. """ return vtkDirectedAcyclicGraph def GetDataObjectType(self): # real signature unknown; restored from __doc__ """ GetDataObjectType(self) -> int C++: int GetDataObjectType() override; Return what type of dataset this is. """ return 0 def GetNumberOfGenerationsFromBase(self, type): # real signature unknown; restored from __doc__ """ GetNumberOfGenerationsFromBase(self, type:str) -> int C++: vtkIdType GetNumberOfGenerationsFromBase(const char *type) override; Given the name of a base class of this class type, return the distance of inheritance between this class type and the named class (how many generations of inheritance are there between this class and the named class). If the named class is not in this class's inheritance tree, return a negative value. Valid responses will always be nonnegative. This method works in combination with vtkTypeMacro found in vtkSetGet.h. """ return 0 def GetNumberOfGenerationsFromBaseType(self, type): # real signature unknown; restored from __doc__ """ GetNumberOfGenerationsFromBaseType(type:str) -> int C++: static vtkIdType GetNumberOfGenerationsFromBaseType( const char *type) Given a the name of a base class of this class type, return the distance of inheritance between this class type and the named class (how many generations of inheritance are there between this class and the named class). If the named class is not in this class's inheritance tree, return a negative value. Valid responses will always be nonnegative. This method works in combination with vtkTypeMacro found in vtkSetGet.h. """ return 0 def IsA(self, type): # real signature unknown; restored from __doc__ """ IsA(self, type:str) -> int C++: vtkTypeBool IsA(const char *type) override; Return 1 if this class is the same type of (or a subclass of) the named class. Returns 0 otherwise. This method works in combination with vtkTypeMacro found in vtkSetGet.h. """ return 0 def IsTypeOf(self, type): # real signature unknown; restored from __doc__ """ IsTypeOf(type:str) -> int C++: static vtkTypeBool IsTypeOf(const char *type) Return 1 if this class type is the same type of (or a subclass of) the named class. Returns 0 otherwise. This method works in combination with vtkTypeMacro found in vtkSetGet.h. """ return 0 def NewInstance(self): # real signature unknown; restored from __doc__ """ NewInstance(self) -> vtkDirectedAcyclicGraph C++: vtkDirectedAcyclicGraph *NewInstance() """ return vtkDirectedAcyclicGraph def SafeDownCast(self, o): # real signature unknown; restored from __doc__ """ SafeDownCast(o:vtkObjectBase) -> vtkDirectedAcyclicGraph C++: static vtkDirectedAcyclicGraph *SafeDownCast( vtkObjectBase *o) """ return vtkDirectedAcyclicGraph def __delattr__(self, *args, **kwargs): # real signature unknown """ Implement delattr(self, name). """ pass def __getattribute__(self, *args, **kwargs): # real signature unknown """ Return getattr(self, name). """ pass def __init__(self, *args, **kwargs): # real signature unknown pass @staticmethod # known case of __new__ def __new__(*args, **kwargs): # real signature unknown """ Create and return a new object. See help(type) for accurate signature. """ pass def __repr__(self, *args, **kwargs): # real signature unknown """ Return repr(self). """ pass def __setattr__(self, *args, **kwargs): # real signature unknown """ Implement setattr(self, name, value). """ pass def __str__(self, *args, **kwargs): # real signature unknown """ Return str(self). """ pass __this__ = property(lambda self: object(), lambda self, v: None, lambda self: None) # default """Pointer to the C++ object.""" __dict__ = None # (!) real value is "mappingproxy({'__vtkname__': 'vtkDirectedAcyclicGraph', 'IsTypeOf': , 'IsA': , 'SafeDownCast': , 'NewInstance': , 'GetNumberOfGenerationsFromBaseType': , 'GetNumberOfGenerationsFromBase': , 'GetDataObjectType': , 'GetData': , '__new__': , '__repr__': , '__str__': , '__getattribute__': , '__setattr__': , '__delattr__': , '__dict__': , '__this__': , '__doc__': 'vtkDirectedAcyclicGraph - A rooted tree data structure.\\n\\nSuperclass: vtkDirectedGraph\\n\\nvtkDirectedAcyclicGraph is a connected directed graph with no cycles.\\nA tree is a type of directed graph, so works with all graph\\nalgorithms.\\n\\nvtkDirectedAcyclicGraph is a read-only data structure. To construct a\\ntree, create an instance of vtkMutableDirectedGraph. Add vertices and\\nedges with AddVertex() and AddEdge(). You may alternately start by\\nadding a single vertex as the root then call graph->AddChild(parent)\\nwhich adds a new vertex and connects the parent to the child. The\\ntree MUST have all edges in the proper direction, from parent to\\nchild. After building the tree, call tree->CheckedShallowCopy(graph)\\nto copy the structure into a vtkDirectedAcyclicGraph. This method\\nwill return false if the graph is an invalid tree.\\n\\nvtkDirectedAcyclicGraph provides some convenience methods for\\nobtaining the parent and children of a vertex, for finding the root,\\nand determining if a vertex is a leaf (a vertex with no children).\\n\\n@sa\\nvtkDirectedGraph vtkMutableDirectedGraph vtkGraph\\n\\n'})" __vtkname__ = 'vtkDirectedAcyclicGraph'