X x__text__TEXTu x!__data__DATA ` &/__cstring__TEXTL X__compact_unwind__LD0(__eh_frame__TEXTp h2  (>`,4 P,UHH=H5HH uHH=H]ÐUH]fDUHSPHH=H5HbH uHH=H5.HHt H tH[]H=H[]fUHAVSH0HuH6HEЋFEHEHEH}ȃHuH]H= HAtDH=Ht1H=HtH=Ht HLcHuL1H0[A^]UHAWAVSH(HuH^HED~D}HG]ԉ]؅yHHLw(HEMA)Au{HuH}}L}tH=~ LAtuH=LtbH=LtOH=LtH5H}HU}t7HHHu"HH([]H}о1H([]HD<EFJ?L.$y!!vtkUndirectedGraphvtkCommonDataModelPython.vtkUndirectedGraphvtkUndirectedGraph - An undirected graph. Superclass: vtkGraph vtkUndirectedGraph is a collection of vertices along with a collection of undirected edges (they connect two vertices in no particular order). ShallowCopy(), DeepCopy(), CheckedShallowCopy(), CheckedDeepCopy() accept instances of vtkUndirectedGraph and vtkMutableUndirectedGraph. GetOutEdges(v, it) and GetInEdges(v, it) return the same list of edges, which is the list of all edges which have a v as an endpoint. GetInDegree(v), GetOutDegree(v) and GetDegree(v) all return the full degree of vertex v. vtkUndirectedGraph is read-only. To create an undirected graph, use an instance of vtkMutableUndirectedGraph, then you may set the structure to a vtkUndirectedGraph using ShallowCopy(). @sa vtkGraph vtkMutableUndirectedGraph 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) -> vtkUndirectedGraph C++: static vtkUndirectedGraph *SafeDownCast(vtkObjectBase *o) NewInstanceV.NewInstance() -> vtkUndirectedGraph C++: vtkUndirectedGraph *NewInstance() GetDataObjectTypeV.GetDataObjectType() -> int C++: int GetDataObjectType() override; Return what type of dataset this is. GetInDegreeV.GetInDegree(int) -> int C++: vtkIdType GetInDegree(vtkIdType v) override; Returns the full degree of the vertex. GetInEdgeV.GetInEdge(int, int) -> vtkInEdgeType C++: vtkInEdgeType GetInEdge(vtkIdType v, vtkIdType i) override; V.GetInEdge(int, int, vtkGraphEdge) C++: void GetInEdge(vtkIdType v, vtkIdType i, vtkGraphEdge *e) override; Random-access method for retrieving the in edges of a vertex. For an undirected graph, this is the same as the out edges. GetDataV.GetData(vtkInformation) -> vtkUndirectedGraph C++: static vtkUndirectedGraph *GetData(vtkInformation *info) V.GetData(vtkInformationVector, int) -> vtkUndirectedGraph C++: static vtkUndirectedGraph *GetData(vtkInformationVector *v, int i=0) Retrieve a graph from an information vector. GetInEdgesV.GetInEdges(int, vtkInEdgeIterator) C++: void GetInEdges(vtkIdType v, vtkInEdgeIterator *it) override; Initialize the iterator to get the incoming edges to a vertex. For an undirected graph, this is all incident edges. IsStructureValidV.IsStructureValid(vtkGraph) -> bool C++: bool IsStructureValid(vtkGraph *g) override; Check the structure, and accept it if it is a valid undirected graph. This is public to allow the ToDirected/UndirectedGraph to work. vtkGraphvtkDataObjectvtkObjectvtkObjectBasevtkInEdgeTypevtkGraphEdgeV *vtkInformationV|i *vtkInformationVectorvtkInformationvtkInformationVectorvtkInEdgeIteratorOP `!:a!!aa` @`aP a0  zRx $OAC $D AC $lAC B$HAC G$:AC I$AC G$ AC G$4xAC I$\AC I$AC E$`@AC $xAC I$@AC I$$AC E$LAC Eh --N 3-A -9 8-+ .-   3- - 9- 1- .-~ s --@ $ - - -- - 6- .-  /-d D *=8 - ---;-.-2-/-tX,-SL4-F ? -*=-'--,-<-x.-k`2-O2-1/- :-2-2-/-K->----5-2-/-\-O-<--$-/-$- --s3-f-\--F-2/-3----y-eM.-@"----+-=-=-=-wf=-^E0-/-----+-=-y=-qf=-^M=-E20-)---(--zslV7-IB-=6/(-'!-8(   xh `XH@8( @8"!&%X#0`@ `@ G ^ P= m`u 0  `=P  K`l}qg G#}755 bU>t6_PyType_Ready__ZN18vtkUndirectedGraph9GetInEdgeExx__ZN13vtkPythonArgs8GetValueERx__ZN18vtkUndirectedGraph11GetInDegreeEx_PyVTKSpecialObject_CopyNew_PyvtkGraph_ClassNew_PyvtkUndirectedGraph_ClassNew_PyVTKObject_New__ZL30PyvtkUndirectedGraph_StaticNewv__ZN18vtkUndirectedGraph3NewEv_PyVTKObject_GetSet__Py_NoneStruct_PyVTKObject_GetObject__ZL28PyvtkUndirectedGraph_Methods__ZL36PyvtkUndirectedGraph_GetData_Methods_PyObject_GenericSetAttr_PyObject_GenericGetAttr_PyVTKObject_Repr__ZN8vtkGraph10GetInEdgesExP17vtkInEdgeIterator_PyVTKObject_AsBuffer_strcmp__ZN18vtkUndirectedGraph7GetDataEP14vtkInformation_PyObject_GC_Del_PyVTKObject_Check__ZN18vtkUndirectedGraph7GetDataEP20vtkInformationVectori__ZN13vtkPythonArgs13ArgCountErrorEii__ZN13vtkPythonArgs8GetValueERi__ZN18vtkUndirectedGraph16IsStructureValidEP8vtkGraph_PyVTKAddFile_vtkUndirectedGraph_PyBool_FromLong_PyLong_FromLong_PyLong_FromLongLong_PyDict_SetItemString_PyVTKObject_String_PyVTKObject_SetFlag_PyVTKObject_Delete_PyVTKObject_Traverse__ZN13vtkPythonUtil20GetObjectFromPointerEP13vtkObjectBase__ZL25PyvtkUndirectedGraph_Type_PyType_Type__ZN8vtkGraph9GetInEdgeExxP12vtkGraphEdge_PyErr_Occurred_PyVTKClass_Add__Py_Dealloc__ZN13vtkPythonArgs8GetValueERPc__ZN13vtkPythonArgs13ArgCountErrorEiPKc__ZN13vtkObjectBase8IsTypeOfEPKc__ZN13vtkPythonArgs17GetArgAsVTKObjectEPKcRb__ZN17vtkPythonOverload10CallMethodEP11PyMethodDefP7_objectS3___ZN13vtkPythonArgs19GetSelfFromFirstArgEP7_objectS1___ZL33PyvtkUndirectedGraph_SafeDownCastP7_objectS0___ZL31PyvtkUndirectedGraph_GetInEdgesP7_objectS0___ZL29PyvtkUndirectedGraph_IsTypeOfP7_objectS0___ZL38PyvtkUndirectedGraph_GetDataObjectTypeP7_objectS0___ZL30PyvtkUndirectedGraph_GetInEdgeP7_objectS0___ZL32PyvtkUndirectedGraph_GetInDegreeP7_objectS0___ZL32PyvtkUndirectedGraph_NewInstanceP7_objectS0___ZL37PyvtkUndirectedGraph_IsStructureValidP7_objectS0___ZL28PyvtkUndirectedGraph_GetDataP7_objectS0___ZL24PyvtkUndirectedGraph_IsAP7_objectS0___ZL31PyvtkUndirectedGraph_GetData_s2P7_objectS0___ZL31PyvtkUndirectedGraph_GetData_s1P7_objectS0_