X DxD__text__TEXTXxpG/__data__DATA`PT__cstring__TEXT !#__compact_unwind__LD;H>S __eh_frame__TEXT?(HB h2  T`Z P##&:UHH=H5H!H uHH=H]ÐUH]fDUHSPHH=H5H H uHH=H5n HHt H tH[]H=H[]fUHSH(HuH!"HE؋FEHEHEH}Ѓu1Hut3H}HuHcH([]þ1H([]UHAWAVSH(HuH"HED~D}HG]ԉ]؅y HHtdLw(HEMt8A)Au3HuH}t}Hut;HHt<1@H}1)HE1ILPHuHcH([A^A_]f.@UHAVSH0HuH"HEЋFEHEuGH5/8H}HU}t@HHtCHH5gHPE1LEHu+H}Ⱦ1H0[A^]E1HuLUHAVSH HuH"HEDvDuHG]]yHHH(HD9u3HPxHt9HHH5HPE1LEHucH}111RE1HuCLHt6HHt)HHH1Q@H߾1HH [A^]UHAWAVSH(HuH!HED~D}HG]ԉ]؅y HHtWLw(MtNA)Au2HuH}t4}Hut7LHHu9H}1H([A^A_]ILHHuHf.DUHAVSH HHDrHGD)߃tauqHUH a#HMDu]]yHHHHtMH~(HtDD9uMHHu-HH"H=H [A^]H5"1HH [A^]H}111fUHHHHGzu H=]H5$%1]f.DUHAVSH HHDrHGD)߃t]umHUH (HMDu]]yHHHHtIH~(Ht@D9uIHu,HH"H=H [A^]H5(1HH [A^]H}111fDUHHHHGzu H=]H5e)1]f.DUHAWAVSH8HuH -HED~D}HG]̉]Ѕy HHtnLw(MteA)AuIHuH}tKHuH}t:HuHULHHuHH}1H8[A^A_]f.UHAVSH0^HG)ЃHuH-HEȉ]ЉUԉU؅yHHH_(HHuH}H5j2H}HU}HuHHHHHcHuH-HEȉ]ЉUԉU؅y HHtRLw(MtIHuH}t8Hu1L1IHuLHH5,1HH0[A^]fUHAWAVSH(HuH{.HED~D}HG]ԉ]؅y HHtXLw(MtOA)Au3HuH}t5HuLHuHHH}1H([A^A_]ÐUHAWAVSH(HuH.HED~D}HG]ԉ]؅y HHtXLw(MtOA)Au3HuH}t5HuLHuHHH}1H([A^A_]ÐUHAWAVSH(HuH.HED~D}HG]ԉ]؅y HHt`Lw(MtWA)Au;H50H}HU}t4LHHuHHH}1H([A^A_]fUHAWAVSH(HuH.HED~D}HG]ԉ]؅y HHt`Lw(MtWA)Au;H5/H}HU}t4LHHuHHH}1H([A^A_]fUHSPHH=HtZH=>.HtGH=<.Ht4H=2.Ht!H=-.HtHH[]H[]f.@UHAWAVSH(HuHHED~D}HG]ԉ]؅y HHtaLw(MtXA)AuE;E}eH5)H}HU}tII14H}1H}HtHu HE1HHH[A^A_]E1HMH}LLHuH= *HuHH}Huf.fUHAWAVSHHHuHTHEDvDuHG]ԉ]؅yHHL(HEMtaA)AH}AuTHutVH5(H}HUHt=IƋE;E}aH5(H}HU}tIE101H}HtHu HE1HHH[A^A_]E1HUH}LLHuH=(HuHH}HuUHAWAVATSHPHuHHEDvDuHG]ĉ]ȅyHHLg(HEHEMA)AAugH5'H}HUHIH5r'H}HUHINjE;E}_H5:'H}HU}tdICH}1H}HuLTE1HEHEMP1GE1H}LLLHt81H}Ht HuH}Ht HuHHP[A\A^A_]H=*'HuHH}Huf.UHAWAVSH(HuH-HED~D}HG]ԉ]؅y HHt`Lw(MtWA)Au;H5&H}HU}t4LHHuHHH}1H([A^A_]fUHAWAVSH(HuHmHED~D}HG]ԉ]؅yHHLw(HEMtDA)Au?H5D%H}HUHtLHHtS1H}Hu$814H}1H}HtHu HE1HH([A^A_]HHH}HufUHAWAVSH8HuHHED~D}HG]ԉ]؅y HHtrLw(MtiA)AAuIHuH}tKHuH}t:E;E}?H5$H}HU}tH"H}1H8[A^A_]1HuHULHuHHf.DUHAWAVSH8HuHHEDvDuHG]̉]ЅyHHL(HEMtaA)AAuXH5@#H}HUHtRIH}Hut>E;E}eH5"H}HU}tHH14H}1H}HtHu HE1HH8[A^A_]1HULLHuHHH}Huf.UHAWAVSH8HuHHEDvDuHG]̉]ЅyHHL(HEMtaA)AH}AuTHutVH5!H}HUHt=IƋE;E}aH5!H}HU}tHD101H}HtHu HE1HH8[A^A_]1HuLLHuHHH}Huf.@UHAWAVATSH@HuHHEDvDuHG]]yHHLg(HEHEMA)AAugH5 H}HUHIH5 H}HUHINjE;E}_H5Z H}HU}t_HBH}1H}HuGOE1HEHEMP1B1LLLHt81H}Ht HuH}Ht HuHH@[A\A^A_]HHH}Hu8!HDi!%#.#/$3$(%5%%%&2&((+$+..}00U4b4557788\9k9 ::::;;(;J;l;::;(;J;l;vtkMutableDirectedGraphvtkCommonDataModelPython.vtkMutableDirectedGraphvtkMutableDirectedGraph - An editable directed graph. Superclass: vtkDirectedGraph vtkMutableDirectedGraph is a directed graph which has additional methods for adding edges and vertices. AddChild() is a convenience method for constructing trees. ShallowCopy(), DeepCopy(), CheckedShallowCopy() and CheckedDeepCopy() will succeed for instances of vtkDirectedGraph, vtkMutableDirectedGraph and vtkTree. @sa vtkDirectedGraph vtkGraph vtkTree 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) -> vtkMutableDirectedGraph C++: static vtkMutableDirectedGraph *SafeDownCast( vtkObjectBase *o) NewInstanceV.NewInstance() -> vtkMutableDirectedGraph C++: vtkMutableDirectedGraph *NewInstance() SetNumberOfVerticesV.SetNumberOfVertices(int) -> int C++: virtual vtkIdType SetNumberOfVertices(vtkIdType numVerts) Allocates space for the specified number of vertices in the graph's internal data structures. * This has no effect on the number of vertex coordinate tuples or * vertex attribute tuples allocated; you are responsible for * guaranteeing these match. * Also, this call is not implemented for distributed-memory graphs since * the semantics are unclear; calling this function on a graph with a * non-nullptr DistributedGraphHelper will generate an error message and * no allocation will be performed. AddVertexV.AddVertex() -> int C++: vtkIdType AddVertex() V.AddVertex(vtkVariantArray) -> int C++: vtkIdType AddVertex(vtkVariantArray *propertyArr) V.AddVertex(vtkVariant) -> int C++: vtkIdType AddVertex(const vtkVariant &pedigreeId) Adds a vertex to the graph and returns the index of the new vertex. * ote In a distributed graph (i.e. a graph whose DistributedHelper * is non-null), this routine cannot be used to add a vertex * if the vertices in the graph have pedigree IDs, because this routine * will always add the vertex locally, which may conflict with the * proper location of the vertex based on the distribution of the * pedigree IDs. AddEdgeV.AddEdge(int, int) -> vtkEdgeType C++: vtkEdgeType AddEdge(vtkIdType u, vtkIdType v) V.AddEdge(int, int, vtkVariantArray) -> vtkEdgeType C++: vtkEdgeType AddEdge(vtkIdType u, vtkIdType v, vtkVariantArray *propertyArr) V.AddEdge(vtkVariant, int, vtkVariantArray) -> vtkEdgeType C++: vtkEdgeType AddEdge(const vtkVariant &u, vtkIdType v, vtkVariantArray *propertyArr=nullptr) V.AddEdge(int, vtkVariant, vtkVariantArray) -> vtkEdgeType C++: vtkEdgeType AddEdge(vtkIdType u, const vtkVariant &v, vtkVariantArray *propertyArr=nullptr) V.AddEdge(vtkVariant, vtkVariant, vtkVariantArray) -> vtkEdgeType C++: vtkEdgeType AddEdge(const vtkVariant &u, const vtkVariant &v, vtkVariantArray *propertyArr=nullptr) Adds a directed edge from u to v, where u and v are vertex indices, and returns a vtkEdgeType structure describing that edge. * vtkEdgeType contains fields for Source vertex index, * Target vertex index, and edge index Id. LazyAddVertexV.LazyAddVertex() C++: void LazyAddVertex() V.LazyAddVertex(vtkVariantArray) C++: void LazyAddVertex(vtkVariantArray *propertyArr) V.LazyAddVertex(vtkVariant) C++: void LazyAddVertex(const vtkVariant &pedigreeId) Adds a vertex to the graph. * This method is lazily evaluated for distributed graphs (i.e. graphs * whose DistributedHelper is non-null) the next time Synchronize is * called on the helper. LazyAddEdgeV.LazyAddEdge(int, int, vtkVariantArray) C++: void LazyAddEdge(vtkIdType u, vtkIdType v, vtkVariantArray *propertyArr=nullptr) V.LazyAddEdge(vtkVariant, int, vtkVariantArray) C++: void LazyAddEdge(const vtkVariant &u, vtkIdType v, vtkVariantArray *propertyArr=nullptr) V.LazyAddEdge(int, vtkVariant, vtkVariantArray) C++: void LazyAddEdge(vtkIdType u, const vtkVariant &v, vtkVariantArray *propertyArr=nullptr) V.LazyAddEdge(vtkVariant, vtkVariant, vtkVariantArray) C++: void LazyAddEdge(const vtkVariant &u, const vtkVariant &v, vtkVariantArray *propertyArr=nullptr) Adds a directed edge from u to v, where u and v are vertex indices. * The number and order of values in the optional parameter * propertyArr must match up with the arrays in the edge data * retrieved by GetEdgeData(). * This method is lazily evaluated for distributed graphs (i.e. graphs * whose DistributedHelper is non-null) the next time Synchronize is * called on the helper. AddGraphEdgeV.AddGraphEdge(int, int) -> vtkGraphEdge C++: vtkGraphEdge *AddGraphEdge(vtkIdType u, vtkIdType v) Variant of AddEdge() that returns a heavyweight vtkGraphEdge object. The graph owns the reference of the edge and will replace its contents on the next call to AddGraphEdge(). * ote This is a less efficient method for use with wrappers. * In C++ you should use the faster AddEdge(). AddChildV.AddChild(int, vtkVariantArray) -> int C++: vtkIdType AddChild(vtkIdType parent, vtkVariantArray *propertyArr) V.AddChild(int) -> int C++: vtkIdType AddChild(vtkIdType parent) Convenience method for creating trees. Returns the newly created vertex id. Shortcut forvtkIdType v = g->AddVertex(); g->AddEdge(parent, v); If non-null, propertyArr provides edge properties for the newly-created edge. The values in propertyArr must match up with the arrays in the edge data returned by GetEdgeData(). RemoveVertexV.RemoveVertex(int) C++: void RemoveVertex(vtkIdType v) Removes the vertex from the graph along with any connected edges. Note: This invalidates the last vertex index, which is reassigned to v. RemoveEdgeV.RemoveEdge(int) C++: void RemoveEdge(vtkIdType e) Removes the edge from the graph. Note: This invalidates the last edge index, which is reassigned to e. RemoveVerticesV.RemoveVertices(vtkIdTypeArray) C++: void RemoveVertices(vtkIdTypeArray *arr) Removes a collection of vertices from the graph along with any connected edges. RemoveEdgesV.RemoveEdges(vtkIdTypeArray) C++: void RemoveEdges(vtkIdTypeArray *arr) Removes a collection of edges from the graph. vtkDirectedGraphvtkGraphvtkDataObjectvtkObjectvtkObjectBase@V *vtkVariantArray@W vtkVariantvtkVariantArrayvtkVariant@kk@kkV *vtkVariantArray@Wk|V vtkVariant *vtkVariantArray@kW|V vtkVariant *vtkVariantArray@WW|V vtkVariant vtkVariant *vtkVariantArrayvtkEdgeType@kk|V *vtkVariantArrayvtkIdTypeArrayOP `pa`!!a!A!A0aN!P a a ap a0  a aa`a`Da@a aPaPaP6a2a zRx $OAC $D8 AC $l AC B$AC E$AC I$AC G$ 0AC G$4AC I$\AC G$hAAC $AC G$8AAC $`AC I$$NAC G$L0AC I$tAC I$@AC I$AC I$pAC B$AC I$<pAC I$dXAC I$AC I$DAC I$@AC I,AC K$4AC I$\ AC I$AC I$6AC I$2AC I,AC KF==/<-<-'-I-@-A-zC-mZC-MB-=='-K-t<-_@-AA-4C-E-B-t==h'-cJ-8<-#@-A-E-C-B-d8==,'-'L-@-A-E-E-B-d<==<-@-'-Q-C-B-d6@-=='- P-A-B-t:-kT<-A<-''-"V-@-A-C-zC-m0B-:-'-X-<-@-aA-T=C-0%E-B-:-}'-xW-H<-3@-A-E-C-B-tB@--:-$'-Z-A-E-E-B-tM@-8:-/#'-Y-E-E-B-p)-N<-9@-'-]- C-  B- g @-R )-E '-= \-, A-  B-  >- _- } _-u j _-b W _-O D _-<  @- == '- M- A-  B- V @-> ==2 '-- S- A-  B-  @- ==z '-u H-e E-> B-  @- == '- O- E- B-d < ?-5 ) )- '- [- E-B-'-[-A-vE-PB-:@-F-'-N-E-E-nB-D?- G-@-?-G- =='-R-fB-I?-G- @-?-G- v)-i'-a^-FB-))-'-@-'-T-uE-NB-$7-3-1-F-'-@-'-LB-"F-'-@-'-A-rC(-6'-@-'-%-D-B-c@-M(-@'-9%-,D-<-&---;-/-zslVU-IB--=6/;-'!/-"xh!XH 8(xhXH8(xh`XH@8(  xh `XH@8( @*85490,+8X602.`@ `@ `@ `@  `P?  pS `P    H`   t 0  P    p   /`G`_ ~PfPP $$` 0 pF J[x9 V mf $   t 4s 5 [Z @&y>OO_PyType_Ready__ZN23vtkMutableDirectedGraph11LazyAddEdgeExxP15vtkVariantArray__ZN23vtkMutableDirectedGraph7AddEdgeExxP15vtkVariantArray__ZN23vtkMutableDirectedGraph11LazyAddEdgeERK10vtkVariantxP15vtkVariantArray__ZN23vtkMutableDirectedGraph7AddEdgeERK10vtkVariantxP15vtkVariantArray__ZN23vtkMutableDirectedGraph8AddChildExP15vtkVariantArray__ZN23vtkMutableDirectedGraph11LazyAddEdgeExRK10vtkVariantP15vtkVariantArray__ZN23vtkMutableDirectedGraph7AddEdgeExRK10vtkVariantP15vtkVariantArray__ZN23vtkMutableDirectedGraph11LazyAddEdgeERK10vtkVariantS2_P15vtkVariantArray__ZN23vtkMutableDirectedGraph7AddEdgeERK10vtkVariantS2_P15vtkVariantArray__ZN23vtkMutableDirectedGraph13LazyAddVertexEP15vtkVariantArray__ZN23vtkMutableDirectedGraph9AddVertexEP15vtkVariantArray__ZN23vtkMutableDirectedGraph11RemoveEdgesEP14vtkIdTypeArray__ZN23vtkMutableDirectedGraph14RemoveVerticesEP14vtkIdTypeArray__ZN23vtkMutableDirectedGraph12AddGraphEdgeExx__ZN23vtkMutableDirectedGraph7AddEdgeExx__ZN13vtkPythonArgs8GetValueERx__ZN23vtkMutableDirectedGraph12RemoveVertexEx__ZN23vtkMutableDirectedGraph19SetNumberOfVerticesEx__ZN23vtkMutableDirectedGraph10RemoveEdgeEx_PyVTKSpecialObject_CopyNew_PyvtkDirectedGraph_ClassNew_PyvtkMutableDirectedGraph_ClassNew_PyVTKObject_New__ZL35PyvtkMutableDirectedGraph_StaticNewv__ZN23vtkMutableDirectedGraph13LazyAddVertexEv__ZN23vtkMutableDirectedGraph9AddVertexEv__ZN23vtkMutableDirectedGraph3NewEv__ZN23vtkMutableDirectedGraph13LazyAddVertexERK10vtkVariant__ZN23vtkMutableDirectedGraph9AddVertexERK10vtkVariant_PyVTKObject_GetSet__Py_NoneStruct__ZN13vtkPythonArgs21GetArgAsSpecialObjectEPKcPP7_object_PyVTKObject_GetObject__ZL47PyvtkMutableDirectedGraph_LazyAddVertex_Methods__ZL43PyvtkMutableDirectedGraph_AddVertex_Methods__ZL33PyvtkMutableDirectedGraph_Methods__ZL45PyvtkMutableDirectedGraph_LazyAddEdge_Methods__ZL41PyvtkMutableDirectedGraph_AddEdge_Methods_PyObject_GenericSetAttr_PyObject_GenericGetAttr_PyVTKObject_Repr_PyVTKObject_AsBuffer_strcmp_PyObject_GC_Del_PyVTKObject_Check__ZN13vtkPythonArgs13ArgCountErrorEii_PyVTKAddFile_vtkMutableDirectedGraph_PyLong_FromLong_PyLong_FromLongLong_PyDict_SetItemString_PyVTKObject_String_PyVTKObject_SetFlag_PyVTKObject_Delete_PyVTKObject_Traverse__ZN13vtkPythonUtil20GetObjectFromPointerEP13vtkObjectBase__ZL30PyvtkMutableDirectedGraph_Type_PyType_Type_PyErr_Occurred_PyVTKClass_Add__Py_Dealloc__ZN13vtkPythonArgs8GetValueERPc__ZN13vtkPythonArgs13ArgCountErrorEiPKc__ZN23vtkMutableDirectedGraph8IsTypeOfEPKc__ZN13vtkObjectBase8IsTypeOfEPKc__ZN13vtkPythonArgs17GetArgAsVTKObjectEPKcRb__ZN17vtkPythonOverload10CallMethodEP11PyMethodDefP7_objectS3___ZN13vtkPythonArgs19GetSelfFromFirstArgEP7_objectS1___ZL38PyvtkMutableDirectedGraph_RemoveVertexP7_objectS0___ZL39PyvtkMutableDirectedGraph_LazyAddVertexP7_objectS0___ZL35PyvtkMutableDirectedGraph_AddVertexP7_objectS0___ZL38PyvtkMutableDirectedGraph_SafeDownCastP7_objectS0___ZL37PyvtkMutableDirectedGraph_RemoveEdgesP7_objectS0___ZL45PyvtkMutableDirectedGraph_SetNumberOfVerticesP7_objectS0___ZL40PyvtkMutableDirectedGraph_RemoveVerticesP7_objectS0___ZL34PyvtkMutableDirectedGraph_IsTypeOfP7_objectS0___ZL38PyvtkMutableDirectedGraph_AddGraphEdgeP7_objectS0___ZL36PyvtkMutableDirectedGraph_RemoveEdgeP7_objectS0___ZL37PyvtkMutableDirectedGraph_LazyAddEdgeP7_objectS0___ZL33PyvtkMutableDirectedGraph_AddEdgeP7_objectS0___ZL37PyvtkMutableDirectedGraph_NewInstanceP7_objectS0___ZL34PyvtkMutableDirectedGraph_AddChildP7_objectS0___ZL29PyvtkMutableDirectedGraph_IsAP7_objectS0___ZL36PyvtkMutableDirectedGraph_AddEdge_s5P7_objectS0___ZL40PyvtkMutableDirectedGraph_LazyAddEdge_s4P7_objectS0___ZL36PyvtkMutableDirectedGraph_AddEdge_s4P7_objectS0___ZL42PyvtkMutableDirectedGraph_LazyAddVertex_s3P7_objectS0___ZL38PyvtkMutableDirectedGraph_AddVertex_s3P7_objectS0___ZL40PyvtkMutableDirectedGraph_LazyAddEdge_s3P7_objectS0___ZL36PyvtkMutableDirectedGraph_AddEdge_s3P7_objectS0___ZL42PyvtkMutableDirectedGraph_LazyAddVertex_s2P7_objectS0___ZL38PyvtkMutableDirectedGraph_AddVertex_s2P7_objectS0___ZL40PyvtkMutableDirectedGraph_LazyAddEdge_s2P7_objectS0___ZL36PyvtkMutableDirectedGraph_AddEdge_s2P7_objectS0___ZL40PyvtkMutableDirectedGraph_LazyAddEdge_s1P7_objectS0___ZL36PyvtkMutableDirectedGraph_AddEdge_s1P7_objectS0_