X PBxPB__text__TEXTxD(__data__DATAHNS__cstring__TEXT #__compact_unwind__LD(9;P __eh_frame__TEXT(=(? h2  Q`WP P##&:UHH=H5Hw H uHH=H]ÐUH]fDUHSPHH=H5H H uHH=H5HHt 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ЋFEHEuGH55H}HU}t@HHtCHH5HPE1LEHu+H}Ⱦ1H0[A^]E1HuLUHAVSH HuH!HEDvDuHG]]yHHH(HD9u3HPxHt9HHH5 HPE1LEHucH}111RE1HuCLHt6HHt)HHH1Q@H߾1HH [A^]UHAWAVSH(HuH:!HED~D}HG]ԉ]؅y HHtWLw(MtNA)Au2HuH}t4}Hut7LHHu9H}1H([A^A_]ILHHuHf.DUHAVSH HHDrHGD)߃tauqHUH #HMDu]]yHHHHtMH~(HtDD9uMHHu-HH"H=H [A^]H5"1HH [A^]H}111fUHHHHGzu H=]H5$1]f.DUHAVSH HHDrHGD)߃t]umHUH H(HMDu]]yHHHHtIH~(Ht@D9uIHu,HH"H=H [A^]H5'1HH [A^]H}111fDUHHHHGzu H=]H5%)1]f.DUHAWAVSH8HuHy,HED~D}HG]̉]Ѕy HHtnLw(MteA)AuIHuH}tKHuH}t:HuHULHHuHH}1H8[A^A_]f.UHAWAVSH(HuH8-HED~D}HG]ԉ]؅y HHtXLw(MtOA)Au3HuH}t5HuLHuHHH}1H([A^A_]ÐUHAWAVSH(HuHY-HED~D}HG]ԉ]؅y HHtXLw(MtOA)Au3HuH}t5HuLHuHHH}1H([A^A_]ÐUHAWAVSH(HuHQ-HED~D}HG]ԉ]؅y HHt`Lw(MtWA)Au;H5Q/H}HU}t4LHHuHHH}1H([A^A_]fUHAWAVSH(HuHA-HED~D}HG]ԉ]؅y HHt`Lw(MtWA)Au;H5.H}HU}t4LHHuHHH}1H([A^A_]fUHSPHH=HtZH=,HtGH=,Ht4H=,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.fUHAWAVSHHHuHaHEDvDuHG]ԉ]؅yHHL(HEMtaA)AH}AuTHutVH5'H}HUHt=IƋE;E}aH5Z'H}HU}tIE101H}HtHu HE1HHH[A^A_]E1HUH}LLHuH='HuHH}HuUHAWAVATSHPHuHHEDvDuHG]ĉ]ȅyHHLg(HEHEMA)AAugH5Q&H}HUHIH51&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(HuH}HED~D}HG]ԉ]؅yHHLw(HEMtDA)Au?H5$H}HUHtLHHtS1H}Hu$814H}1H}HtHu HE1HH([A^A_]HHH}HufUHAWAVSH8HuH%HED~D}HG]̉]Ѕy HHtmLw(MtdA)AuHHuH}tJHuH}t9HuHULHuHHH}1H8[A^A_]f.fUHAWAVSH8HuHUHED~D}HG]ԉ]؅yHHLw(MA)AueHuH}tgHuH}tVH5"H}HU}tE;E}eH5 H}HU}tHH14H}1H}HtHu HE1HH8[A^A_]1HULLHuHHH}Huf.UHAWAVSH8HuH%HEDvDuHG]̉]ЅyHHL(HEMtaA)AH}AuTHutVH5H}HUHt=IƋE;E}aH5H}HU}tHD101H}HtHu HE1HH8[A^A_]1HuLLHuHHH}Huf.@UHAWAVATSH@HuHHEDvDuHG]]yHHLg(HEHEMA)AAugH5H}HUHIH5H}HUHINjE;E}_H5YH}HU}t_HBH}1H}HuGOE1HEHEMP1B1LLLHt81H}Ht HuH}Ht HuHH@[A\A^A_]HHH}Hu HD a"j"k#o#d$q$$%b%v%K(U(**..=0I033P5]5!6,666y77@8T8}88888@8T8}88888vtkMutableUndirectedGraphvtkCommonDataModelPython.vtkMutableUndirectedGraphvtkMutableUndirectedGraph - An editable undirected graph. Superclass: vtkUndirectedGraph vtkMutableUndirectedGraph is an undirected graph with additional functions for adding vertices and edges. ShallowCopy(), DeepCopy(), CheckedShallowCopy(), and CheckedDeepCopy() will succeed when the argument is a vtkUndirectedGraph or vtkMutableUndirectedGraph. @sa vtkUndirectedGraph 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) -> vtkMutableUndirectedGraph C++: static vtkMutableUndirectedGraph *SafeDownCast( vtkObjectBase *o) NewInstanceV.NewInstance() -> vtkMutableUndirectedGraph C++: vtkMutableUndirectedGraph *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. The previous number of vertices is returned on success and -1 is returned on failure. * 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, * no allocation will be performed, and a value of -1 will be returned. 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 an undirected 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) C++: void LazyAddEdge(vtkIdType u, vtkIdType v) V.LazyAddEdge(int, int, vtkVariantArray) C++: void LazyAddEdge(vtkIdType u, vtkIdType v, vtkVariantArray *propertyArr) 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 an undirected edge from u to v, where u and v are vertex indices. * 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(). 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. vtkUndirectedGraphvtkGraphvtkDataObjectvtkObjectvtkObjectBase@V *vtkVariantArray@W vtkVariantvtkVariantArrayvtkVariant@kk@kkV *vtkVariantArray@Wk|V vtkVariant *vtkVariantArray@kW|V vtkVariant *vtkVariantArray@WW|V vtkVariant vtkVariant *vtkVariantArrayvtkEdgeTypevtkIdTypeArrayOP `pa`!!a!A!A0aaa` a a p a0 a@ aaDa`@a @aaaa6a2a@ zRx $OAC $D AC $lAC B$0AC E$AC I$PAC G$ AC G$4AC I$\hAC G$AAC $8AC G$AAC $AC I$$AC I$L8AC I$tAC I$XAC I$AC B$XAC I$AC I$<AC I$dAC I$XDAC I$@AC I,AC K$ AC I$4AC I$\xAC I$ AC I$6AC I$2AC I,AC K==<-<-r'-mI-0@-A-C-C-B-V =='-K-<-@-A-C-uE->B-=='-J-<-@-qA-dQE-<C-/B-@-=='-M-fA-YNE-=E-B-@-=='-L-vE-eE->B-==<-@-'-R-xC-k>B-@-=='-Q-A-~B-T$:-<-<-'-W-@-rA-eJC-=*C-B-:-y'-tY-D<-/@-A-C-E-B-tB:-9-'-(X-<-@-A-E-C-NB-$@-:-'-[-A-E-}E-NB-$ @- :-  '- Z- E- E-~ B-T  )- <- @- '- ]- C- n B-D  @- )- '- \- A-  B- R >-@ _-8 - _-%  _-  _-  _-  @- == '- N- A- ^ B-4  @- == '- T- A-  B-t N @-6 ==* '-% H- E-B-@-==z'-uP-eE->B-@-F-'-O-E-E-nB-D?- G-@-?-G- =='-S-fB-I?-G- @-?-G- v)-i'-a^-FB-))-'-@-'-U-uE-NB-$7-3-1-F-'-@-'-LB-"F-'-@-'-A-rC(-6'-@-'-%-D-B-c@-M(-@'-9%-,D-<-&---;-/-zslVV-IB--=6/;-'!/-"xh!XH 8(xhXH8(XH@8(  xh `XH@8( @*85490,+8X602.`@ `@ `@ `@ G pP  p `  X Pi w p/ A 0  G `  &p 60 @ `H@aq @U`  { } n  7 K  /?  [  l p'] ]=9vQn_PyType_Ready__ZN25vtkMutableUndirectedGraph11LazyAddEdgeExxP15vtkVariantArray__ZN25vtkMutableUndirectedGraph7AddEdgeExxP15vtkVariantArray__ZN25vtkMutableUndirectedGraph11LazyAddEdgeERK10vtkVariantxP15vtkVariantArray__ZN25vtkMutableUndirectedGraph7AddEdgeERK10vtkVariantxP15vtkVariantArray__ZN25vtkMutableUndirectedGraph11LazyAddEdgeExRK10vtkVariantP15vtkVariantArray__ZN25vtkMutableUndirectedGraph7AddEdgeExRK10vtkVariantP15vtkVariantArray__ZN25vtkMutableUndirectedGraph11LazyAddEdgeERK10vtkVariantS2_P15vtkVariantArray__ZN25vtkMutableUndirectedGraph7AddEdgeERK10vtkVariantS2_P15vtkVariantArray__ZN25vtkMutableUndirectedGraph13LazyAddVertexEP15vtkVariantArray__ZN25vtkMutableUndirectedGraph9AddVertexEP15vtkVariantArray__ZN25vtkMutableUndirectedGraph11RemoveEdgesEP14vtkIdTypeArray__ZN25vtkMutableUndirectedGraph14RemoveVerticesEP14vtkIdTypeArray__ZN25vtkMutableUndirectedGraph12AddGraphEdgeExx__ZN25vtkMutableUndirectedGraph11LazyAddEdgeExx__ZN25vtkMutableUndirectedGraph7AddEdgeExx__ZN13vtkPythonArgs8GetValueERx__ZN25vtkMutableUndirectedGraph12RemoveVertexEx__ZN25vtkMutableUndirectedGraph19SetNumberOfVerticesEx__ZN25vtkMutableUndirectedGraph10RemoveEdgeEx_PyVTKSpecialObject_CopyNew_PyvtkUndirectedGraph_ClassNew_PyvtkMutableUndirectedGraph_ClassNew_PyVTKObject_New__ZL37PyvtkMutableUndirectedGraph_StaticNewv__ZN25vtkMutableUndirectedGraph13LazyAddVertexEv__ZN25vtkMutableUndirectedGraph9AddVertexEv__ZN25vtkMutableUndirectedGraph3NewEv__ZN25vtkMutableUndirectedGraph13LazyAddVertexERK10vtkVariant__ZN25vtkMutableUndirectedGraph9AddVertexERK10vtkVariant_PyVTKObject_GetSet__Py_NoneStruct__ZN13vtkPythonArgs21GetArgAsSpecialObjectEPKcPP7_object_PyVTKObject_GetObject__ZL49PyvtkMutableUndirectedGraph_LazyAddVertex_Methods__ZL45PyvtkMutableUndirectedGraph_AddVertex_Methods__ZL35PyvtkMutableUndirectedGraph_Methods__ZL47PyvtkMutableUndirectedGraph_LazyAddEdge_Methods__ZL43PyvtkMutableUndirectedGraph_AddEdge_Methods_PyObject_GenericSetAttr_PyObject_GenericGetAttr_PyVTKObject_Repr_PyVTKObject_AsBuffer_strcmp_PyObject_GC_Del_PyVTKObject_Check__ZN13vtkPythonArgs13ArgCountErrorEii_PyVTKAddFile_vtkMutableUndirectedGraph_PyLong_FromLong_PyLong_FromLongLong_PyDict_SetItemString_PyVTKObject_String_PyVTKObject_SetFlag_PyVTKObject_Delete_PyVTKObject_Traverse__ZN13vtkPythonUtil20GetObjectFromPointerEP13vtkObjectBase__ZL32PyvtkMutableUndirectedGraph_Type_PyType_Type_PyErr_Occurred_PyVTKClass_Add__Py_Dealloc__ZN13vtkPythonArgs8GetValueERPc__ZN13vtkPythonArgs13ArgCountErrorEiPKc__ZN25vtkMutableUndirectedGraph8IsTypeOfEPKc__ZN13vtkObjectBase8IsTypeOfEPKc__ZN13vtkPythonArgs17GetArgAsVTKObjectEPKcRb__ZN17vtkPythonOverload10CallMethodEP11PyMethodDefP7_objectS3___ZN13vtkPythonArgs19GetSelfFromFirstArgEP7_objectS1___ZL40PyvtkMutableUndirectedGraph_RemoveVertexP7_objectS0___ZL41PyvtkMutableUndirectedGraph_LazyAddVertexP7_objectS0___ZL37PyvtkMutableUndirectedGraph_AddVertexP7_objectS0___ZL40PyvtkMutableUndirectedGraph_SafeDownCastP7_objectS0___ZL39PyvtkMutableUndirectedGraph_RemoveEdgesP7_objectS0___ZL47PyvtkMutableUndirectedGraph_SetNumberOfVerticesP7_objectS0___ZL42PyvtkMutableUndirectedGraph_RemoveVerticesP7_objectS0___ZL36PyvtkMutableUndirectedGraph_IsTypeOfP7_objectS0___ZL40PyvtkMutableUndirectedGraph_AddGraphEdgeP7_objectS0___ZL38PyvtkMutableUndirectedGraph_RemoveEdgeP7_objectS0___ZL39PyvtkMutableUndirectedGraph_LazyAddEdgeP7_objectS0___ZL35PyvtkMutableUndirectedGraph_AddEdgeP7_objectS0___ZL39PyvtkMutableUndirectedGraph_NewInstanceP7_objectS0___ZL31PyvtkMutableUndirectedGraph_IsAP7_objectS0___ZL42PyvtkMutableUndirectedGraph_LazyAddEdge_s5P7_objectS0___ZL38PyvtkMutableUndirectedGraph_AddEdge_s5P7_objectS0___ZL42PyvtkMutableUndirectedGraph_LazyAddEdge_s4P7_objectS0___ZL38PyvtkMutableUndirectedGraph_AddEdge_s4P7_objectS0___ZL44PyvtkMutableUndirectedGraph_LazyAddVertex_s3P7_objectS0___ZL40PyvtkMutableUndirectedGraph_AddVertex_s3P7_objectS0___ZL42PyvtkMutableUndirectedGraph_LazyAddEdge_s3P7_objectS0___ZL38PyvtkMutableUndirectedGraph_AddEdge_s3P7_objectS0___ZL44PyvtkMutableUndirectedGraph_LazyAddVertex_s2P7_objectS0___ZL40PyvtkMutableUndirectedGraph_AddVertex_s2P7_objectS0___ZL42PyvtkMutableUndirectedGraph_LazyAddEdge_s2P7_objectS0___ZL38PyvtkMutableUndirectedGraph_AddEdge_s2P7_objectS0___ZL42PyvtkMutableUndirectedGraph_LazyAddEdge_s1P7_objectS0___ZL38PyvtkMutableUndirectedGraph_AddEdge_s1P7_objectS0_