# encoding: utf-8 # module vtkmodules.vtkInfovisLayout # from C:\Users\xukai\Downloads\发票2\venv\Lib\site-packages\vtkmodules\vtkInfovisLayout.cp311-win_amd64.pyd # by generator 1.147 # no doc # imports import vtkmodules.vtkCommonCore as __vtkmodules_vtkCommonCore import vtkmodules.vtkCommonExecutionModel as __vtkmodules_vtkCommonExecutionModel class vtkGraphLayoutStrategy(__vtkmodules_vtkCommonCore.vtkObject): """ vtkGraphLayoutStrategy - abstract superclass for all graph layout strategies Superclass: vtkObject All graph layouts should subclass from this class. vtkGraphLayoutStrategy works as a plug-in to the vtkGraphLayout algorithm. The Layout() function should perform some reasonable "chunk" of the layout. This allows the user to be able to see the progress of the layout. Use IsLayoutComplete() to tell the user when there is no more layout to perform. @par Thanks: Thanks to Brian Wylie from Sandia National Laboratories for adding incremental layout capabilities. """ def GetEdgeWeightField(self): # real signature unknown; restored from __doc__ """ GetEdgeWeightField(self) -> str C++: virtual char *GetEdgeWeightField() """ return "" def GetNumberOfGenerationsFromBase(self, type): # real signature unknown; restored from __doc__ """ GetNumberOfGenerationsFromBase(self, type:str) -> int C++: vtkIdType GetNumberOfGenerationsFromBase(const char *type) override; Given the name of a base class of this class type, return the distance of inheritance between this class type and the named class (how many generations of inheritance are there between this class and the named class). If the named class is not in this class's inheritance tree, return a negative value. Valid responses will always be nonnegative. This method works in combination with vtkTypeMacro found in vtkSetGet.h. """ return 0 def GetNumberOfGenerationsFromBaseType(self, type): # real signature unknown; restored from __doc__ """ GetNumberOfGenerationsFromBaseType(type:str) -> int C++: static vtkIdType GetNumberOfGenerationsFromBaseType( const char *type) Given a the name of a base class of this class type, return the distance of inheritance between this class type and the named class (how many generations of inheritance are there between this class and the named class). If the named class is not in this class's inheritance tree, return a negative value. Valid responses will always be nonnegative. This method works in combination with vtkTypeMacro found in vtkSetGet.h. """ return 0 def GetWeightEdges(self): # real signature unknown; restored from __doc__ """ GetWeightEdges(self) -> bool C++: virtual bool GetWeightEdges() """ return False def Initialize(self): # real signature unknown; restored from __doc__ """ Initialize(self) -> None C++: virtual void Initialize() This method allows the layout strategy to do initialization of data structures or whatever else it might want to do. """ pass def IsA(self, type): # real signature unknown; restored from __doc__ """ IsA(self, type:str) -> 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. """ return 0 def IsLayoutComplete(self): # real signature unknown; restored from __doc__ """ IsLayoutComplete(self) -> int C++: virtual int IsLayoutComplete() If your concrete class is iterative than you should overload IsLayoutComplete() otherwise it simply returns 1 by default; """ return 0 def IsTypeOf(self, type): # real signature unknown; restored from __doc__ """ IsTypeOf(type:str) -> 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. """ return 0 def Layout(self): # real signature unknown; restored from __doc__ """ Layout(self) -> None C++: virtual void Layout() 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. """ pass def NewInstance(self): # real signature unknown; restored from __doc__ """ NewInstance(self) -> vtkGraphLayoutStrategy C++: vtkGraphLayoutStrategy *NewInstance() """ return vtkGraphLayoutStrategy def SafeDownCast(self, o): # real signature unknown; restored from __doc__ """ SafeDownCast(o:vtkObjectBase) -> vtkGraphLayoutStrategy C++: static vtkGraphLayoutStrategy *SafeDownCast(vtkObjectBase *o) """ return vtkGraphLayoutStrategy def SetEdgeWeightField(self, field): # real signature unknown; restored from __doc__ """ SetEdgeWeightField(self, field:str) -> None C++: virtual void SetEdgeWeightField(const char *field) Set/Get the field to use for the edge weights. """ pass def SetGraph(self, graph): # real signature unknown; restored from __doc__ """ SetGraph(self, graph:vtkGraph) -> None C++: virtual void SetGraph(vtkGraph *graph) Setting the graph for the layout strategy """ pass def SetWeightEdges(self, state): # real signature unknown; restored from __doc__ """ SetWeightEdges(self, state:bool) -> None C++: virtual void SetWeightEdges(bool state) Whether to use edge weights in the layout or not. """ pass def __delattr__(self, *args, **kwargs): # real signature unknown """ Implement delattr(self, name). """ pass def __getattribute__(self, *args, **kwargs): # real signature unknown """ Return getattr(self, name). """ pass def __init__(self, *args, **kwargs): # real signature unknown pass @staticmethod # known case of __new__ def __new__(*args, **kwargs): # real signature unknown """ Create and return a new object. See help(type) for accurate signature. """ pass def __repr__(self, *args, **kwargs): # real signature unknown """ Return repr(self). """ pass def __setattr__(self, *args, **kwargs): # real signature unknown """ Implement setattr(self, name, value). """ pass def __str__(self, *args, **kwargs): # real signature unknown """ Return str(self). """ pass __this__ = property(lambda self: object(), lambda self, v: None, lambda self: None) # default """Pointer to the C++ object.""" __dict__ = None # (!) real value is 'mappingproxy({\'__vtkname__\': \'vtkGraphLayoutStrategy\', \'IsTypeOf\': , \'IsA\': , \'SafeDownCast\': , \'NewInstance\': , \'GetNumberOfGenerationsFromBaseType\': , \'GetNumberOfGenerationsFromBase\': , \'SetGraph\': , \'Initialize\': , \'Layout\': , \'IsLayoutComplete\': , \'SetWeightEdges\': , \'GetWeightEdges\': , \'SetEdgeWeightField\': , \'GetEdgeWeightField\': , \'__new__\': , \'__repr__\': , \'__str__\': , \'__getattribute__\': , \'__setattr__\': , \'__delattr__\': , \'__dict__\': , \'__this__\': , \'__doc__\': \'vtkGraphLayoutStrategy - abstract superclass for all graph layout\\nstrategies\\n\\nSuperclass: vtkObject\\n\\nAll graph layouts should subclass from this class. \\nvtkGraphLayoutStrategy works as a plug-in to the vtkGraphLayout\\nalgorithm. The Layout() function should perform some reasonable\\n"chunk" of the layout. This allows the user to be able to see the\\nprogress of the layout. Use IsLayoutComplete() to tell the user when\\nthere is no more layout to perform.\\n\\n@par Thanks: Thanks to Brian Wylie from Sandia National Laboratories\\nfor adding incremental layout capabilities.\\n\\n\'})' __vtkname__ = 'vtkGraphLayoutStrategy'