X 0'x0'__text__TEXTx)__data__DATA.>__cstring__TEXT__compact_unwind__LD0!#0__eh_frame__TEXT#`H& h2  1E5 P-UHH=H5HH uHH=H]ÐUH]fDUHSPHH=H5HH uHH=H5^HHt H tH[]H=H[]fUHSH(HuH#HE؋FEHEHEH}Ѓu;Hut=H]H=Ht/HHcHu'1H([]ûHuHH([]UHAWAVSH(HuHyHEDvDuHG]ԉ]؅y HHtwL(HEMtKA)AuFHuH}t1}LutNH=LtfLHt?1CH}1,HE1 ILLPHuHcH([A^A_]ûHuUHAVSH0HuHdHEЋFEHEuGH5H}HU}t@HHtCHH5HPE1LEHu+H}Ⱦ1H0[A^]E1HuLUHAVSH HuH HEDvDuHG]]yHHH(HD9u3HPxHt9HHH5:HPE1LEHucH}111RE1HuCLHt6HHt)HHH1Q@H߾1HH [A^]UHAWAVSH(HuHcHED~D}HG]܉]y HHt#H(HtD9uAEtHt+12H}111!HLcHuLHHH([A^A_]f.DUHAVSH HuH"HEDvDuHG]]y HHt$H(HtD9uEt&HHt+12H}111!HHHuHHHH [A^]fUHAWAVSH(HuHHED~D}HG]ԉ]؅y HHt]Lw(MtTA)Au8HuH}t:HuIL`HHuHH}1H([A^A_]f.fUHAWAVSH8HuHHED~D}HG]̉]Ѕy HHtnLw(MteA)AuIHuH}tKHuH}t:HuHULHHuHH}1H8[A^A_]f.UHAWAVSH8HuHOHED~D}HG]̉]Ѕy HHtyLw(MtpA)AuTHuH}tVH5H}HU}tH5EH}HU}t7HHHu"HH([]H}о1H([]HD9'015*7X`GP+#! ! vtkTreevtkCommonDataModelPython.vtkTreevtkTree - A rooted tree data structure. Superclass: vtkDirectedAcyclicGraph vtkTree is a connected directed graph with no cycles. A tree is a type of directed graph, so works with all graph algorithms. vtkTree 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 vtkTree. This method will return false if the graph is an invalid tree. vtkTree 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 IsTypeOfV.IsTypeOf(string) -> 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. IsAV.IsA(string) -> 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. SafeDownCastV.SafeDownCast(vtkObjectBase) -> vtkTree C++: static vtkTree *SafeDownCast(vtkObjectBase *o) NewInstanceV.NewInstance() -> vtkTree C++: vtkTree *NewInstance() GetDataObjectTypeV.GetDataObjectType() -> int C++: int GetDataObjectType() override; Return what type of dataset this is. GetRootV.GetRoot() -> int C++: virtual vtkIdType GetRoot() Get the root vertex of the tree. GetNumberOfChildrenV.GetNumberOfChildren(int) -> int C++: vtkIdType GetNumberOfChildren(vtkIdType v) Get the number of children of a vertex. GetChildV.GetChild(int, int) -> int C++: vtkIdType GetChild(vtkIdType v, vtkIdType i) Get the i-th child of a parent vertex. GetChildrenV.GetChildren(int, vtkAdjacentVertexIterator) C++: void GetChildren(vtkIdType v, vtkAdjacentVertexIterator *it) Get the child vertices of a vertex. This is a convenience method that functions exactly like GetAdjacentVertices. GetParentV.GetParent(int) -> int C++: vtkIdType GetParent(vtkIdType v) Get the parent of a vertex. GetParentEdgeV.GetParentEdge(int) -> vtkEdgeType C++: vtkEdgeType GetParentEdge(vtkIdType v) Get the edge connecting the vertex to its parent. GetLevelV.GetLevel(int) -> int C++: vtkIdType GetLevel(vtkIdType v) Get the level of the vertex in the tree. The root vertex has level 0. Returns -1 if the vertex id is < 0 or greater than the number of vertices in the tree. IsLeafV.IsLeaf(int) -> bool C++: bool IsLeaf(vtkIdType vertex) Return whether the vertex is a leaf (i.e. it has no children). GetDataV.GetData(vtkInformation) -> vtkTree C++: static vtkTree *GetData(vtkInformation *info) V.GetData(vtkInformationVector, int) -> vtkTree C++: static vtkTree *GetData(vtkInformationVector *v, int i=0) Retrieve a graph from an information vector. ReorderChildrenV.ReorderChildren(int, vtkIdTypeArray) C++: virtual void ReorderChildren(vtkIdType parent, vtkIdTypeArray *children) Reorder the children of a parent vertex. The children array must contain all the children of parent, just in a different order. This does not change the topology of the tree. vtkDirectedAcyclicGraphvtkDirectedGraphvtkGraphvtkDataObjectvtkObjectvtkObjectBasevtkAdjacentVertexIteratorvtkEdgeTypeV *vtkInformationV|i *vtkInformationVectorvtkInformationvtkInformationVectorvtkIdTypeArrayOP ` a!`!`a !aa`a0aa aP a @@ a0   zRx $OAC $D8 AC $l AC B$AC E$ AC I$AC G$ AC G$4XAC I$\AC G$xAC I$AC I$AC I$`AC I$$AC I$LAC I$tAC I$@AC $AC I$pAC B$AC E$<pAC E 3- 9- - ?- 4-  q 9-T -L @-; 7- 4-  3-  1- D- } D-u j D-b W D-O D D-< $ 0= - 3- - <- 4-  8-~ 5-T 8 2-3 , :-&  - 3- - - >- 8- 5-d ? 3-* - - B- 8- 5-  3-s --j ^ -Y ;-E 8- 5-3---C-8-n5-D3-0=-4-8-5-tD3-/-"-A-8-8-5-s3-^-Q-58-5---3--\5-2--3--5-tL*-/&-#$-9--3--5-rS9-F-33--4---|-Y3-=-6-*D-" 6-5---m3-W-O-CD-;,6-/-- -.-"-zslV=-IB -=6/.-'!"-xh`XH@8(     xh `XH@8( @8(',#+X)0%!`@ `@ `@ CP|8`` C``0s P   @  `0 <'m((~{q2fR8fFEY^F@y>_PyType_Ready__ZN7vtkTree15ReorderChildrenExP14vtkIdTypeArray__ZN7vtkTree8GetChildExx__ZN13vtkPythonArgs8GetValueERx__ZN7vtkTree9GetParentEx__ZN7vtkTree8GetLevelEx__ZN7vtkTree6IsLeafEx__ZN7vtkTree13GetParentEdgeEx_PyVTKSpecialObject_CopyNew_PyvtkDirectedAcyclicGraph_ClassNew_PyvtkTree_ClassNew_PyVTKObject_New__ZL19PyvtkTree_StaticNewv__ZN7vtkTree3NewEv_PyVTKObject_GetSet__Py_NoneStruct_PyVTKObject_GetObject__ZL17PyvtkTree_Methods__ZL25PyvtkTree_GetData_Methods_PyObject_GenericSetAttr_PyObject_GenericGetAttr_PyVTKObject_Repr_PyVTKObject_AsBuffer_strcmp__ZN7vtkTree7GetDataEP14vtkInformation_PyObject_GC_Del_PyVTKObject_Check__ZN7vtkTree7GetDataEP20vtkInformationVectori__ZN13vtkPythonArgs13ArgCountErrorEii__ZN13vtkPythonArgs8GetValueERi_PyBool_FromLong_PyLong_FromLong_PyLong_FromLongLong_PyDict_SetItemString_PyVTKObject_String_PyVTKObject_SetFlag_PyVTKObject_Delete_PyVTKObject_Traverse__ZN13vtkPythonUtil20GetObjectFromPointerEP13vtkObjectBase_PyType_Type__ZL14PyvtkTree_Type_PyVTKAddFile_vtkTree_PyErr_Occurred_PyVTKClass_Add__Py_Dealloc__ZN13vtkPythonArgs8GetValueERPc__ZN13vtkPythonArgs13ArgCountErrorEiPKc__ZN23vtkDirectedAcyclicGraph8IsTypeOfEPKc__ZN13vtkObjectBase8IsTypeOfEPKc__ZN13vtkPythonArgs17GetArgAsVTKObjectEPKcRb__ZN17vtkPythonOverload10CallMethodEP11PyMethodDefP7_objectS3___ZN13vtkPythonArgs19GetSelfFromFirstArgEP7_objectS1___ZL22PyvtkTree_SafeDownCastP7_objectS0___ZL17PyvtkTree_GetRootP7_objectS0___ZL19PyvtkTree_GetParentP7_objectS0___ZL21PyvtkTree_GetChildrenP7_objectS0___ZL25PyvtkTree_ReorderChildrenP7_objectS0___ZL29PyvtkTree_GetNumberOfChildrenP7_objectS0___ZL18PyvtkTree_GetLevelP7_objectS0___ZL16PyvtkTree_IsLeafP7_objectS0___ZL18PyvtkTree_IsTypeOfP7_objectS0___ZL27PyvtkTree_GetDataObjectTypeP7_objectS0___ZL23PyvtkTree_GetParentEdgeP7_objectS0___ZL21PyvtkTree_NewInstanceP7_objectS0___ZL18PyvtkTree_GetChildP7_objectS0___ZL17PyvtkTree_GetDataP7_objectS0___ZL13PyvtkTree_IsAP7_objectS0___ZL20PyvtkTree_GetData_s2P7_objectS0___ZL20PyvtkTree_GetData_s1P7_objectS0_