ELF>(;@@!   UH@dH%(HD$81HHt$HD$HFHD$$D$ t0H|$1HT$8dH+%(uhH@]@HT$H|$H5|$HtHt+HH5HPtHuH1Huff.fUH@dH%(HD$81HHt$HD$HFHD$$D$ t0H|$1HT$8dH+%(uFH@]@H|$HT$H5|$HtHHuHff.@ATUHHdH%(HD$81HHt$HD$HFHD$$D$ D$ wcLd$HT$ H5L|$ Ht#D$ 9D$(|Vt$ HHHtU1HT$8dH+%(uMHH]A\H|$f.Ht$ LuDHfSH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=H(HtD$9D$t:H111HT$(dH+%(uZH0[fDHHuӐtHuHcHHH;tЉff.fUSHHdH%(HD$81HHt$HD$HFHD$$D$ HD$t6H|$1HT$8dH+%(HH[]DHt$H|$tHl$H=HtHH=uHuHc@HH=tHH=tHH=tHff.ATUSH@fnFdH%(HD$81HHt$HD$HGfnȉD$(fbfD$ uYHD$Ho(Ht!\$ +\$$tJH|$1HT$8dH+%(H@[]A\HHuːHt$H|$tD$$Ld$u`HELH@H;H=tLH=u-HaHcVf.LLH=tLH=tLH=tLHЉfATH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$uDH(HtD$9D$tIH11E1HD$(dH+%(H0LA\@HHufHHRxH;IMtoI$H5LPtZHuLIHoHbL1HHP@L8fE1H"DIjfATUHHdH%(HD$8HFLd$Ht$HHD$HHT$ LH5D$(HD$ D$ |$ Ht9D$ 9D$(}Ht$ Ltt$ HHHtmD1HT$8dH+%(u`HH]A\fDHD$8dH+%(uBHHHH]H=A\H5HATL%H HH5LuLHLA\ATIUHHt HH5LHtHmtH]A\HH]A\SafeDownCastvtkObjectBasevtkDirectedAcyclicGraphGetDatavtkInformationvtkInformationVectorGetDataObjectTypeIsTypeOfIsANewInstanceV *vtkInformationV|i *vtkInformationVectorvtkDirectedGraphvtkGraphvtkDataObjectvtkObjectUH=Hu]ÐHH=tHH=tHH=tHH=tH]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 vtkCommonDataModelPython.vtkDirectedAcyclicGraphV.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. V.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. V.SafeDownCast(vtkObjectBase) -> vtkDirectedAcyclicGraph C++: static vtkDirectedAcyclicGraph *SafeDownCast( vtkObjectBase *o) V.NewInstance() -> vtkDirectedAcyclicGraph C++: vtkDirectedAcyclicGraph *NewInstance() V.GetDataObjectType() -> int C++: int GetDataObjectType() override; Return what type of dataset this is. V.GetData(vtkInformation) -> vtkDirectedAcyclicGraph C++: static vtkDirectedAcyclicGraph *GetData(vtkInformation *info) V.GetData(vtkInformationVector, int) -> vtkDirectedAcyclicGraph C++: static vtkDirectedAcyclicGraph *GetData( vtkInformationVector *v, int i=0) Retrieve a graph from an information vector. HHHD!!GCC: (Ubuntu 11.4.0-1ubuntu1~22.04) 11.4.0GNUzRx  0 D XEDPa AE |EDPa AE (FAD` ABD ED@ AG uEY B P("EAD`n AAF 0<FAA D`  AABH pgFD@ EE 4/FAD` ABG T GIL MFF0OFDD n ABA DDBb   +c "@opg/`,S    3 ; J _ q    ( z ~" /" dF" u#*Jj|  M.=Yf` O4I\l_ZL35PyvtkDirectedAcyclicGraph_StaticNewv_ZL38PyvtkDirectedAcyclicGraph_SafeDownCastP7_objectS0__ZL36PyvtkDirectedAcyclicGraph_GetData_s1P7_objectS0__ZL36PyvtkDirectedAcyclicGraph_GetData_s2P7_objectS0__ZL43PyvtkDirectedAcyclicGraph_GetDataObjectTypeP7_objectS0__ZL34PyvtkDirectedAcyclicGraph_IsTypeOfP7_objectS0__ZL29PyvtkDirectedAcyclicGraph_IsAP7_objectS0__ZL37PyvtkDirectedAcyclicGraph_NewInstanceP7_objectS0__ZL33PyvtkDirectedAcyclicGraph_GetDataP7_objectS0__ZL41PyvtkDirectedAcyclicGraph_GetData_Methods_ZL30PyvtkDirectedAcyclicGraph_Type_ZL33PyvtkDirectedAcyclicGraph_Methods_GLOBAL__sub_I_vtkDirectedAcyclicGraphPython.cxx.LC0.LC1.LC2.LC3.LC4.LC5.LC6.LC11.LC7.LC8.LC9.LC10.LC12.LC13.LC14.LC15_ZN23vtkDirectedAcyclicGraph17GetDataObjectTypeEv_ZN23vtkDirectedAcyclicGraph3NewEv_ZNK23vtkDirectedAcyclicGraph19NewInstanceInternalEv_ZN13vtkPythonArgs13ArgCountErrorEii_ZN13vtkPythonArgs17GetArgAsVTKObjectEPKcRbPyErr_Occurred_ZN13vtkPythonUtil20GetObjectFromPointerEP13vtkObjectBase__stack_chk_fail_ZN23vtkDirectedAcyclicGraph7GetDataEP14vtkInformation_ZN23vtkDirectedAcyclicGraph7GetDataEP20vtkInformationVectori_ZN13vtkPythonArgs8GetValueERi_ZN13vtkPythonArgs19GetSelfFromFirstArgEP7_objectS1_PyLong_FromLong_GLOBAL_OFFSET_TABLE__ZN23vtkDirectedAcyclicGraph3IsAEPKcstrcmp_ZN13vtkObjectBase8IsTypeOfEPKc_ZN13vtkPythonArgs8GetValueERPcPyVTKObject_CheckPyVTKObject_GetObjectPyVTKObject_SetFlag_ZN17vtkPythonOverload10CallMethodEP11PyMethodDefP7_objectS3__ZN13vtkPythonArgs13ArgCountErrorEiPKcPyvtkDirectedAcyclicGraph_ClassNewPyVTKClass_AddPyvtkDirectedGraph_ClassNewPyType_ReadyPyVTKAddFile_vtkDirectedAcyclicGraphPyDict_SetItemString_Py_DeallocPyType_TypePyVTKObject_DeletePyVTKObject_ReprPyVTKObject_StringPyObject_GenericGetAttrPyObject_GenericSetAttrPyVTKObject_AsBufferPyVTKObject_TraversePyVTKObject_GetSetPyVTKObject_NewPyObject_GC_Del,`+,-.-/ @+mr,0-./ ,21:-p+2./+A3Z-g4*(/+-9=E7S X7a-n4~!7"7#78/$V+39*67 7-4!#71"67D#I7U8j/%+ 3***5)HW-d.x:;<-/(&7Q,r21-> . / ' . 6 @< D AN S Bo ?~  D)= E)7& +79!>7L"Q7_#d7q8'F80GXHIJKLMN8O@Pqp z(8x@HXp`~hpx_X3 4H\ @tp ` .symtab.strtab.shstrtab.rela.text.data.bss.text._ZN23vtkDirectedAcyclicGraph17GetDataObjectTypeEv.rela.text._ZNK23vtkDirectedAcyclicGraph19NewInstanceInternalEv.rodata.str1.1.rodata._ZN23vtkDirectedAcyclicGraph3IsAEPKc.str1.1.rela.text._ZN23vtkDirectedAcyclicGraph3IsAEPKc.rodata.str1.8.rela.text.startup.rela.init_array.rela.data.rel.rela.data.rel.local.rodata.cst8.comment.note.GNU-stack.note.gnu.property.rela.eh_frame.group@(H *T 6 ` @@) & , 1 n i@`3 2) 2 2 u@x3 2  0+@40C>@4T O@4 c`@ ^@5s0, 0@7h(( !|`9