xhNhN__text__TEXTQ__literal4__TEXT__literal8__TEXT(__data__DATA 8@Yj__cstring__TEXT$"__compact_unwind__LDD@G\"__eh_frame__TEXTIhL h2  ]J@b P""$&UHH=H5HH uHH=H]ÐUH]fDUHSPHH=H5HBH uHH=H5HHt H tH[]H=H[]fUHAVSH0HuH HEЋFEHEHEH}ȃuoHutqH]H=HAt1H=6CHtH=:CHt HLcHuL1H0[A^]f.@UHAWAVSH(HuH HED~D}HG]ԉ]؅yHHLw(HEMA)AuhHuH}}L}tlH=nLAtbH=%BLtOH=)BLt1+E1#ILHuHHH([A^A_]UHAVSH HuHB*HEDvDuHG]]y HHt'H(HtD9uEt)Ht*11H}111 HHuHHH [A^]UHAWAVSH(HuH*HED~D}HG]ԉ]؅y HHtlLw(MtcA)AuGHuH}tI}EtKAN|.u{AF|ILHu6H}1H([A^A_]ILHuHHf.UHAVSH0HuHF*HEDvDuHG]܉]y HHt'H(HtD9uEt)G|EHt-1:H}111)HEHuEZHHH0[A^]UHAVSH HuH/*HEDvDuHG]]y HHt"H(HtD9uEt$Ht(1.H}111HHuHHHH [A^]UHAVSH HuH*HEDvDuHG]]y HHt"H(HtD9uEt$Ht(1.H}111HHuHHHH [A^]UHAVSH HuH*HEDvDuHG]]y HHt H(HtD9uEt"_tHt*11H}111 HHuHcHHH [A^]v~ G9~{Gz?{Gz?9~HD !!""##G$S$$$%%&&''a(z()*++X-q-./`0012j3344567$7'8=809@9:: <!<==>>??@@|AA%B0BBBCCvtkSimple2DLayoutStrategyvtkInfovisLayoutPython.vtkSimple2DLayoutStrategyvtkSimple2DLayoutStrategy - a simple 2D graph layout Superclass: vtkGraphLayoutStrategy This class is an implementation of the work presented in: Fruchterman & Reingold "Graph Drawing by Force-directed Placement" Software-Practice and Experience 21(11) 1991). The class includes some optimizations but nothing too fancy. @par Thanks: Thanks to Brian Wylie from Sandia National Laboratories for creating this class. 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) -> vtkSimple2DLayoutStrategy C++: static vtkSimple2DLayoutStrategy *SafeDownCast( vtkObjectBase *o) NewInstanceV.NewInstance() -> vtkSimple2DLayoutStrategy C++: vtkSimple2DLayoutStrategy *NewInstance() SetRandomSeedV.SetRandomSeed(int) C++: virtual void SetRandomSeed(int _arg) Seed the random number generator used to jitter point positions. This has a significant effect on their final positions when the layout is complete. GetRandomSeedMinValueV.GetRandomSeedMinValue() -> int C++: virtual int GetRandomSeedMinValue() Seed the random number generator used to jitter point positions. This has a significant effect on their final positions when the layout is complete. GetRandomSeedMaxValueV.GetRandomSeedMaxValue() -> int C++: virtual int GetRandomSeedMaxValue() Seed the random number generator used to jitter point positions. This has a significant effect on their final positions when the layout is complete. GetRandomSeedV.GetRandomSeed() -> int C++: virtual int GetRandomSeed() Seed the random number generator used to jitter point positions. This has a significant effect on their final positions when the layout is complete. SetMaxNumberOfIterationsV.SetMaxNumberOfIterations(int) C++: virtual void SetMaxNumberOfIterations(int _arg) Set/Get the maximum number of iterations to be used. The higher this number, the more iterations through the algorithm is possible, and thus, the more the graph gets modified. The default is '100' for no particular reason Note: The strong recommendation is that you do not change this parameter. :) GetMaxNumberOfIterationsMinValueV.GetMaxNumberOfIterationsMinValue() -> int C++: virtual int GetMaxNumberOfIterationsMinValue() Set/Get the maximum number of iterations to be used. The higher this number, the more iterations through the algorithm is possible, and thus, the more the graph gets modified. The default is '100' for no particular reason Note: The strong recommendation is that you do not change this parameter. :) GetMaxNumberOfIterationsMaxValueV.GetMaxNumberOfIterationsMaxValue() -> int C++: virtual int GetMaxNumberOfIterationsMaxValue() Set/Get the maximum number of iterations to be used. The higher this number, the more iterations through the algorithm is possible, and thus, the more the graph gets modified. The default is '100' for no particular reason Note: The strong recommendation is that you do not change this parameter. :) GetMaxNumberOfIterationsV.GetMaxNumberOfIterations() -> int C++: virtual int GetMaxNumberOfIterations() Set/Get the maximum number of iterations to be used. The higher this number, the more iterations through the algorithm is possible, and thus, the more the graph gets modified. The default is '100' for no particular reason Note: The strong recommendation is that you do not change this parameter. :) SetIterationsPerLayoutV.SetIterationsPerLayout(int) C++: virtual void SetIterationsPerLayout(int _arg) Set/Get the number of iterations per layout. The only use for this ivar is for the application to do visualizations of the layout before it's complete. The default is '100' to match the default 'MaxNumberOfIterations' Note: Changing this parameter is just fine :) GetIterationsPerLayoutMinValueV.GetIterationsPerLayoutMinValue() -> int C++: virtual int GetIterationsPerLayoutMinValue() Set/Get the number of iterations per layout. The only use for this ivar is for the application to do visualizations of the layout before it's complete. The default is '100' to match the default 'MaxNumberOfIterations' Note: Changing this parameter is just fine :) GetIterationsPerLayoutMaxValueV.GetIterationsPerLayoutMaxValue() -> int C++: virtual int GetIterationsPerLayoutMaxValue() Set/Get the number of iterations per layout. The only use for this ivar is for the application to do visualizations of the layout before it's complete. The default is '100' to match the default 'MaxNumberOfIterations' Note: Changing this parameter is just fine :) GetIterationsPerLayoutV.GetIterationsPerLayout() -> int C++: virtual int GetIterationsPerLayout() Set/Get the number of iterations per layout. The only use for this ivar is for the application to do visualizations of the layout before it's complete. The default is '100' to match the default 'MaxNumberOfIterations' Note: Changing this parameter is just fine :) SetInitialTemperatureV.SetInitialTemperature(float) C++: virtual void SetInitialTemperature(float _arg) Set the initial temperature. The temperature default is '5' for no particular reason Note: The strong recommendation is that you do not change this parameter. :) GetInitialTemperatureMinValueV.GetInitialTemperatureMinValue() -> float C++: virtual float GetInitialTemperatureMinValue() Set the initial temperature. The temperature default is '5' for no particular reason Note: The strong recommendation is that you do not change this parameter. :) GetInitialTemperatureMaxValueV.GetInitialTemperatureMaxValue() -> float C++: virtual float GetInitialTemperatureMaxValue() Set the initial temperature. The temperature default is '5' for no particular reason Note: The strong recommendation is that you do not change this parameter. :) GetInitialTemperatureV.GetInitialTemperature() -> float C++: virtual float GetInitialTemperature() Set the initial temperature. The temperature default is '5' for no particular reason Note: The strong recommendation is that you do not change this parameter. :) SetCoolDownRateV.SetCoolDownRate(float) C++: virtual void SetCoolDownRate(double _arg) Set/Get the Cool-down rate. The higher this number is, the longer it will take to "cool-down", and thus, the more the graph will be modified. The default is '10' for no particular reason. Note: The strong recommendation is that you do not change this parameter. :) GetCoolDownRateMinValueV.GetCoolDownRateMinValue() -> float C++: virtual double GetCoolDownRateMinValue() Set/Get the Cool-down rate. The higher this number is, the longer it will take to "cool-down", and thus, the more the graph will be modified. The default is '10' for no particular reason. Note: The strong recommendation is that you do not change this parameter. :) GetCoolDownRateMaxValueV.GetCoolDownRateMaxValue() -> float C++: virtual double GetCoolDownRateMaxValue() Set/Get the Cool-down rate. The higher this number is, the longer it will take to "cool-down", and thus, the more the graph will be modified. The default is '10' for no particular reason. Note: The strong recommendation is that you do not change this parameter. :) GetCoolDownRateV.GetCoolDownRate() -> float C++: virtual double GetCoolDownRate() Set/Get the Cool-down rate. The higher this number is, the longer it will take to "cool-down", and thus, the more the graph will be modified. The default is '10' for no particular reason. Note: The strong recommendation is that you do not change this parameter. :) SetJitterV.SetJitter(bool) C++: virtual void SetJitter(bool _arg) Set Random jitter of the nodes at initialization to on or off. Note: It's strongly recommendation to have jitter ON even if you have initial coordinates in your graph. Default is ON GetJitterV.GetJitter() -> bool C++: virtual bool GetJitter() Set Random jitter of the nodes at initialization to on or off. Note: It's strongly recommendation to have jitter ON even if you have initial coordinates in your graph. Default is ON SetRestDistanceV.SetRestDistance(float) C++: virtual void SetRestDistance(float _arg) Manually set the resting distance. Otherwise the distance is computed automatically. GetRestDistanceV.GetRestDistance() -> float C++: virtual float GetRestDistance() Manually set the resting distance. Otherwise the distance is computed automatically. InitializeV.Initialize() C++: void Initialize() override; This strategy sets up some data structures for faster processing of each Layout() call LayoutV.Layout() C++: void Layout() override; This is the layout method where the graph that was set in SetGraph() is laid out. The method can either entirely layout the graph or iteratively lay out the graph. If you have an iterative layout please implement the IsLayoutComplete() method. IsLayoutCompleteV.IsLayoutComplete() -> int C++: int IsLayoutComplete() override; I'm an iterative layout so this method lets the caller know if I'm done laying out the graph vtkGraphLayoutStrategyvtkObjectvtkObjectBaseOP `!'a!!a!@a!a!P a ! a !` a ! a!!p!0aP!!!a!0a !!!@!zRx $OAC $D AC $lAC B$XAC G$'AC I$AC G$ AC G$4hAC I$\0AC G$AC I$PAC G$ؼAC I$AC G$$(AC I$LAC G$tHAC I$AC G$AC I$0AC G$ AC I$<AC G$dHAC G$AC G$xAC I$pAC G$AC G$,AC G$T8AC I$|AC G$AC I$PAC G$AC G$pAC G$DAC G(-&-=-&-|?-R%;=&- =-&-H-?-u;=i&-Y=-A&-<F-?-'-&-=-&-\?-2 ;=&-=-&-C-n?-D$-&-=-&-?-k;=_&-?=-'&-A-?-v'-g&-R=-:&- ?-'-&-=-y&-oL?-"'-&-=-&-?-bF;=:&-=-&-B-n?-D'-&-=-&-?-Y'-J&-1=-&-?-'-&-l=-T&-,?-;=&-=-&-g=C-?-  (- &- =- &-\ ?-2  (- &- =- &- ?-t F (-9 &-& =- &- ?-  ;= &-n =-T &-% D- ?-  (- &- =-o &-L ?-"  (- &- =- &- ?-d 6 (-) &- =-&-?-;=|&-^=-D&-D-?-(-&-w=-_&-<?-(-&-=-&-~?-T&(-&-=-&-?-x;=l&-N=-4&-D-?-6-o2-c0-SE-F&-<=-&&-?-E-&-s=-Y&-E->- (-&-=-<-I-zoI-gVI-N5@-?-=-(-&-}<-qI-i^I-VEI-=.@-:-%-,-9-.-zslVG-IB,-=6/9-'!.-xh!`XH @8( xh`XH@8( xh`XH@8(     xh `XH@8( @)8438/+*7X501- `@ `@ `@ `@ R vPi k;   B@- aP    `   h  p7 0" Pu 4lu 0  6 @`Zl})y_;7O&)vVL _PyVTKAddFile_vtkSimple2DLayoutStrategy_PyType_Ready_PyvtkGraphLayoutStrategy_ClassNew_PyvtkSimple2DLayoutStrategy_ClassNew_PyVTKObject_New__ZL37PyvtkSimple2DLayoutStrategy_StaticNewv__ZN25vtkSimple2DLayoutStrategy3NewEv__ZN25vtkSimple2DLayoutStrategy6LayoutEv__ZN25vtkSimple2DLayoutStrategy10InitializeEv_PyVTKObject_GetSet__Py_NoneStruct_PyVTKObject_GetObject__ZL35PyvtkSimple2DLayoutStrategy_Methods_PyObject_GenericSetAttr_PyObject_GenericGetAttr_PyVTKObject_Repr_PyVTKObject_AsBuffer_strcmp_PyObject_GC_Del_PyVTKObject_Check__ZN13vtkPythonArgs13ArgCountErrorEii__ZN13vtkPythonArgs8GetValueERi_PyBool_FromLong_PyLong_FromLong_PyDict_SetItemString_PyVTKObject_String_PyVTKObject_SetFlag__ZN13vtkPythonArgs8GetValueERf_PyVTKObject_Delete_PyVTKObject_Traverse__ZN13vtkPythonUtil20GetObjectFromPointerEP13vtkObjectBase__ZL32PyvtkSimple2DLayoutStrategy_Type_PyType_Type_PyFloat_FromDouble_PyErr_Occurred_PyVTKClass_Add__ZN13vtkPythonArgs8GetValueERd__Py_Dealloc__ZN13vtkPythonArgs8GetValueERPc__ZN13vtkObjectBase8IsTypeOfEPKc__ZN13vtkPythonArgs17GetArgAsVTKObjectEPKcRb__ZN13vtkPythonArgs8GetValueERb__ZN13vtkPythonArgs19GetSelfFromFirstArgEP7_objectS1___ZL50PyvtkSimple2DLayoutStrategy_SetIterationsPerLayoutP7_objectS0___ZL50PyvtkSimple2DLayoutStrategy_GetIterationsPerLayoutP7_objectS0___ZL34PyvtkSimple2DLayoutStrategy_LayoutP7_objectS0___ZL40PyvtkSimple2DLayoutStrategy_SafeDownCastP7_objectS0___ZL52PyvtkSimple2DLayoutStrategy_SetMaxNumberOfIterationsP7_objectS0___ZL52PyvtkSimple2DLayoutStrategy_GetMaxNumberOfIterationsP7_objectS0___ZL37PyvtkSimple2DLayoutStrategy_SetJitterP7_objectS0___ZL37PyvtkSimple2DLayoutStrategy_GetJitterP7_objectS0___ZL36PyvtkSimple2DLayoutStrategy_IsTypeOfP7_objectS0___ZL38PyvtkSimple2DLayoutStrategy_InitializeP7_objectS0___ZL58PyvtkSimple2DLayoutStrategy_GetIterationsPerLayoutMaxValueP7_objectS0___ZL60PyvtkSimple2DLayoutStrategy_GetMaxNumberOfIterationsMaxValueP7_objectS0___ZL51PyvtkSimple2DLayoutStrategy_GetCoolDownRateMaxValueP7_objectS0___ZL57PyvtkSimple2DLayoutStrategy_GetInitialTemperatureMaxValueP7_objectS0___ZL49PyvtkSimple2DLayoutStrategy_GetRandomSeedMaxValueP7_objectS0___ZL58PyvtkSimple2DLayoutStrategy_GetIterationsPerLayoutMinValueP7_objectS0___ZL60PyvtkSimple2DLayoutStrategy_GetMaxNumberOfIterationsMinValueP7_objectS0___ZL51PyvtkSimple2DLayoutStrategy_GetCoolDownRateMinValueP7_objectS0___ZL57PyvtkSimple2DLayoutStrategy_GetInitialTemperatureMinValueP7_objectS0___ZL49PyvtkSimple2DLayoutStrategy_GetRandomSeedMinValueP7_objectS0___ZL44PyvtkSimple2DLayoutStrategy_IsLayoutCompleteP7_objectS0___ZL43PyvtkSimple2DLayoutStrategy_SetCoolDownRateP7_objectS0___ZL43PyvtkSimple2DLayoutStrategy_GetCoolDownRateP7_objectS0___ZL49PyvtkSimple2DLayoutStrategy_SetInitialTemperatureP7_objectS0___ZL49PyvtkSimple2DLayoutStrategy_GetInitialTemperatureP7_objectS0___ZL39PyvtkSimple2DLayoutStrategy_NewInstanceP7_objectS0___ZL43PyvtkSimple2DLayoutStrategy_SetRestDistanceP7_objectS0___ZL43PyvtkSimple2DLayoutStrategy_GetRestDistanceP7_objectS0___ZL41PyvtkSimple2DLayoutStrategy_SetRandomSeedP7_objectS0___ZL41PyvtkSimple2DLayoutStrategy_GetRandomSeedP7_objectS0___ZL31PyvtkSimple2DLayoutStrategy_IsAP7_objectS0_