tulip module API

Utility functions

Graph management

tlp.newGraph()

Creates and returns a new empty graph.

Return type:tlp.Graph
tlp.loadGraph(filename)

Loads a graph in the tlp format from a file (extension can be .tlp or .tlp.gz). Returns a new graph or None if the import fails.

Parameters:filename (string) – the path to the tlp file
Return type:tlp.Graph
tlp.saveGraph(graph, filename)

Saves a graph to a file in the tlp format. Extension of the destination file can be either .tlp (raw export) or .tlp.gz (compressed export). Returns True if the graph has been successfully saved.

Parameters:
  • graph (tlp.Graph) – the graph to export
  • filename (string) – the path to the destination file
Return type:

boolean

tlp.importGraph(importPluginName[, dataSet, newGraph = None])

Imports a graph using a Tulip import plugin (must be loaded). Returns a new graph or None if the import fails.

Parameters:
  • importPluginName (string) – the name of the Tulip import plugin
  • dataSet (tlp.DataSet) – a dataset filled with parameters to transmit to the import plugin
  • newGraph (tlp.Graph) – if provided, add imported graph elements in that graph
Return type:

tlp.Graph

Throws :

an exception if the requested import plugin is not registered in the plugins database.

tlp.exportGraph(exportPluginName, graph, outputFilePath[, dataSet])

Exports a graph to a file using a Tulip export plugin (must be loaded).

Parameters:
  • graph (tlp.Graph) – the graph to export
  • outputFilePath (string) – the path of the file the export plugin will write to
  • exportPluginName (string) – the name of the Tulip export plugin to execute
  • dataSet (tlp.DataSet) – a dataset filled with parameters to transmit to the export plugin
Return type:

boolean

Throws :

an exception if the requested export plugin is not registered in the plugins database.

Warning

If you are using the bindings through the classical Python interpreter, Tulip plugins must be loaded in order to be able to call import modules (see Loading Tulip plugins)).

tlp.copyToGraph(outGraph, inGraph[, inSelection = None, outSelection = None])

Appends the selected part of a graph (properties, nodes and edges) into another one. If no selection is done, the whole input graph graph is appended. The output selection is used to select the appended nodes & edges

Parameters:
  • outGraph (tlp.Graph) – the graph on which to append elements
  • inGraph (tlp.Graph) – the graph to append
  • inSelection (tlp.BooleanProperty) – boolean property attached to inGraph, only selected elements will be appended if provided
  • outSelection (tlp.BooleanProperty) – boolean property attached to outGraph, appended nodes and edges will be selected if provided

Warning

The input selection is extended to all selected edge ends.

tlp.removeFromGraph(inGraph[, inSelection = None])

Removes the selected part of a graph (properties values, nodes and edges). If no selection is done, the whole graph is reseted to default value.

Parameters:
  • inGraph (tlp.Graph) – the graph on which to remove elements
  • inSelection (tlp.BooleanProperty) – boolean property attached to inGraph, only selected elements will be removed if provided

Warning

The selection is extended to all selected edge ends.

Graph measures and functions

tlp.averagePathLength(graph)

Returns the average path length of a graph, that is the sum of the shortest distances for all pair of distinct nodes in that graph divided by the number of those pairs. For a pair of non connected nodes, the shorted distance is set to 0.

Parameters:graph (tlp.Graph) – the graph on which to compute the average path length
Return type:float
tlp.averageClusteringCoefficient(graph)

Returns the clustering coefficient of a graph as the average of the local clustering coefficients (see tlp.clusteringCoefficient()) of all the nodes.

Parameters:graph (tlp.Graph) – the graph on wich to compute the average clustering coefficient
Return type:float
tlp.clusteringCoefficient(graph, result[, maxDepth = 1])

Assigns to each node its local clustering coefficient that is the proportion of edges between the nodes within its neighbourhood divided by the number of edges that could possibly exist between them. This quantifies how close its neighbors are to being a clique.

Parameters:
  • graph (tlp.Graph) – the graph on which to compute the clustering coefficient for each node
  • result (tlp.DoubleProperty) – a graph property in which the results will be stored
  • maxDepth (integer) – the maximum distance between each node and its neighbours.
tlp.dagLevel(graph, result)

Assigns to each node of a Directed Acyclic Graph a level such that if the edge e(u,v) exists level(u) < level(v). The algorithm ensures that the number of level used is minimal.

Parameters:
  • graph (tlp.Graph) – the graph on which to compute the dag level
  • result (tlp.IntegerProperty) – a graph property in which the results will be stored

Warning

The graph must be acyclic (no self loops).

tlp.minDegree(graph)

Returns the minimum degree of the graph’s nodes.

Parameters:graph (tlp.Graph) – the graph on which to compute the minimum degree
Return type:integer
tlp.maxDegree(graph)

Returns the maximum degree of the graph’s nodes.

Parameters:graph (tlp.Graph) – the graph on which to compute the maximum degree
Return type:integer
tlp.maxDistance(graph, node, result, direction)

Computes the distances from a node to all the other nodes of a graph and return the maximum one.

Parameters:
  • graph (tlp.Graph) – the graph on which to compute the maximum distance
  • node (tlp.node) – an existing graph node
  • result (tlp.IntegerProperty) – a graph property in which the results will be stored
  • direction (tlp.DIRECTED, tlp.INV_DIRECTED, tlp.UNDIRECTED) – specify if the graph must be directed or not
Return type:

integer

Throws :

an exception if the node does not belong to the graph

tlp.reachableNodes(graph, startNode, maxDistance, direction)

Returns the nodes that can be reached from a node, according to a direction, at distance less or equal to a maximum one.

Parameters:
  • graph (tlp.Graph) – the graph to work on
  • startNode (tlp.node) – an existing graph node
  • maxDistance (integer) – the maximum distance to reach nodes
  • direction (tlp.DIRECTED, tlp.INV_DIRECTED, tlp.UNDIRECTED) – specify if the graph must be directed or not
Return type:

set of tlp.node

Throws :

an exception if the node does not belong to the graph

tlp.bfs(graph[, root])

New in version 4.2.

Performs a breadth-first search on a graph and returns a list containing the nodes of the graph in the order they have been visited.

Parameters:
  • graph (tlp.Graph) – The graph to traverse with a BFS.
  • root (tlp.node) – The node from whom to start the BFS. If not provided, the root node will be assigned to a source node in the graph (node with input degree equals to 0). If there is no source node in the graph, a random node will be picked.
Return type:

list of tlp.node

Throws :

an exception if the provided root node does not belong to the graph.

tlp.dfs(graph[, root])

New in version 4.2.

Performs a depth-first search on a graph and returns a list containing the nodes of the graph in the order they have been visited.

Parameters:
  • graph (tlp.Graph) – The graph to traverse with a DFS.
  • root (tlp.node) – The node from whom to start the DFS. If not provided, the root node will be assigned to a source node in the graph (node with input degree equals to 0). If there is no source node in the graph, a random node will be picked.
Return type:

list of tlp.node

Throws :

an exception if the provided root node does not belong to the graph.

Geometry

tlp.computeBoundingBox(graph[, selection = None])

New in version 3.8.

Computes the bounding box of a graph according to nodes positions and edges bends defined in the default layout property “viewLayout”, nodes z-rotations defined in the default double property “viewRotation” and sizes of elements defined in the default size property “viewSize”.

Parameters:
  • graph (tlp.Graph) – the graph on which to compute its bounding box
  • selection (tlp.BooleanProperty) – a boolean property to restrain the computation of the bounding box to selected elements (if provided)
Return type:

tlp.BoundingBox

Throws :

an exception if the provided boolean property is not attached to the graph

tlp.computeBoundingBox(graph, layout, size, rotation[, selection = None])

Computes the bounding box of a graph according to nodes positions, edges bends, nodes z-rotations and sizes of elements.

Parameters:
  • graph (tlp.Graph) – the graph on which to compute its bounding box
  • layout (tlp.LayoutProperty) – a layout property containing positions of the graph elements
  • size (tlp.SizeProperty) – a size property containing the sizes of the graph elements.
  • rotation (tlp.DoubleProperty) – a double property containing the z-rotations of nodes
  • selection (tlp.BooleanProperty) – a boolean property to restrain the computation of the bounding box to selected elements (if provided)
Return type:

tlp.BoundingBox

Throws :

an exception if the provided properties are not attached to the graph

tlp.computeBoundingRadius(graph[, selection = None])

New in version 3.8.

Computes a bounding sphere (or a bounding circle if the graph has a 2D layout) of a graph according to nodes positions and edges bends defined in the default layout property “viewLayout”, nodes z-rotations defined in the default double property “viewRotation” and sizes of elements defined in the default size property “viewSize”.

Returns a tuple of tlp.Coord whose first member is the center of the bounding sphere (circle for 2D layout) and second member is the farthest point from the center (computed from graph elements positions). To get the bounding radius, you have to compute the distance between the two members of the tuple (use the tlp.Vec3f.dist() method).

Parameters:
  • graph (tlp.Graph) – the graph on which to compute its bounding sphere
  • selection (tlp.BooleanProperty) – a boolean property to restrain the computation of the bounding sphere to selected elements (if provided)
Return type:

(tlp.Coord, tlp.Coord)

Throws :

an exception if the provided boolean property is not attached to the graph

tlp.computeBoundingRadius(graph, layout, size, rotation[, selection = None])

Computes a bounding sphere (or a bounding circle if the graph has a 2D layout) of a graph according to node position edge bends node z-rotation, and size of elements.

Returns a tuple of tlp.Coord whose first member is the center of the bounding sphere (circle for 2D layout) and second member is the farthest point from the center (computed from graph elements positions). To get the bounding radius, you have to compute the distance between the two members of the tuple (use the tlp.Vec3f.dist() method).

Parameters:
  • graph (tlp.Graph) – the graph on which to compute its bounding sphere
  • layout (tlp.LayoutProperty) – a layout property containing positions of the graph elements
  • size (tlp.SizeProperty) – a size property containing the sizes of the graph elements.
  • rotation (tlp.DoubleProperty) – a double property containing the z-rotations of nodes
  • selection (tlp.BooleanProperty) – a boolean property to restrain the computation of the bounding sphere to selected elements (if provided)
Return type:

(tlp.Coord, tlp.Coord)

Throws :

an exception if the provided properties are not attached to the graph

tlp.computeConvexHull(points)

New in version 3.8.

Computes a convex hull of a set of points. Only works with 2D layouts. Returns a list of tlp.Coord containing the vertices of the points convex hull correctly ordered.

Parameters:points (:list of class:tlp.Coord) – the points on which to compute a conbex hull
Return type:list of tlp.Coord
tlp.computeConvexHull(graph[, selection = None])

New in version 3.8.

Computes a convex hull of a graph according to nodes positions and edges bends defined in the default layout property “viewLayout”, nodes z-rotations defined in the default double property “viewRotation” and sizes of elements defined in the default size property “viewSize”. Only works with 2D layouts. Returns a list of tlp.Coord containing the vertices of the graph convex hull correctly ordered.

Parameters:
  • graph (tlp.Graph) – the graph on which to compute its convex hull
  • selection (tlp.BooleanProperty) – a boolean property to restrain the computation of the convex hull to selected elements (if provided)
Return type:

list of tlp.Coord

Throws :

an exception if the provided boolean property is not attached to the graph

tlp.computeConvexHull(graph, layout, size, rotation[, selection = None])

Computes a convex hull of a graph according to nodes positions, edges bends, nodes z-rotations, and sizes of elements. Only works with 2D layouts. Returns a list of tlp.Coord containing the vertices of the graph convex hull correctly ordered.

Parameters:
  • graph (tlp.Graph) – the graph on which to compute its convex hull
  • layout (tlp.LayoutProperty) – a layout property containing positions of the graph elements
  • size (tlp.SizeProperty) – a size property containing the sizes of the graph elements.
  • rotation (tlp.DoubleProperty) – a double property containing the z-rotations of nodes
  • selection (tlp.BooleanProperty) – a boolean property to restrain the computation of the convex hull to selected elements (if provided)
Return type:

list of tlp.Coord

Throws :

an exception if the provided properties are not attached to the graph

tlp.convexHull2D(points)

New in version 4.2.

Computes the 2D convex hull of a list of points (the z-coordinate is not taken into acccount) using the Qhull library. Returns a list of indexes in the list of points defining the hull polygon in counterclockwise order.

Parameters:points (list of tlp.Coord) – the points on which to compute the 2D convex hull
Return type:list of integers
tlp.convexHull(points)

New in version 4.2.

Computes the 2D/3D convex hull of a list of points using the Qhull library. Returns a tuple whose first member is the list of facets defining the convex hull (segments for 2D, triangles for 3D) and second member is the list of neighbors facets for each facet. A facet is defined by a list of indexes in the list of points. The ith element of the neighbors list is a list of indexes in the facets list corresponding to the neighbors facets of the ith facet.

Parameters:points (list of tlp.Coord) – the points on which to compute the 2D/3D convex hull
Return type:(list of list of integers, list of list of integers)
tlp.computeLinesIntersection(line1, line2)

New in version 3.8.

Computes the intersection point (if any) of two 3d lines. Returns a tuple whose first member is a boolean indicating if the lines intersect (if False it means that lines are parallel or skew) and second member is the intersection point (if any).

Parameters:
  • line1 ((tlp.Coord , tlp.Coord)) – the coordinates of the two points defining the first line
  • line2 ((tlp.Coord , tlp.Coord)) – the coordinates of the two points defining the second line
Return type:

(boolean, tlp.Coord)

tlp.computePolygonCentroid(points)

New in version 3.8.

Computes the centroid of a polygon.

Parameters:points (list of tlp.Coord) – the vertices of the polygon correctly ordered
Return type:tlp.Coord
tlp.delaunayTriangulation(points)

New in version 3.8.

Computes the delaunay triangulation of a set of points and returns the set of delaunay edges and simplices (triangles in 2d, tetrahedra in 3d). Returns a tuple whose first member is the list of edges and second member is the list of simplices, or None if the triangulation failed. Edges and simplices are defined using indexes into the original list of points.

Parameters:points (list of tlp.Coord) – a list of points on which to compute a delaunay triangulation
Return type:(list of (integer, integer), list of integer) or None
class tlp.VoronoiDiagram

New in version 3.8.

That class defines a voronoi diagram. Use the tlp.voronoiDiagram() function to get an instance of it.

cell(cellIdx)

Returns the ith voronoi cell. A cell is defined by a list of indexes in the voronoi vertices.

Parameters:cellIdx (integer) – the index of the cell to return
Return type:set of integer
degreeOfVertex(vertexIdx)

Returns the degree (number of incident edges) of the ith voronoi vertex

Parameters:vertexIdx (integer) – the index of the vertex on which to return the degree
Return type:integer
edge(edgeIdx)

Returns the ith voronoi edge. An edge is defined by two indexes in the voronoi vertices.

Parameters:edgeIdx (integer) – the index of the edge to return
Return type:(integer, integer)
nbEdges()

Returns the number of voronoi edges.

Return type:integer
nbSites()

Returns the number of voronoi sites.

Return type:integer
nbVertices()

Returns the number of voronoi vertices.

Return type:integer
site(siteIdx)

Returns the ith voronoi site.

Parameters:siteIdx (integer) – the index of the site to return
Return type:tlp.Coord
vertex(vertexIdx)

Returns the ith voronoi vertex.

Parameters:vertexIdx (integer) – the index of the vertex to return
Return type:tlp.Coord
voronoiCellForSite(siteIdx)

Returns the cell associated to the ith site.

Parameters:siteIdx (integer) – the index of the site on which to return the cell
Return type:set of integer
voronoiEdgesForSite(siteIdx)

Returns the voronoi edges surrounding the ith site.

Parameters:siteIdx (integer) – the index of the site on which to return edges
Return type:list of (integer, integer)
tlp.voronoiDiagram(sites)

New in version 3.8.

Computes the voronoi diagram of a set of sites (for 2d and 3d layouts). It automatically computes the set of all voronoi vertices, edges and cells. In order to not have to deal with infinite voronoi rays, the input layout is enclosed in its convex hull in 2d or in its bounding box in 3d. It enables to have a connected voronoi cell for each input site.

Parameters:sites (list of tlp.Coord) – the sites from which to compute the voronoi diagram
Return type:tlp.VoronoiDiagram

Plugins Management

tlp.getTulipRelease()

Returns the current version number of Tulip in the form X.Y.Z, X being the major version, Y the minor version, and Z the patch version.

Return type:string
tlp.initTulipLib()

Looks for the Tulip plugins directory and fills the Tulip path variables : tlp.TulipLibDir, tlp.TulipPluginsPath, tlp.TulipBitmapDir. The plug-ins directory can be defined in different ways, given by order of prevalence:

  • the TLP_DIR environment variable, if it has a value
  • the appDirPath parameter, if it is not NULL
  • at that point, the Tulip paths will be retrieved from the path of the loaded Tulip shared library (you must dispose of a standard Tulip installation for that feature to work, meaning the relative path for the Tulip plugins folder to the Tulip libraries one must be ../lib/tulip/).
  • a fallback value of ‘C:/Tulip/lib/’ on windows, or ‘/usr/local/lib/’ on Unix.
tlp.loadPlugins()

Loads C++ plugins installed in the directories listed in the tlp.TulipPluginsPath variable (in the form “<path1>;<path2>” on windows and “<path1>:<path2>” on unix). The tlp.TulipPluginsPath can be initialized with standard Tulip directories by calling the tlp.initTulipLib() function.

tlp.loadPluginsFromDir(pluginsDir)

New in version 4.2.

Loads C++ and Python plugins installed in a specific directory.

tlp.loadPlugin(filename)

Loads a C++ plugin or a Python plugin from a specific file (shared library or Python source file). Returns True if the plugin was correctly loaded.

Parameters:filename (string) – the path to the shared library containing the Tulip plugin (file extension : .so on linux, .dylib on mac, .dll on windows)
Return type:boolean
tlp.loadPluginsCheckDependencies()

Checks the dependencies of all C++ plugins loaded so far. If a plugin does not have all its dependencies fulfilled, it is unloaded and removed from the current plugins database.

tlp.getDefaultPluginParameters(pluginName[, graph = None])

Returns a dataset filled with default parameters (if any) for a given plugin (algorithm, import, property algorithm, ...).

Parameters:
  • pluginName (string) – the name of the plugin on which to retrieve its default parameters
  • graph (tlp.Graph) – if provided, property parameters will be retrieved from the graph if they exist
Return type:

tlp.DataSet

tlp.getImportPluginsList()

Return a list containing the names of the import plugins (written in C++ or Python) loaded so far. Import plugins are objects implementing the tlp::ImportModule interface in C++ or the tlp.ImportModule interface in Python.

Return type:list of string
tlp.getExportPluginsList()

Return a list containing the names of the export plugins (written in C++ or Python) loaded so far. Export plugins are objects implementing the tlp::ExportModule interface in C++ or the tlp.ExportModule interface in Python.

Return type:list of string
tlp.getAlgorithmPluginsList()

Return a list containing the names of the algorithm plugins (written in C++ or Python) loaded so far. Algorithm plugins are objects implementing the tlp::Algorithm interface in C++ or the tlp.Algorithm interface in Python.

Return type:list of string
tlp.getBooleanAlgorithmPluginsList()

Return a list containing the names of the boolean algorithm plugins (written in C++ or Python) loaded so far. Boolean algorithm plugins are objects implementing the tlp::BooleanAlgorithm interface in C++ or the tlp.BooleanAlgorithm interface in Python.

Return type:list of string
tlp.getColorAlgorithmPluginsList()

Return a list containing the names of the color algorithm plugins (written in C++ or Python) loaded so far. Color algorithm plugins are objects implementing the tlp::ColorAlgorithm interface in C++ or the tlp.ColorAlgorithm interface in Python.

Return type:list of string
tlp.getDoubleAlgorithmPluginsList()

Return a list containing the names of the double algorithm plugins (written in C++ or Python) loaded so far. Double algorithm plugins are objects implementing the tlp::DoubleAlgorithm interface in C++ or the tlp.DoubleAlgorithm interface in Python.

Return type:list of string
tlp.getIntegerAlgorithmPluginsList()

Return a list containing the names of the integer algorithm plugins (written in C++ or Python) loaded so far. Integer algorithm plugins are objects implementing the tlp::IntegerAlgorithm interface in C++ or the tlp.IntegerAlgorithm interface in Python.

Return type:list of string
tlp.getLayoutAlgorithmPluginsList()

Return a list containing the names of the layout algorithm plugins (written in C++ or Python) loaded so far. Layout algorithm plugins are objects implementing the tlp::LayoutAlgorithm interface in C++ or the tlp.LayoutAlgorithm interface in Python.

Return type:list of string
tlp.getSizeAlgorithmPluginsList()

Return a list containing the names of the size algorithm plugins (written in C++ or Python) loaded so far. Size algorithm plugins are objects implementing the tlp::SizeAlgorithm interface in C++ or the tlp.SizeAlgorithm interface in Python.

Return type:list of string
tlp.getStringAlgorithmPluginsList()

Return a list containing the names of the string algorithm plugins (written in C++ or Python) loaded so far. String algorithm plugins are objects implementing the tlp::StringAlgorithm interface in C++ or the tlp.StringAlgorithm interface in Python.

Return type:list of string

Graph elements classes

tlp.node

class tlp.node

An instance of this class represent a node in a Tulip graph. It encapsulates an integer identifier. Use specific methods in the tlp.Graph class to get references on such objects ( for instance tlp.Graph.addNode(), tlp.Graph.getNodes(), tlp.Graph.getOutNodes(), ...). Node objects can be used as keys in a Python dictionnary.

The node identifier can be accessed through the id class member.

isValid()

Returns True if the node is a valid one, meaning it is attached to a graph.

Return type:boolean

tlp.edge

class tlp.edge

An instance of this class represent an edge in a Tulip graph. It encapsulates an integer identifier. Use specific methods in the tlp.Graph class to get references on such objects ( for instance tlp.Graph.addEdge(), tlp.Graph.getEdges(), tlp.Graph.getInEdges(), ...). Edge objects can be used as keys in a Python dictionnary.

The edge identifier can be accessed through the id class member.

isValid()

Returns True if the edge is a valid one, meaning it is attached to a graph.

Return type:boolean

The tlp.Graph class

class tlp.Graph

This is the main Tulip class. It enables to :

  • create a directed graph
  • create and manipulate a sub-graphs hierarchy
  • get semantic iterators on graph elements
  • create and retrieve properties of different types to get/set data on the graph

This class can not be instanced directly. Use tlp.newGraph() to create a new empty graph.

Modification of the graph structure

tlp.Graph.clear()

Remove all nodes, edges and subgraphs from the graph .

tlp.Graph.addNode()

Adds a new node in the graph and returns it. This node is also added in all the graph’s ancestors to maintain the sub-graph relation between graphs.

Return type:tlp.node
tlp.Graph.addNodes(nbNodes)

New in version 3.7.

Adds new nodes in the graph and returns them in a list. The new nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

Parameters:nbNodes (integer) – the number of nodes to add in the graph
Return type:list of tlp.node

Warning

the addedNodes vector is cleared before adding nodes.

tlp.Graph.addNode(node)

Adds an existing node in the graph. This node is also added in all the graph ancestors to maintain the sub-graph relation between graphs.

Parameters:node (tlp.node) – an existing node to add to the graph
Throws :an exception if the node does not belong to the root graph

Warning

The node must be an element of the graph hierarchy, thus it must be an element of the root graph.

Warning

One can’t add an existing node to the root graph.

tlp.Graph.addNodes(itNodes)

New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

Parameters:itNodes (a Tulip iterator on tlp.node objects) – an iterator on nodes to add
Throws :an exception if one of the node to add is not an element of the root graph.

Warning

The added nodes must be elements of the graph hierarchy, thus they must be elements of the root graph.

Warning

One can’t add existing nodes to the root graph.

tlp.Graph.delNode(node[, deleteInAllGraphs = False])

Deletes a node in the graph. This node is also removed n

tlp.node

tlp.node Parameters:Parameters:<
s=".edge.isValid"> isValid()]gethods=lp.Graph">ss="xref py py-class docutils literaovided, property param">tlp.node) &# an exis="first last"> lp.node"> l

One can’t ad root graph.

tlp.Graph.delNode tlp.Graph.addNodes(nbNodes), dtt>addNodes)k to this delip.tleaderlink" ref="#tulip.tlp.Graph.delNode" title="Permalink to this definition">¶

Deletes a node in the graph. This node is also removed n

tlp.node

tlp.node Parameters:itNodes (a Tulip iterator on addNoderence iarameters:<
s=".edge.isValid"> isValid()addNodes ss="xref py py-class docutils literaovided, property param">tlp.node objects) – a must be elem>

WarningEtlp-edge"er) tgt

tlpclassnam/tt>addNodrlink" hrg>()

Adds a new node in the graph and returns it. This node is also added in all the graph’s ancestors to maintain the sub-grclass="headlph. This node is also removed n

tlp.node Parameters:tlp.nodtlpclas iarameters: Parameters: detlp.nodtlpclas iarameaph">tlp.Graph) – if provided, propertrame="void" rules="none"> tlp.Grafield">Parameters:clas ild-body">

/strong>o class= de) &# an exis="first last"> e/a>l-e/tr>

tlp.Graph.addNodes(nbNodes4.5s="descclassname">tlp.Graph.aph.(itNodes)

New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

nbNodes (integer) – the numberef py py-class docutie">tlp.Grafield">clas ild-body">

(a Tulip iteraliteral"Nodaph.tlp.norlinkpan> objects) – an iterator= tlp.norlinlp.Gts="iiv> objects) – a must be nodes to add

Parameters:
Throws :an exception if one rlinlp node to add is not an element of the root graph.

Warning

The added nodes must be elements of the graph hiaph.

Adds a new node in the graph and returns it. This node is also added in all the graph’s ancestors to maintain the sub-graph relation between graphs.

tlp.Grafield">clas ild-body">

noderlinkode) – an ey> <="pre"> class=ass=tardt> detlp.norlinkts

Parameters:
Throws :an exception irlink exception if the node does not belong to the root graph

Warning

The node must be an element of the graph hierarlinkpanus it must be an element of the root graph.

WarningEtlpl

One canE/a>l-e/tr>

tlp.Graph.aph.(itNodes)

New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

l-e"none"> tlp.Grafield">clas ild-body">

(a Tulip iterator on aph.tlp.norlinkpan> objects) – an iterator= tlp.norlinlp.Gts="iiv> objects) – a must be nodes to add

Parameters:
Throws :an exception if one rlinlp node to add is not an element of the root graph.

WarnninE/dd-edge"er) clas idNod root graph.

tlp.Graph.delNoE/a>
, den.classnam/tt>addNodrlink" hrg>(])

oraphh.New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

tlp.node

tlp.Grafield">clas ild-body">

Parameters:<

s=".edge.isValid"> isValid()ss="xref py py-class docutils literaovided, property param">rlinkode) &# an exis="first last">lp.node">l

One canE/a>l-e/tr> root graph.

tlp.Graph.delNoE/a>p.tlp.Graph.addNodes"> tlp.Graph.addNodes(nbNodes), daph.aph.)k to this delip.tleaderlink" ref="#tulip.tlp.Graph.delNode" title=" me">oraphh.New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

Parameters:

tlp.nodel-e"none">

tlp.Grafield">clas ild-body">

(a Tulip iterator on aph.Parameters:<

lip iterI=".edge.isValid"> isValid()aph.
lip iterme="void"lp.Graph">ss="xref py py-class docutils literaovided, property param">tlp.norlinkpan
objects) – a mustxis="first last"> e/a>l-e/tr>
Parameters:
coraph">tlp.norlinlparounddeleteI>addNod> Thjac) &#rlinlp ot eleteInwi>]coraphp.tlp.ph.nbNodrlinlpgiv"headep New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

tlp.node

clas ild-body">

nbNodrlinlpThjac) &#/a>) &#

Parameters:l-e"none"> nbNodes (integer) – the numberef py py-class docutie">tlp.Grafield">Parameters:ss="xref py py-class docutils literaovided, property param">tlp.node) &# an exis="first last"> e/a>1to th/dl> e/a>2-e/tr>
nbNodeleteI>s="versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

tlp.node

tlp.Grafield">clas ild-body">

) &#

tlp.Grafield">clas ild-body">

) &#

clas idNo/dl>
Parameters:ns=lp.Grters:1
Parameters:2
Parameters:ss="xref py py-class docutils literaovided, property param">tlp.na clae">tlp.norlinlpode) &# an exis="first last">
c class= fe graph hierarlin>s="versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

tlp.node

tlp.Grafield">clas ild-body">

<

clas idNo/dl> tgt
Parameters:
Parameters:tlp.noclas iarameaph">ss="xref py py-class docutils literaovided, property param">rlink tlp.node) &# an exis="first last">p.node">-edge"er)
p/h3>
ctardt> fe graph hierarlin>s="versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

tlp.node

tlp.Grafield">clas ild-body">

de

clas idNo/dl> tgt
Parameters:
Parameters: detlp.norlin iarameaph">ss="xref py py-class docutils literaovided, property param">rlink ) &# an exis="first last">
class=ass=tardt> fe graph hierarlin>s="versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

tlp.node

tlp.Grafield">clas ild-body">

de<

clas idNodes vector istable>
cemantiraph()ctardt> ass=t">ctardt> becomerty">c class>s="versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

Parameters:
Parameters:tlp.noclas iarameters:
Parameters: detlp.norlin iarameaph">ss="xref py py-class docutils literaovided, property param">rlink tlp.node) &# an exis="first last">
tlp.Grafield">clas ild-body">

cemantirap.ss="xref py py-class docutils litera">rlinkode) &# an exi nodes to add

)ad py-func docutilst class=- of the rcnclass="pre"Cly. :tlp.newGraph()
)

MoaddSub

Mp.node">

clah= ⪭un clad⪭d="tulip.tlp.Graph.delNode"> tlp.Graph.deaddSub

Mp="method">
tlpn>)a

tlpn>) )New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

Parameters:
Throws :an exception ioraphh.) &#ges"r element of the r>addus, bydchanghis defioraphh.

tlp.node

tlp.Grafield">Be="voiPlass">< ild-body">

me"> clah> tllyctly. U>tlp.Graph) – if provided, property paramdge" title="Permalink to this definition">¶

An instance of this class represent an edge in a Tulip graph. It encapsulates an integer identifier. Use sxis="first last"> cla-e/tr>

tlp clad"n>)class
New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

Parameters:
me"> clah> tllyctly. U>tlp.Graph) – if proge" title="Permalink to this definition">¶

An instance of this class represent an edge in a Tulip graph. It encapsulates an integer identifier. Use sxirst last"> clah= ⪭un clad⪭d="tu/dl> ="pSiblh.tlp.Graph.deaddC/tteSub

Mptlp.Graph.addNodes"> tlp.Graph.addNodes(nbNodes4.5s="descclassnameCly. .<"descname"tt class/>class
par) –s
coink" sme>]New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

tlp.node

me"> clah> tllyctly. U> s="trualinkiblh.class
]ctly. U>;me"tt class/>class
tlp.Graph) – if provided, property paramdge" title="Permalink to this definition">¶

An instance of this class represent an edge in a Tulip graph. It encapsulates an integer identifier. Use sxis="first last">Mp.node">M217;t add existing nodes Set

Mp="method">
tlpn>)n>)]]New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

nbNrdte a"fi>
Parameters:cinduced n>)< it class="xref py py-class docutils literal">tlp.Graph) – if proge" title="Permalink to this definition">¶

An instance of this class represent an edge in a Tulip graph. It encapsulates an integer identifier. Use sxirst last">Mp.node">M217;t add existing nott class

Mp/h3>
, )class
Mlp/h3>
, )class
])New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

)Mp.node">M217;t add existing
Mp="method">
New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if proge" title="Permalink to this definition">¶

An instance of this class represent an edge in a Tulip graph. It encapsulates an integer identifier. Use sxirst last"> p.node"> 217;t add existing

p="method">
New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if proge" title="Permalink to this definition">¶

An instance of this class represent an edge in a Tulip graph. It encapsulates an integer identifier. Use sxirst last">Mp.node">M217;t add existing nottper

M21eld>

Mp="method">
cpar) – class= (useodesy car)fully). Sttt>ard users=nhouls=nedes useulip.t
lass="asionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

tlppar) &#f lementine/spa of the rlasrst last">Mlp.node">Ml217;t add existing
Mlp/h3>
])New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prcol class="field-name" />

An instance of this class represent an edge in a Tulip graph. It encapsulates an integer identifier. Use song> (a first last">Mp.node">M217;t add existing noclass

Mp/h3>
isValid()ig>))New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

) – if prme="void"rst last">ant

Mp.node">ant

M217;t add existing noclass

ant

Mp/h3>
isValid()ig>)ant/>class
New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

) – if prme="void"rst last">Mp.node">M217;t add existing noid
Mp="method">
corresponlp.noidbNrd.edge.isValid"> isValid()New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

rmalink ie internal" href="#tulip.tlp.node" title="tulip.tlp.node">) – if proge" title="Permalink to this definition">¶

An instance of this class represent an edge in a Tulip graph. It encapsulates an integer identifier. Use sbNrd.edge.isValid"> isValid(M217;t add existing no cla-e/tr>

corresponlp.no clah>rd.edge.isValid"> isValid()New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

te"> clah> )) – if proge" title="Permalink to this definition">¶

An instance of this class represent an edge in a Tulip graph. It encapsulates an integer identifier. Use sbNrd.edge.isValid"> isValid(ant

Mp.node">ant

M217;t add existing noid

ant

Mp/h3>
cepanet>ant/ig>)corresponlp.noidbNrd.edge.isValid"> isValid(ant/wi) prea clalass="asionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

rmalink ie internal" href="#tulip.tlp.node" title="tulip.tlp.node">) – if proge" title="Permalink to this definition">¶

An instance of this class represent an edge in a Tulip graph. It encapsulates an integer identifier. Use sbNrd.edge.isValid"> isValid(Mp.node">M217;t add existing no

Mptlp.Graph.addNodes"> tlp.Graph.addNodes(nbNodes)cnulitt class/>rd.edge.isValid"> isValid(chpn>) tlp.s) &/dl> ,ulip.t

=nhouls=> i = 0 f Ml(): ifii++ == n: bs=aph.ds< s=aph.dNist b>New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

t">cindexh> )) – if proge" title="Permalink to this definition">¶

An instance of this class represent an edge in a Tulip graph. It encapsulates an integer identifier. Use sbNrd.edge.isValid"> isValid(Mlp.node">Ml217;t add existing

Mlptlp.Graph.addNodes"> tlp.Graph.addNodes(nbNodes)cnumberh> )New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prnamegph21rst last">ant

Mlp.node">ant

Ml217;t add existing

ant

Mlptlp.Graph.addNodes"> tlp.Graph.addNodes(nbNodes)cnumberh> ant/ig>)New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prnamegph21rst last">ant

Mlp.node">ant

Ml217;t add existing

ant

Mlp/h3>
]ant/ig>)New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prcol class="field-name" />

An instance of this class represent an edge in a Tulip graph. It encapsulates an integer identifier. Use song> (a first last"> )<-"noucp.Gecname">ad py-func docutils="fieldscnclass="pre"I="fieldsclaste">ig>)

A>]ig>)clits=eld-b/aph.s/tt class/lass="aref="#tuli

node">
tlp.nolemenlass="asionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if pr> Parameters:

New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prcol class="field-name" /> Parameters:node"> i

ci) persdecessorbNodeleteI>s="versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

tlp.node

t">cposn fieline/spaersdecessorbeld-b"ng>nb(d">
Parameters:tlp.nolemens=lp.Gr
tlp.Graph) – if provided, propertpr>
Parameters:tlp.node) &# an ebNrd="pre">requesil> cnumberh>
s="versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

Parameters:tlp.nolemens=t class="xref py py-class docutils literal">tlp.Graph) – if prcol class="field-name" />
Parameters:tlp.node) &# an exirst last">node"> i
ci) psuccessorbNodeleteI>s="versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

tlp.node

t">cposn fieline/spasuccessorbeld-b"ng>nb(d">
Parameters:tlp.nolemens=lp.Gr
tlp.Graph) – if provided, propertpr>
Parameters:tlp.node) &# an ebNrd="pre">requesil> cnumberh>
s="versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

Parameters:tlp.nolemens=t class="xref py py-class docutils literal">tlp.Graph) – if prcol class="field-name" />
Parameters:tlp.node) &# an exirst last">
s="versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

Parameters:tlp.nolemens=t class="xref py py-class docutils literal">tlp.Graph) – if prcol class="field-name" />
Parameters:tlp.node) &# an exirst last">
re> 21"tulip.tlp.Graph.delNode"> tlp.Graph.debfbptlp.Graph.addNodes"> tlp.Graph.addNodes(nbNodes4.2g>) ig>)<>s="versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

Parameters:tlp.ndescndhscnto/sefstty">cBFS.rI="spanprovione,ddNo>8211;tlp.nwi>]cfssncene /a>ap class=deig>)ig>)<,>aprandscntlp.nwi>]cpicktiss=t class="xref py py-class docutils literal">tlp.Graph) – if prcol class="field-name" />
Parameters:BFSnoraphss=t class="xref py py-class d-graph relation between graphs.provione 8211;tlp.node) &# an e.xirst last">
re> 21"tulip.tlp.Graph.delNode"> tlp.Graph.dedfbptlp.Graph.addNodes"> tlp.Graph.addNodes(nbNodes4.2g>) ig>)<>s="versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

Parameters:tlp.ndescndhscnto/sefstty">cDFS.rI="spanprovione,ddNo>8211;tlp.nwi>]cfssncene /a>ap class=deig>)ig>)<,>aprandscntlp.nwi>]cpicktiss=t class="xref py py-class docutils literal">tlp.Graph) – if prcol class="field-name" />
Parameters:DFSnoraphss=t class="xref py py-class d-graph relation between graphs.provione 8211;tlp.node) &# an e.xirst last">
cuns="versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

An instance of this class represent an edge in a Tulip graph. It encapsulates an integer identifier. Use sfirst last">tlp.node) &# an exirst last">

node">
Parameters:tlp.nolemens=t class="xref py py-class docutils literal">tlp.Graph) – if pre" />
tlp.nolemenlass="asionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if pr>

New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prcol class="field-name" />

New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

tlp.node) &# an exirst last">
Parameters:tlp.nolemens=t class="xref py py-class docutils literal">) – if prcol class="field-name" />
s="versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

tlp.node) &# an exirst last">
Parameters:tlp.nolemens=t class="xref py py-class docutils literal">) – if prcol class="field-name" />
s="versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

tlp.node) &# an exirst last">
Parameters:tlp.nolemens=t class="xref py py-class docutils literal">) – if prcol class="field-name" />
s="versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

tlp.nolemens=t class="xref py py-class docutils literal">) – if prcol class="field-name" /> aph.sode) &# an exirst last"> s-aboutthhebig>)<-"nucp.Gecname">ad py-func docutilsnform/dl> scnclass="pre"Inform/dl> s aboutste">ig>)
s-aboutthhebig>)<-"nucp.Gec="modification-of-the-graph-structure">
cig>)<> s="versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prnamegph21rst last">

c clah> New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if pr"no="fierst last">

c clah> New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

te"> ewc clah>
tlp.Graph.addNodes(nbNodes4.4g>)] New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if pr>

isValid(New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

te"> clah> tlp.Graph) – if prng> (afirst last"> h a-e/tr>
New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

tlp.node te"> clah> ame" /> te">h auah> ame" /> ng> (afilp.Graph">
tlp.Graph.addNodes(nbNodes4.4g>) New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

te"> clah> tlp.Graph) – if prng> (afirst last">
tlp.Graph.addNodes(nbNodes4.4g>)lemenlass="asionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

te"> clah> tlp.Graph) – if prbooleanierst last">
c umberh> lemenlass="asionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prnamegph21rst last">

c umberh> lemenlass="asionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prnamegph21rst last">

clagres="versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

Parameters:tlp.nolemens=t class="xref py py-class docutils literal">) – if prnamegph21rst last">tlp.node) &# an exirst last">
cincomh.s="versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

Parameters:tlp.nolemens=t class="xref py py-class docutils literal">) – if prnamegph21rst last">tlp.node) &# an exirst last">
coutgoh.s="versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

Parameters:tlp.nolemens=t class="xref py py-class docutils literal">) – if prnamegph21rst last">tlp.node) &# an exirst last">
caph.>s="versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

tlp.nolemens=t class="xref py py-class docutils litation between graphs.) – if pr>
Parameters:aph.sode) &# an exirst last">
ctargep=o"pre">aph.>s="versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

tlp.nolemens=t class="xref py py-class docutils litation between graphs.) – if pr>
Parameters:aph.sode) &# an exirst last">
ctwo endNew in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

tlp.nolemens=t class="xref py py-class docutils litation between graphs.) – if pr">
Parameters:
Parameters:aph.sode) &# an exirst last"> es to th>
copposn s/detlp.noaph.sfor>) &# icutieteI>s="versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

tlp.nolemens=t class="xref py py-class docutils litation between graphs.) – if pr>
Parameters:aph.sode) &# an ebNrd="pre"> icutieteItt>aph.xirst last">
isValid(tlp.niadato.lemenph> New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

Parameters:tlp.Graph) – if prbooleanierst last">node">
isValid(tlp.niadals="versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

tlp.nolemens=t class="xref py py-class docutils literal">) – if prbooleanierst last">tlp.node) &# an exirst last"> isValid(aph.siadato.lemenph> New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

tlp.Graph) – if prbooleanierst last"> New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

Parameters:tlp.Graph) – if prbooleanierst last">node">
isValid(aph.siadals="versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

tlp.nolemens=t class="xref py py-class docutils litation between graphs.) – if prbooleanierst last">aph.sode) &# an exirst last">node"> es 221"tulip.tlp.Graph.delNode">> directed=Trutd""tulip.tlp.Graph.delNode"> tlp.Graph.deeGrapEdgp"/h3>
ce"> New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

tlp.node

indicatpbh="pre">directlass>tlp.noaph.s(descn p"tlp-node"> ) &# an exip">
Parameters:tlp.nolemens=lp.Gr
Parameters:tlp.nolemens=lp.Gr
addNodes(nbNodes3.7g>)ce"> ceoundntlp.n(rnh and>i=") &rltt>New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if pr> Parameters: )<-propertipbp.noe">ad py-func docutilpropertipbp.class="pre"Creatp/Access# an ebpropertipb/table>

)<-propertipbp="modification-of-the-graph-structure">
cbooleanbproperty e> ociatpdlass clahiaste">lemenbpropertipb poolbNrd=aste">poolbN"patoa="fstNrd=aste">subbig>)property t>pool,pitscreatpadal ewcistsandos=aph.adit. Ush. isValid(property wilef=ausfia segmenp/dl> viol/dl> (usfie" /> New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

te"> clah> BooleanProperty21ass="field-bodfirst last">
Parameters:
cbooleanbproperty e> ociatpdlass clahiaste">lemenbpropertipb pool. I="re">property t>pool,pitscreatpadal ewcistsandos=aph.adit. Ush. isValid(property wilef=ausfia segmenp/dl> viol/dl> (usfie" /> New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

te"> clah> BooleanProperty21ass="field-bodfirst last">
Parameters:
cbooleanbvignorbproperty e> ociatpdlass clahiaste">lemenbpropertipb poolbNrd=aste">poolbN"patoa="fstNrd=aste">subbig>)property t>pool,pitscreatpadal ewcistsandos=aph.adit. Ush. isValid(property wilef=ausfia segmenp/dl> viol/dl> (usfie" /> New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

te"> clah> BooleanVignorProperty21ass="field-bodfirst last">
Parameters:
cbooleanbvignorbproperty e> ociatpdlass clahiaste">lemenbpropertipb pool. I="re">property t>pool,pitscreatpadal ewcistsandos=aph.adit. Ush. isValid(property wilef=ausfia segmenp/dl> viol/dl> (usfie" /> New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

te"> clah> n/iasg
) – if pr>
BooleanVignorProperty21ass="field-bodfirst last">
Parameters:
ccolorbproperty e> ociatpdlass clahiaste">lemenbpropertipb poolbNrd=aste">poolbN"patoa="fstNrd=aste">subbig>)property t>pool,pitscreatpadal ewcistsandos=aph.adit. Ush. isValid(property wilef=ausfia segmenp/dl> viol/dl> (usfie" /> New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

te"> clah> ColorProperty21ass="field-bodfirst last">
Parameters:
ccolorbproperty e> ociatpdlass clahiaste">lemenbpropertipb pool. I="re">property t>pool,pitscreatpadal ewcistsandos=aph.adit. Ush. isValid(property wilef=ausfia segmenp/dl> viol/dl> (usfie" /> New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

te"> clah> ColorProperty21ass="field-bodfirst last">
Parameters:
ccolorbvignorbproperty e> ociatpdlass clahiaste">lemenbpropertipb poolbNrd=aste">poolbN"patoa="fstNrd=aste">subbig>)property t>pool,pitscreatpadal ewcistsandos=aph.adit. Ush. isValid(property wilef=ausfia segmenp/dl> viol/dl> (usfie" /> New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

te"> clah> ColorVignorProperty21ass="field-bodfirst last">
Parameters:
ccolorbvignorbproperty e> ociatpdlass clahiaste">lemenbpropertipb pool. I="re">property t>pool,pitscreatpadal ewcistsandos=aph.adit. Ush. isValid(property wilef=ausfia segmenp/dl> viol/dl> (usfie" /> New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

te"> clah> ColorVignorProperty21ass="field-bodfirst last">
Parameters:
clouerebproperty e> ociatpdlass clahiaste">lemenbpropertipb poolbNrd=aste">poolbN"patoa="fstNrd=aste">subbig>)property t>pool,pitscreatpadal ewcistsandos=aph.adit. Ush. isValid(property wilef=ausfia segmenp/dl> viol/dl> (usfie" /> New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

te"> clah> DouereProperty21ass="field-bodfirst last">
Parameters:
clouerebproperty e> ociatpdlass clahiaste">lemenbpropertipb pool. I="re">property t>pool,pitscreatpadal ewcistsandos=aph.adit. Ush. isValid(property wilef=ausfia segmenp/dl> viol/dl> (usfie" /> New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

te"> clah> DouereProperty21ass="field-bodfirst last">
Parameters:
clouerebvignorbproperty e> ociatpdlass clahiaste">lemenbpropertipb poolbNrd=aste">poolbN"patoa="fstNrd=aste">subbig>)property t>pool,pitscreatpadal ewcistsandos=aph.adit. Ush. isValid(property wilef=ausfia segmenp/dl> viol/dl> (usfie" /> New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

te"> clah> DouereVignorProperty21ass="field-bodfirst last">
Parameters:
clouerebvignorbproperty e> ociatpdlass clahiaste">lemenbpropertipb pool. I="re">property t>pool,pitscreatpadal ewcistsandos=aph.adit. Ush. isValid(property wilef=ausfia segmenp/dl> viol/dl> (usfie" /> New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

te"> clah> DouereVignorProperty21ass="field-bodfirst last">
Parameters:
cnamegphbproperty e> ociatpdlass clahiaste">lemenbpropertipb poolbNrd=aste">poolbN"patoa="fstNrd=aste">subbig>)property t>pool,pitscreatpadal ewcistsandos=aph.adit. Ush. isValid(property wilef=ausfia segmenp/dl> viol/dl> (usfie" /> New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

te"> clah> IamegphProperty21ass="field-bodfirst last">
Parameters:
cnamegphbproperty e> ociatpdlass clahiaste">lemenbpropertipb pool. I="re">property t>pool,pitscreatpadal ewcistsandos=aph.adit. Ush. isValid(property wilef=ausfia segmenp/dl> viol/dl> (usfie" /> New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

te"> clah> IamegphProperty21ass="field-bodfirst last">
Parameters:
cnamegphbvignorbproperty e> ociatpdlass clahiaste">lemenbpropertipb poolbNrd=aste">poolbN"patoa="fstNrd=aste">subbig>)property t>pool,pitscreatpadal ewcistsandos=aph.adit. Ush. isValid(property wilef=ausfia segmenp/dl> viol/dl> (usfie" /> New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

te"> clah> IamegphVignorProperty21ass="field-bodfirst last">
Parameters:
cnamegphbvignorbproperty e> ociatpdlass clahiaste">lemenbpropertipb pool. I="re">property t>pool,pitscreatpadal ewcistsandos=aph.adit. Ush. isValid(property wilef=ausfia segmenp/dl> viol/dl> (usfie" /> New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

te"> clah> IamegphVignorProperty21ass="field-bodfirst last">
Parameters:
c ociatpdlass clahiaste">lemenbpropertipb poolbNrd=aste">poolbN"patoa="fstNrd=aste">subbig>)property t>pool,pitscreatpadal ewcistsandos=aph.adit. Ush. isValid(property wilef=ausfia segmenp/dl> viol/dl> (usfie" /> New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

te"> clah> on waProperty21ass="field-brst last">
Parameters:
c ociatpdlass clahiaste">lemenbpropertipb pool. I="re">property t>pool,pitscreatpadal ewcistsandos=aph.adit. Ush. isValid(property wilef=ausfia segmenp/dl> viol/dl> (usfie" /> New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

te"> clah> on waProperty21ass="field-brst last">
Parameters:
clayoutbproperty e> ociatpdlass clahiaste">lemenbpropertipb poolbNrd=aste">poolbN"patoa="fstNrd=aste">subbig>)property t>pool,pitscreatpadal ewcistsandos=aph.adit. Ush. isValid(property wilef=ausfia segmenp/dl> viol/dl> (usfie" /> New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

te"> clah> LayoutProperty21ass="field-bodfirst last">
Parameters:
clayoutbproperty e> ociatpdlass clahiaste">lemenbpropertipb pool. I="re">property t>pool,pitscreatpadal ewcistsandos=aph.adit. Ush. isValid(property wilef=ausfia segmenp/dl> viol/dl> (usfie" /> New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

te"> clah> LayoutProperty21ass="field-bodfirst last">
Parameters:
ccoordbvignorbproperty e> ociatpdlass clahiaste">lemenbpropertipb poolbNrd=aste">poolbN"patoa="fstNrd=aste">subbig>)property t>pool,pitscreatpadal ewcistsandos=aph.adit. Ush. isValid(property wilef=ausfia segmenp/dl> viol/dl> (usfie" /> New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

te"> clah> CoordVignorProperty21ass="field-bodfirst last">
Parameters:
ccoordbvignorbproperty e> ociatpdlass clahiaste">lemenbpropertipb pool. I="re">property t>pool,pitscreatpadal ewcistsandos=aph.adit. Ush. isValid(property wilef=ausfia segmenp/dl> viol/dl> (usfie" /> New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

te"> clah> CoordVignorProperty21ass="field-bodfirst last">
Parameters:
csizebproperty e> ociatpdlass clahiaste">lemenbpropertipb poolbNrd=aste">poolbN"patoa="fstNrd=aste">subbig>)property t>pool,pitscreatpadal ewcistsandos=aph.adit. Ush. isValid(property wilef=ausfia segmenp/dl> viol/dl> (usfie" /> New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

te"> clah> SizeProperty21ass="field-bodfirst last">
Parameters:
csizebproperty e> ociatpdlass clahiaste">lemenbpropertipb pool. I="re">property t>pool,pitscreatpadal ewcistsandos=aph.adit. Ush. isValid(property wilef=ausfia segmenp/dl> viol/dl> (usfie" /> New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

te"> clah> SizeProperty21ass="field-bodfirst last">
Parameters:
csizebvignorbproperty e> ociatpdlass clahiaste">lemenbpropertipb poolbNrd=aste">poolbN"patoa="fstNrd=aste">subbig>)property t>pool,pitscreatpadal ewcistsandos=aph.adit. Ush. isValid(property wilef=ausfia segmenp/dl> viol/dl> (usfie" /> New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

te"> clah> SizeVignorProperty21ass="field-bodfirst last">
Parameters:
csizebvignorbproperty e> ociatpdlass clahiaste">lemenbpropertipb pool. I="re">property t>pool,pitscreatpadal ewcistsandos=aph.adit. Ush. isValid(property wilef=ausfia segmenp/dl> viol/dl> (usfie" /> New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

te"> clah> SizeVignorProperty21ass="field-bodfirst last">
csno="fbproperty e> ociatpdlass clahiaste">lemenbpropertipb poolbNrd=aste">poolbN"patoa="fstNrd=aste">subbig>)property t>pool,pitscreatpadal ewcistsandos=aph.adit. Ush. isValid(property wilef=ausfia segmenp/dl> viol/dl> (usfie" />
New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

Parameters:
te"> clah> Sno="fProperty21ass="field-bodfirst last">
csno="fbproperty e> ociatpdlass clahiaste">lemenbpropertipb pool. I="re">property t>pool,pitscreatpadal ewcistsandos=aph.adit. Ush. isValid(property wilef=ausfia segmenp/dl> viol/dl> (usfie" />
New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

Parameters:
te"> clah> Sno="fProperty21ass="field-bodfirst last">
csno="fbvignorbproperty e> ociatpdlass clahiaste">lemenbpropertipb poolbNrd=aste">poolbN"patoa="fstNrd=aste">subbig>)property t>pool,pitscreatpadal ewcistsandos=aph.adit. Ush. isValid(property wilef=ausfia segmenp/dl> viol/dl> (usfie" />
New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

Parameters:
te"> clah> Sno="fVignorProperty21ass="field-bodfirst last">
csno="fbvignorbproperty e> ociatpdlass clahiaste">lemenbpropertipb pool. I="re">property t>pool,pitscreatpadal ewcistsandos=aph.adit. Ush. isValid(property wilef=ausfia segmenp/dl> viol/dl> (usfie" />
New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

Parameters:
te"> clah> Sno="fVignorProperty21ass="field-bodfirst last">
Parameters:
cproperty e> ociatpdlass clahiaste">lemenbpropertipb pool. Te">s=aph.pdlproperty t> Parameters:PropertyIamerfaceclass="field-bodomean="fbgett="fbandosett="fbh aues ce">only bablostsviaste">usfi> cproperty corrignly phusfi/tab
property doe> isValid(s="versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

te"> clah> PropertyIamerfaceclass="field-bodfirst last">
Parameters:
isValid( clahex3.7shiaste">lemenbpropertipb poolbNrd=aste">poolbN"patoa="fstNrd=aste">subbig>)New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

te"> clah> node">
isValid( clahex3.7shiaste">lemenbpropertipb pool.s="versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

te"> clah> node">
cproperty e> ociatpdlass clahiaste">lemenbpropertipb pool.s="versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

te"> clah>
clash> ">lemen.s="versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if pra T"metisValitNrdon sno="fbobjignsfirst last">

clash> ">lemename" 7;soa="fstNrs.s="versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if pra T"metisValitNrdon sno="fbobjignsfirst last">

clash> ">lemen.s="versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if pra T"metisValitNrdon sno="fbobjignsfirst last">) &signulipclassapplic/dl> -of-algorsVhmbp.noh3>Applic/dl> h>

-of-algorsVhmbp/h3>
href="#tuli
t>( idt>( id
idde> ( modi#82> 3.7.class="fi"verp>Appliesban by tts cla. AlgorsVhm pluginsbarebobjigns implemenp="fb">">od"::AlgorsVhm iamerface iasC++bNrdthfie" /> Parameters:AlgorsVhm21ass="field-bodoismerface iasPydivn. > b">oransmitlass">">algorsVhm ush. DataSet-eass="field-bod. TesVher:fi"verblockquote claslasstts > dili>call
Parameters:
getDefaultPlugin>
Parameters:
clah> di/ul> h/div odylockquote contaitoa= errNrdlassage.s="versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

a: Te"> clah> dili>a: DataSet-eass="field-bod-name" /> Te">p
Parameters:
">algorsVhm. Defaultclass.edge.isValid"> isValid(s=li>di/ul> h/t class="xref py py-class docutils litation between graphs.) – if pr>pare also arst e atp>(boolean, sno="f)s="verirst last">t>( idt>( id
idde> ( modi#82> 3.8.class="fi"verp>Computpadalbooleaniproperty >n te">curss=t>lemenb ush. cladlbooleanialgorsVhm (plugin). BooleanialgorsVhm pluginsbarebobjigns implemenp="fb">">od"::BooleanAlgorsVhmoismerface iasC++bNrd /tabe" /> Parameters:BooleanAlgorsVhm21ass="field-bodoismerface iasPydivn. Te"> 3.7h> b" reno=ocudlahrough Parameters:getBooleanAlgorsVhmPluginsL3.7()class="field-bodofunctuli. Te">computpdbh aues wilefbabsnorpdl=asresult. > b">oransmitlass">">algorsVhm ush. DataSet-eass="field-bod . In solahcasec, algorsVhmb ce">usfi/tieie" /> DataSet-eass="field-bod i.bNrdaslasss=aph.bsolahexd-body>infolasdl> h (/at snorpdl=asresult). TesVher:fi"verblockquote claslasstts > dili>call
Parameters:
Parameters:
getDefaultPlugin>
Parameters:
clah> di/ul> h/div odylockquote contaitoa= errNrdlassage.s="versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

a: te"> clah> dili>a: BooleanProperty21ass="field-bod-name" /> albooleaniproperty itowhich resulth> dili>a: DataSet-eass="field-bod-name" /> a dataoset>contait="fbsolahp
Parameters:
Parameters:
">algorsVhms=li>di/ul> h/t class="xref py py-class docutils litation between graphs.) – if pr>pare also arstp>(boolean, sno="f)s="verirst last">) – if pr>pare also arst e atp>a= excepdl> /i pluginsbdatabasm.s="verirst last"> <">Wart="ffi"verpare alsoe atp>Previousbh aues snorpdl=asresult wilefbabdeletpd.s="veridiv ) &admo="tuli wart="f Wart="ffi"verpare alsoe atp>If you arebush. <="f-plugins"ng noLo><="f T"metipluginscl/tr>bod-).s="veridiv t>( idt>( id
idde> ( modi#82> 3.8.class="fi"verp>Computpadalcoloriproperty >n te">curss=t>lemenb ush. cladlcolorialgorsVhm (plugin). ColorialgorsVhm pluginsbarebobjigns implemenp="fb">">od"::ColorAlgorsVhmoismerface iasC++bNrd /tabe" /> Parameters:ColorAlgorsVhm21ass="field-bodoismerface iasPydivn. Te"> 3.7h> b" reno=ocudlahrough Parameters:getColorAlgorsVhmPluginsL3.7()class="field-bodofunctuli. Te">computpdbh aues wilefbabsnorpdl=asresult. > b">oransmitlass">">algorsVhm ush. DataSet-eass="field-bod . In solahcasec, algorsVhmb ce">usfi/tieie" /> DataSet-eass="field-bod i.bNrdaslasss=aph.bsolahexd-body>infolasdl> h (/at snorpdl=asresult). TesVher:fi"verblockquote claslasstts > dili>call
Parameters:
Parameters:
getDefaultPlugin>
Parameters:
clah> di/ul> h/div odylockquote contaitoa= errNrdlassage.s="versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

a: te"> clah> dili>a: ColorProperty21ass="field-bod-name" /> alcoloriproperty itowhich resulth> dili>a: DataSet-eass="field-bod-name" /> a dataoset>contait="fbsolahp
Parameters:
Parameters:
">algorsVhms=li>di/ul> h/t class="xref py py-class docutils litation between graphs.) – if pr>pare also arstp>(boolean, sno="f)s="verirst last">) – if pr>pare also arst e atp>a= excepdl> /i pluginsbdatabasm.s="verirst last"> <">Wart="ffi"verpare alsoe atp>Previousbh aues snorpdl=asresult wilefbabdeletpd.s="veridiv ) &admo="tuli wart="f Wart="ffi"verpare alsoe atp>If you arebush. <="f-plugins"ng noLo><="f T"metipluginscl/tr>bod-).s="veridiv t>( idt>( id
idde> ( modi#82> 3.8.class="fi"verp>Computpadaldouonmiproperty >n te">curss=t>lemenb ush. cladldouonmialgorsVhm (plugin). DouonmialgorsVhm pluginsbarebobjigns implemenp="fb">">od"::DouonmAlgorsVhmoismerface iasC++bNrd /tabe" /> Parameters:DouonmAlgorsVhm21ass="field-bodoismerface iasPydivn. Te"> 3.7h> b" reno=ocudlahrough Parameters:getDouonmAlgorsVhmPluginsL3.7()class="field-bodofunctuli. Te">computpdbh aues wilefbabsnorpdl=asresult. > b">oransmitlass">">algorsVhm ush. DataSet-eass="field-bod . In solahcasec, algorsVhmb ce">usfi/tieie" /> DataSet-eass="field-bod i.bNrdaslasss=aph.bsolahexd-body>infolasdl> h (/at snorpdl=asresult). TesVher:fi"verblockquote claslasstts > dili>call
Parameters:
Parameters:
getDefaultPlugin>
Parameters:
clah> di/ul> h/div odylockquote contaitoa= errNrdlassage.s="versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

a: te"> clah> dili>a: DouonrProperty21ass="field-name" /> a douonmiproperty itowhich resulth> dili>a: DataSet-eass="field-bod-name" /> a dataoset>contait="fbsolahp
Parameters:
Parameters:
">algorsVhms=li>di/ul> h/t class="xref py py-class docutils litation between graphs.) – if pr>pare also arstp>(boolean, sno="f)s="verirst last">) – if pr>pare also arst e atp>a= excepdl> /i pluginsbdatabasm.s="verirst last"> <">Wart="ffi"verpare alsoe atp>Previousbh aues snorpdl=asresult wilefbabdeletpd.s="veridiv ) &admo="tuli wart="f Wart="ffi"verpare alsoe atp>If you arebush. <="f-plugins"ng noLo><="f T"metipluginscl/tr>bod-).s="veridiv t>( idt>( id
idde> ( modi#82> 3.8.class="fi"verp>Computpadanield-geriproperty >n te">curss=t>lemenb ush. cladleld-gerialgorsVhm (plugin). Ild-gerialgorsVhm pluginsbarebobjigns implemenp="fb">">od"::IamegerAlgorsVhmoismerface iasC++bNrd /tabe" /> Parameters:IamegerAlgorsVhm21ass="field-bodoismerface iasPydivn. Te"> 3.7h> b" reno=ocudlahrough Parameters:getIamegerAlgorsVhmPluginsL3.7()class="field-bodofunctuli. Te">computpdbh aues wilefbabsnorpdl=asresult. > b">oransmitlass">">algorsVhm ush. DataSet-eass="field-bod . In solahcasec, algorsVhmb ce">usfi/tieie" /> DataSet-eass="field-bod i.bNrdaslasss=aph.bsolahexd-body>infolasdl> h (/at snorpdl=asresult). TesVher:fi"verblockquote claslasstts > dili>call
Parameters:
Parameters:
getDefaultPlugin>
Parameters:
clah> di/ul> h/div odylockquote contaitoa= errNrdlassage.s="versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

a: te"> clah> dili>a: IamegerProperty21ass="field-bod-name" /> anield-geriproperty itowhich resulth> dili>a: DataSet-eass="field-bod-name" /> a dataoset>contait="fbsolahp
Parameters:
Parameters:
">algorsVhms=li>di/ul> h/t class="xref py py-class docutils litation between graphs.) – if pr>pare also arstp>(boolean, sno="f)s="verirst last">) – if pr>pare also arst e atp>a= excepdl> /i pluginsbdatabasm.s="verirst last"> <">Wart="ffi"verpare alsoe atp>Previousbh aues snorpdl=asresult wilefbabdeletpd.s="veridiv ) &admo="tuli wart="f Wart="ffi"verpare alsoe atp>If you arebush. <="f-plugins"ng noLo><="f T"metipluginscl/tr>bod-).s="veridiv t>( idt>( id
idde> ( modi#82> 3.8.class="fi"verp>Computpada e youtiproperty >n te">curss=t>lemenb ush. cladle youtialgorsVhm (plugin). L youtialgorsVhm pluginsbarebobjigns implemenp="fb">">od"::LayoutAlgorsVhmoismerface iasC++bNrd /tabe" /> Parameters:LayoutAlgorsVhm21ass="field-bodoismerface iasPydivn. Te"> 3.7h> b" reno=ocudlahrough Parameters:getLayoutAlgorsVhmPluginsL3.7()class="field-bodofunctuli. Te">computpdbh aues wilefbabsnorpdl=asresult. > b">oransmitlass">">algorsVhm ush. DataSet-eass="field-bod . In solahcasec, algorsVhmb ce">usfi/tieie" /> DataSet-eass="field-bod i.bNrdaslasss=aph.bsolahexd-body>infolasdl> h (/at snorpdl=asresult). TesVher:fi"verblockquote claslasstts > dili>call
Parameters:
Parameters:
getDefaultPlugin>
Parameters:
clah> di/ul> h/div odylockquote contaitoa= errNrdlassage.s="versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

a: te"> clah> dili>a: LayoutProperty21ass="field-bod-name" /> ale youtiproperty itowhich resulth> dili>a: DataSet-eass="field-bod-name" /> a dataoset>contait="fbsolahp
Parameters:
Parameters:
">algorsVhms=li>di/ul> h/t class="xref py py-class docutils litation between graphs.) – if pr>pare also arstp>(boolean, sno="f)s="verirst last">) – if pr>pare also arst e atp>a= excepdl> /i pluginsbdatabasm.s="verirst last"> <">Wart="ffi"verpare alsoe atp>Previousbh aues snorpdl=asresult wilefbabdeletpd.s="veridiv ) &admo="tuli wart="f Wart="ffi"verpare alsoe atp>If you arebush. <="f-plugins"ng noLo><="f T"metipluginscl/tr>bod-).s="veridiv t>( idt>( id
idde> ( modi#82> 3.8.class="fi"verp>Computpada sizmiproperty >n te">curss=t>lemenb ush. cladlsizmialgorsVhm (plugin). SizmialgorsVhm pluginsbarebobjigns implemenp="fb">">od"::SizmAlgorsVhmoismerface iasC++bNrd /tabe" /> Parameters:SizmAlgorsVhm21ass="field-bodoismerface iasPydivn. Te"> 3.7h> b" reno=ocudlahrough Parameters:getSizmAlgorsVhmPluginsL3.7()class="field-bodofunctuli. Te">computpdbh aues wilefbabsnorpdl=asresult. > b">oransmitlass">">algorsVhm ush. DataSet-eass="field-bod . In solahcasec, algorsVhmb ce">usfi/tieie" /> DataSet-eass="field-bod i.bNrdaslasss=aph.bsolahexd-body>infolasdl> h (/at snorpdl=asresult). TesVher:fi"verblockquote claslasstts > dili>call
Parameters:
Parameters:
getDefaultPlugin>
Parameters:
clah> di/ul> h/div odylockquote contaitoa= errNrdlassage.s="versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

a: te"> clah> dili>a: SizmProperty21ass="field-bod-name" /> alsizmiproperty itowhich resulth> dili>a: DataSet-eass="field-bod-name" /> a dataoset>contait="fbsolahp
Parameters:
Parameters:
">algorsVhms=li>di/ul> h/t class="xref py py-class docutils litation between graphs.) – if pr>pare also arstp>(boolean, sno="f)s="verirst last">) – if pr>pare also arst e atp>a= excepdl> /i pluginsbdatabasm.s="verirst last"> <">Wart="ffi"verpare alsoe atp>Previousbh aues snorpdl=asresult wilefbabdeletpd.s="veridiv ) &admo="tuli wart="f Wart="ffi"verpare alsoe atp>If you arebush. <="f-plugins"ng noLo><="f T"metipluginscl/tr>bod-).s="veridiv t>( id
idde> ( modi#82> 3.8.class="fi"verp>Computpada sno="fbproperty >n te">curss=t>lemenb ush. cladlsno="fbalgorsVhm (plugin). Sno="fbalgorsVhm pluginsbarebobjigns implemenp="fb">">od"::Sno="fAlgorsVhmoismerface iasC++bNrd /tabeParameters:Sno="fAlgorsVhm21ass="fieldoismerface iasPydivn. Te"> 3.7h> b" reno=ocudlahrough Parameters:getSno="fAlgorsVhmPluginsL3.7()class="field-bodofunctuli. Te">computpdbh aues wilefbabsnorpdl=asresult. > b">oransmitlass">">algorsVhm ush. DataSet-eass="field-bod . In solahcasec, algorsVhmb ce">usfi/tieie" /> DataSet-eass="field-bod i.bNrdaslasss=aph.bsolahexd-body>infolasdl> h (/at snorpdl=asresult). TesVher:fi"verblockquote claslasstts > dili>call
Parameters:
Parameters:
getDefaultPlugin>
Parameters:
clah> di/ul> h/div odylockquote contaitoa= errNrdlassage.s="versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

a: te"> clah> dili>a: Sno="fProperty21ass="field-bod-name" /> alsno="fbproperty itowhich resulth> dili>a: DataSet-eass="field-bod-name" /> a dataoset>contait="fbsolahp
Parameters:
Parameters:
">algorsVhms=li>di/ul> h/t class="xref py py-class docutils litation between graphs.) – if pr>pare also arstp>(boolean, sno="f)s="verirst last">) – if pr>pare also arst e atp>a= excepdl> /i pluginsbdatabasm.s="verirst last"> <">Wart="ffi"verpare alsoe atp>Previousbh aues snorpdl=asresult wilefbabdeletpd.s="veridiv ) &admo="tuli wart="f Wart="ffi"verpare alsoe atp>If you arebush. <="f-plugins"ng noLo><="f T"metipluginscl/tr>bod-).s="veridiv ) §ulipclassupdate-managemenp Update managemenp/table>
href="#tuli
( idt>( id
Marks root>lemenb=aste">hifierchy. Te">nexd updates wilefbabrecor Parameters:
New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

unpopAllowed-e"none"> If set>ass.edge.isValid"> isValid( exd updates could( idt>( id
Resnorpad< previouslybmark/dlsnate > root>lemen =aste">hifierchy. Te">resnorpdlsnate doe>New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

unpopAllowed-e"none"> If set>ass.edge.isValid"> isValid(undostsupdates could
Markscurss=t>snate > lemenbhifierchy andoreplays
Reaph.ad.edge.isValid"> isValid(b">resnorpd.s="versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prbooleanierst last">

Reaph.ad.edge.isValid"> isValid(b">replay/d.ri"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prbooleanierst last">

Reaph.ad.edge.isValid"> isValid(curss=t>snate updates ce">b">undostste"n>replay/d.ri"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prbooleanierst last">) §ulipclassM/da-nospa managemenp/table>

href="#tuli
t>( idt>( id
Clospada seth> assoVher nospa arebreplac/dlwsVh edges">oVher nospa.ri"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

a: nosp21ass="field-bod-name" /> ale3.7h>r seth> dili>a: eldic/dpa ifsaor each>und/dly="f edgedili>a: eldic/dpa ifste">und/dly="f edges wilefbabremocudl/som /tabenp=r">hifierchys=li>di/ul> h/t class="xref py py-class docutils litation between graphs.) – if pr>pare also arstp>c" /> nosp21ass="field-bods="verirst last">) – if pr>pare also arstp>a= excepdl> /i ">gs docutp ) &e sd admo="tuli wart="f Wart="ffi"verpare alsoe atp>T> wileffail we"n>call/dl>n te">root>lemen.s="veridiv
Parameters:
Parameters:
Populates a quotienp>lemenbwsVh ostsr each>="fieteralemen. ccaph.ad< 3.7h> New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

a: ss docl"ss="field-bodoobjigns-name" /> allemenb="fiet>r, (ph ss docl"ss="field-bod-name" /> te">lemenb/tatiwilefcontaito/tabdi/ul> h/t class="xref py py-class docutils litation between graphs.) – if pr>pare also arst e atp> 3.7h> nosp21ass="field-bods="verirst last">t>( idt>( id Clospada sublemenb=nassaosublemenbassnospa outsideste">sublemenbarebreplac/dlwsVh edges">nospa outsideste">sublemen.fi"verp>Ttabprovi/at baba spanendant > lemenb=aste">lemenbhifierchy. We"n>creath.sublemens > provi /tablemen,ialldtts nospa andoedges wilefbabdeletpd ando/tabsublemen.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

Parameters:
Parameters:
Parameters:
a:none">sublemen-e"none"> ss docl"ss="field-bod-name" /> a= ex3.7="f sublemen-eli>dili>a: eldic/dpa ifsaor each>und/dly="f edgedili>a: eldic/dpa ifste">und/dly="f edges wilefbabremocudl/som /tabenp=r">hifierchys=li>di/ul> h/t class="xref py py-class docutils litation between graphs.) – if pr>pare also arstp>c" /> nosp21ass="field-bods="verirst last">) – if pr>pare also arst e atp>a= excepdl> /i lemenbhifierchyh>r i sublemen doe>">gs docutp <">Wart="ffi"verpare alsoe atp>T> wileffail we"n>call/dl>n te">root>lemen.s="veridiv t>( idt>( id
Parameters:
Parameters:
Openssaolemen.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

a:none">m/daNosp21"none"> nosp21ass="field-bod-name" /> /tabdili>a: If .edge.isValid"> isValid(r, sizm, etc...s=li>di/ul> h/t class="xra class="referencemiv>) &admo="tuli wart="f Wart="ffi"verpare alsoe atp>T> wileffail we"n>call/dl>n te">root>lemen.s="veridiv ) §ulipclassdy va-dataphT"metidataph
) §ulipclassdlp-vec3f /th>Vec3f/table>
href="#tuli="#tu
me">
Vec3f /h3>
T> r wsVh 3 floath.b">is="antiateraaa =llu"noatpd =aste">cosp below:utp ) &highancht-pydivn) &highanchtpr>pre/tt>(# I="tuss=zpada Vec3f wsVh alefcompistntsbset>ass0.0class="dit>(=class=" >t>((.class="ft>((# I="tuss=zpada Vec3f wsVh alefcompistntsbset>ass1.0class="dit>(=class=" >t>((.class="ft>(((# I="tuss=zpada Vec3f by specifyh. compistntclass="dit>(=class=" >t>((.class="ft>((t>(t>((# I="tuss=zpada Vec3f by copyclass="dit>(=class=" >t>((.class="ft>((Numerousbma/taasdlcalloper/dl> a arebavailionmotrs. Te">sample>cosp below =llu"noatps) &highancht-pydivn) &highanchtpr>pre/tt>(# I=="antiate two vect>rsclass="dit>(=class=" >t>((.class="ft>((t>(t>((=class=" >t>((.class="ft>((t>(t>((# Agratwo vect>rs,loper/d>r +=biadt>(=class=" >t>(t>(+class=" >t>((# Agraabh auehassalefcompistntsbofsaovect>r,loper/d>r +=biadt>(=class=" >t>(t>(+class=" >t>(# Subnoactrs,loper/d>r -=biadt>(=class=" >t>(t>(-class=" >t>((# Subnoactr,loper/d>r -=biadt>(=class=" >t>(t>(-class=" >t>(# Multiplyrs (/at vect>r g>oduct),loper/d>r *=biadt>(=class=" >t>(t>(*class=" >t>((# Multiplycompistntbofsaovect>r by abh aue,loper/d>r *=biadt>(=class=" >t>(t>(*class=" >t>(# Dividestwo vect>rs,loper/d>r /=biadt>(=class=" >t>(t>(/class=" >t>((# Divideseach>compistntbofsaovect>r by abh aue,loper/d>r /=biadt>(=class=" >t>(t>(/class=" >t>(# clfolasaovect>r g>oduct,loper/d>r ^=biadt>(=class=" >t>(t>(^class=" >t>(Each>compistntbofs/tabhect>r ce">b">read / written /troughr:utp ) &highancht-pydivn) &highanchtpr>pre/tt>(=class=" >t>((.class="ft>((t>(t>((# read arst compistntclass="dit>(=class=" >t>((0class="ft>(# writfi/tird>compistntclass="dit>((2class="ft>(=class=" >t>(rs comparison (<, >) arebalso availionmcutp
Parameters:
Vec3f.depthp/h3>
Convenienp>
. ccaph.ad">">otird>compistntbofs/tabhect>r.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prfloate rst last">node">

Vec3f.d3.7./h3>
Computpadandoreaph.ad/tabd3.7a="fibetween /tabhect>r (3d/po=na) andoanoVher ost.s="versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

vclanone"> Vec3f/tass="field-bod-name" /> alhect>rh/t class="xref py py-class docutils litation between graphs.) – if prfloate rst last">node">
Parameters:
Vec3f.dotProduct./h3>
Computpadandoreaph.ad/tabdot g>oduct (scalar g>oduct)bofs/tabhect>r wsVh anoVher osts="versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

vclanone"> Vec3f/tass="field-bod-name" /> alhect>rh/t class="xref py py-class docutils litation between graphs.) – if prfloate rst last">node">
Parameters:
Vec3f.fill./h3>
Set te">samebh auehasseach>compistntbofs/tabhect>r.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

valcl"none"> abh auee rst last">node">
Vec3f.get./h3>
ccaph.ad">">hect>r aad< tuple.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if pr(float, float, float)e rst last">node">

Vec3f.getDp/h3>
Convenienp>
. ccaph.ad">">otird>compistntbofs/tabhect>r.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prfloate rst last">node">

Vec3f.getHp/h3>
Convenienp>
. ccaph.ad">">secondocompistntbofs/tabhect>r.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prfloate rst last">node">

Vec3f.getWp/h3>
Convenienp>
. ccaph.ad">"> arst compistntbofs/tabhect>r.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prfloate rst last">node">

Vec3f.getXp/h3>
Convenienp>
. ccaph.ad">"> arst compistntbofs/tabhect>r.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prfloate rst last">node">

Vec3f.getYp/h3>
Convenienp>. ccaph.ad">">secondocompistntbofs/tabhect>r.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prfloate rst last">node">

Vec3f.getZp/h3>
Convenienp>. ccaph.ad">">otird>compistntbofs/tabhect>r.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prfloate rst last">

Vec3f.henchtp/h3>
Convenienp>. ccaph.ad">">secondocompistntbofs/tabhect>r.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prfloate rst last">

Vec3f.normp/h3>
Computpadandoreaph.ad/tabeuclideaninormbofs/tabhect>r.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prfloate rst last">node">xcl/tr, g noycl/tr, g nozcl/trf

Vec3f.set./h3>
Setsseach>compistntbofs/tabhect>r.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

a:none">xcl"none"> ">"> arst compistntbh auee li>dili>a: ">">secondocompisantbh auee li>dili>a: ">">otird>compistntbh auee li>di/ul> h/t class="xra class="reference internal" href="#tuli
Vec3f.setDp/h3>
Convenienp>. Setss">">otird>compistntbofs/tabhect>r.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

depth21"none"> abh auee rst last">node">
Vec3f.setHp/h3>
Convenienp>. Setss">">secondocompistntbofs/tabhect>r.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

hencht21"none"> abh auee rst last">node">
Vec3f.setWp/h3>
Convenienp>. Setss">"> arst compistntbofs/tabhect>r.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

width21"none"> abh auee rst last">node">xcl/trf
Vec3f.setXp/h3>
Convenienp>. Setss">"> arst compistntbofs/tabhect>r.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

xcl"none"> abh auee rst last">node">
Vec3f.setYp/h3>
Convenienp>. Setss">">secondocompistntbofs/tabhect>r.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

ycl"none"> abh auee rst last">node">
Vec3f.setZp/h3>
Convenienp>. Setss">">otird>compistntbofs/tabhect>r.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

zcl"none"> abh auee rst last">node">
Vec3f.width./h3>
Convenienp>. ccaph.ad">"> arst compistntbofs/tabhect>r.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prfloate rst last">node">

Vec3f.x./h3>
Convenienp>. ccaph.ad">"> arst compistntbofs/tabhect>r.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prfloate rst last">node">

Vec3f.yp/h3>
Convenienp>. ccaph.ad">">secondocompistntbofs/tabhect>r.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prfloate rst last">node">

Vec3f.zp/h3>
Convenienp>. ccaph.ad">">otird>compistntbofs/tabhect>r.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prfloate rst last">) §ulipclass=lp-vec4f /th>Vec4f/table>

href="#tuli="#tu
me">
Vec4f /h3>
T> r wsVh 4 floath.osea/som /tabc" /> Parameters:Vec3f/tass="field-bod>Param.s="veridnternal" hidiv ) §ulipclass=lp-vec4i /th>Vec4i/table>
href="#tuli="#tu
me">
Vec4i /h3>
T> r wsVh 4 eld-ger compistnts. Css="ruct>rs,loper/d>radandoa arebsimilar ass">osea/som /tabc" /> Parameters:Vec3f/tass="field-bod>Param.s="veridnternal" hidiv ) §ulipclass=lp-coord /th>Coord/table>
href="#tuliattribute
Coord /h3>
ss=ash> Parameters:) §ulipclass=lp-boundh./th>Boundh.
href="#tuli="#tu
me">
Boundh.
T> "> arst ostsbeh.">secondobeh.A boundh.< boxbce">b">is="antiateraando) &highancht-pydivn) &highanchtpr>pre/tt>(# I="tuss=zp a# Te">md="mum t>(=class=" >t>((.class="ft>((# I="tuss=zp a(# Te">h and=ty ofs/tabboundh.< boxb /id"raispdlifbitii>t>(=class=" >t>((.class="ft>(((.class="ft>((0class="ft>(0class="ft>(0class="ft>((.class="ft>((10class="ft>(10class="ft>(10class="ft>(# Rd>b">doststeroughrclass="dit>(md=class=" >t>(=class=" >t>((0class="ft>(maxclass=" >t>(=class=" >t>((1class="ft>(
Boundh.
ccaph.ad">">geoNew in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prc" /> Parameters:Vec3f/tass="field-bode rst last">

Boundh.
idde> Parametversl> mosi#82> 3.7.class="fi"verp>Checka ifste">gicutipo=na ia =asideste">curss=t>boundh.< box. Ifs/tabboundh.< boxb resultbiad isValid(New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

po=naclanone"> Vec3f/tass="field-bod-name" /> alpo=na ins/tab3D assce.fit class="xref py py-class docutils litation between graphs.) – if prbooleanierst last">
Parameters:
Boundh.
ccaph.ad">">depth ofs/tabboundh.< box.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prfloate rst last">

Boundh.
Exss=dss/tabboundh.< boxbassonefcontaith.r g(r ia =asideste">boundh.< box,bitiremaits unchanged.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

po=naclanone"> Vec3f/tass="field-bod-name" /> Alpo=na ins/tab3D assce we wantb/tabboundh.< boxbasss="ompaam.s=rst last">
Parameters:
Boundh.
ccaph.ad">">hencht ofs/tabboundh.< box.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prfloate rst last">

Boundh.
idde> Parametversl> mosi#82> 3.7.class="fi"verp>Checka ifste">gicutiboundh.< boxb ld-bsectsste">curss=t>ost. Ifsosts> isValid(New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

boundh. Boundh. /tabboundh.< boxbon whichlassfheckb ld-bsectl> fit class="xref py py-class docutils litation between graphs.) – if prbooleanierst last"> idde> Parametversl> mosi#82> 3.7.class="fi"verp>Checka ifste">boundh.< boxb ld-bsectsste">gicutis="e segmenp. Ifs/tabboundh.< boxb resultbiad isValid(New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

Parameters:
a:none">segStartclanone"> Vec3f/tass="field-bod-name" /> ">">startlpo=na > fili>dili>a: Vec3f/tass="field-bod-name" /> ">">endlpo=na > fili>di/ul> h/t class="xref py py-class docutils litation between graphs.) – if pripare also arst l atp>booleaniep> h/t class="xra class="reference internal" href="#tuli
Parameters:
Parameters:
Boundh.
Checka wheVher /tabboundh.< boxame" 7;sblowest po=na itame" 7;sbhighest po=na. ame"20;LdsssTee"ame"2/> meanadNew in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prbooleanierst last">

Boundh.
Tranalatess/tabboundh.< boxbby ttabd3.plscemena>gicutiby//tabhect>r g(New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

displscemenaclanone"> Vec3f/tass="field-bod-name" /> Ttabd3.plscemena>hect>r inb3D assce ass"ranalates"> node">
Parameters:
Boundh.
ccaph.ad">">width ofs/tabboundh.< box.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prfloate rst last">) §ulipclass=lp-size /th>Size/table>

href="#tuliattribute
Size /h3>
ss=ash> Parameters:) §ulipclass=lp-es or /th>Co or/table>
href="#tuli="#tu
me">
Co or /h3>
T> b">is="antiatera/tabfollowh.< waylasp ) &highancht-pydivn) &highanchtpr>pre/tt>(# Each>compistntbmust b">is te">range [0, 255]class=" it>(redOpaqueclass=" >t>(=class=" >t>((.class="ft>((255class="ft>(0class="ft>(0class="ft>(t>(=class=" >t>((.class="ft>((0class="ft>(0class="ft>(255class="ft>(100class="ft>(h auts> compistntbce">b">read / written ush.r.utp
Co or.getA./h3>
ccaph.ad">">alpha>compistntbofs/tabco or.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if preld-gers=rst last">node">

Co or.getAGL./h3>
ccaph.ad">">alpha>compistntbofs/tabco or>is te">OpenGLap>rmat (a float>h autsbetween 0.0 ando1.0).fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prfloate rst last">node">

Co or.getB./h3>
ccaph.ad">">blue>compistntbofs/tabco or.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if preld-gers=rst last">node">

Co or.getBGL./h3>
ccaph.ad">">blue>compistntbofs/tabco or>is te">OpenGLap>rmat (a float>h autsbetween 0.0 ando1.0).fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prfloate rst last">node">

Co or.getG./h3>
ccaph.ad">">green compistntbofs/tabco or.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if preld-gers=rst last">node">

Co or.getGGL./h3>
ccaph.ad">">green compistntbofs/tabco or>is te">OpenGLap>rmat (a float>h autsbetween 0.0 ando1.0).fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prfloate rst last">node">

Co or.getH./h3>
ccaph.ad">">hue>compistntb(is te">range [0, 360])bofs/tabco or>is te">HSVoco or assce.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if preld-gers=rst last">node">

Co or.getR./h3>
ccaph.ad">">red>compistntbofs/tabco or.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if preld-gers=rst last">node">

Co or.getRGL./h3>
ccaph.ad">">red>compistntbofs/tabco or>is te">OpenGLap>rmat (a float>h autsbetween 0.0 ando1.0).fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prfloate rst last">node">

Co or.getS./h3>
ccaph.ad">">saaphati> /compistntb(is te">range [0, 255])bofs/tabco or>is te">HSVoco or assce.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if preld-gers=rst last">node">

Co or.getV./h3>
ccaph.ad">">halue>compistntb(is te">range [0, 255])bofs/tabco or>is te">HSVoco or assce.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if preld-gers=rst last">node">redcl/tr, g nogreencl/tr, g nobauee /tr, g noalphacl/trf

Co or.set./h3>
Setsseach>compistntbofs/tabco or. Each>compistntbmust b">is te">range [0, 255].fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

a:none">redcl"none"> ">">red>compistntbh auee li>dili>a: ">">green compistntbh auee li>dili>a: ">">blue>compistntbh auee li>dili>a: ">">alpha>compistntbh auee li>di/ul> h/t class="xra class="reference internal" href="#tuli
Co or.setA./h3>
Setss">">alpha>compistntbofs/tabco or>(must b">is te">range [0, 255]).fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

alphacl"none"> ">">alpha>compistntbh auee t class="xra class="reference internal" href="#tuli
Co or.setB./h3>
Setss">">blue>compistntbofs/tabco or>(must b">is te">range [0, 255]).fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

bauee "none"> ">">blue>compistntbh auee t class="xra class="reference internal" href="#tuli
Co or.setG./h3>
Setss">">green compistntbofs/tabco or>(must b">is te">range [0, 255]).fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

greencl"none"> ">">green compistntbh auee t class="xra class="reference internal" href="#tuli
Co or.setH./h3>
Setss">">hue>compistntbofs/tabco or>is te">HSVoco or assce>(must b">is te">range [0, 360]).fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

huee "none"> ">">hue>compistntbh auee t class="xra class="reference internal" href="#tuli
redcl/trf
Co or.setR./h3>
Setss">">red>compistntbofs/tabco or>(must b">is te">range [0, 255]).fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

redcl"none"> ">">red>compistntbh auee t class="xra class="reference internal" href="#tuli
cl/trf
Co or.setS./h3>
Setss">">saaphati> /compistntbofs/tabco or>is te">HSVoco or assce>(must b">is te">range [0, 255]).fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

saaphati> cl"none"> ">">saaphati> /compistntbh auee t class="xra class="reference internal" href="#tuli
Co or.setV./h3>
Setss">">halue>compistntbofs/tabco or>is te">HSVoco or assce>(must b">is te">range [0, 255]).fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

h auee "none"> ">">halue>compistntbh auee t class="xra class="reference internal" hidnternal" hidiv ) §ulipclass=lp-es orscale /th>Co orScale/table>
href="#tuli="#tu
me">
Co orScale /h3>
T> rmoco or mapping. Ttabco or>scalelce">b">eiVher gradienp>(t iault) >r gred id=ed co ors steps. Ifs/tabco or>scaleliad< gradienp, reaph.ed co ors arebeld-bpolatedois functulibofs/tabpos"tuli. Ifs/tabco or>scalelianame" 7;td< gradienp reaph.ed co ors areb/tabpred id=ed co ors steps.fi"verp>T>">sample codtsbelow illustratesshow assfreatesando) &highancht-pydivn) &highanchtpr>pre/tt>(# Creath.scalel(t iault css="ruct>rsfreatead< dd>tmapa/som blue>assred).class="dit>(=class=" >t>((.class="ft>((# Co or>scaleli="tuss=zati> /:a/som blue>assred wsVh gradienp.class="dit>(.class="ft>((0.0class="ft>((.class="ft>((0class="ft>(0class="ft>(255class="ft>((.class="ft>((1.0class="ft>((.class="ft>((255class="ft>(0class="ft>(0class="ft>(# Ttabfollowh.< syntaxbcould also>b">usedcl"ss=" it>(# co ors = [od">Co or(0,0,255), od">Co or(255,0,0)]class=" it>(# co orScale.setCo orScale(co ors)class=" it>(# >rclass="dit>(# co orScale = od">Co orScale(co ors)class=" dit>(# Gets/tabco or>p>rs/tabpos"tuli 0.5,bi.e. Co or(127,0,127).class="dit>(=class=" >t>(.class="ft>((0.5class="ft>(# Rdi="tuss=zes/tabco or>scalel:a/som blue>assred wsVhout gradienp.class="dit>(=class=" >t>(newCo ors/tass="ft>(.class="ft>(((.class="ft>((0class="ft>(0class="ft>(255class="ft>((.class="ft>(((.class="ft>((255class="ft>(0class="ft>(0class="ft>((.class="ft>((((# Gets/tabco or>p>rs/tabpos"tuli 0.3,bi.e. Co or(0,0,255).class="dit>(=class=" >t>(.class="ft>((0.3class="ft>(# Gets/tabco or>p>rs/tabpos"tuli 0.7,bi.e. Co or(255,0,0).class="dit>(=class=" >t>(.class="ft>((0.7class="ft>(
Co orScale.getCo orAtPos./h3>
T> >computess/tabco or>e> ociatera/od< specificbpos"tuli is te">co or>scalelandoreaph.adit.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

pose "none"> T> d id=ess/tabpos"tuli ofs/tabco or>is te">scalelandomust b">between 0.0 ando1.0 (it wsll b">tilmperaoVherwise).s=rst last">) – if pri" /> Co or/tass="field-bode rst last">node">
Parameters:
Co orScale.getCo orMap./h3>
ccaph.ada dictuliarybcorrespondh.< ass">">co or>scale.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if pra dictuliarybw>oseaindexpa arebofs/hando/tabhaluesbofs/h Parameters:Co or/tass="field-bode rst last">node">

Co orScale.isGradienp./h3>
ccaph.ad.edge.isValid"> isValid(co or>scaleliad< gradienp.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prbooleanierst last">node">

Co orScale.setCo orAtPos./h3>
T> >addssaoco or ass">">co or>scale at>a specificbpos"tuli.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

a:none">pose "none"> /tabpos"tuli is te">co or>scalel(0.0 <=bpos <=b1.0)e li>dili>a: Co or/tass="field-bod-name" /> /tabco or assadd at>te">specifiedbpos"tulie li>di/ul> h/t class="xra class="reference internal" href="#tuli
(
Parameters:
Co orScale.setCo orScale /h3>
T> >configuress/tabco or>scale. Ifs/tabscalelwaa previously>configuredo/tabol>>configurati> /id"losp.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

a:none">co ors/tanone"> < 3.7h> Co or/tass="field-bod-name" /> Ttabco orslassuse is te">co or>scale.e li>dili>a: Ifssets/od.edge.isValid"> isValid(co or>scaleliad< gradienpe li>di/ul> h/t class="xra class="reference internal" h internal" hidiv ) §ulipclass=lp-strh./th>Strh.
href="#tuli="#tu
me">
Strh.
T> b">u/eraaa plugis p
Parameters:
e>saocombo boxb lste">Plugis >
T"met GUI.utp
index/t/trf
Strh.
ccaph.ad">">strh.< elemena>at>a certainaindex is te">co lectuli.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

index/t"none"> a h and index is te">co lectulis=rst last">) – if prstrh.node">
Strh.
ccaph.ad.edge.isValid"> isValid(co lectuliliadempty.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prbooleanierst last">node">

Strh.
ccaph.ad">">index ofs/tabcurss=t>selecterastrh.<.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if preld-gers=rst last">node">

Strh.
ccaph.ad">">curss=t>selecterastrh.New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prstrh.node">elemena/t/trf

Strh.
Addssaostrh. New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

elemena/t"none"> ">">strh.">co lectulis=rst last">node">index/t/trf
Strh.
Setss">">curss=t>selecterastrh. isValid(g>ovided index is h and.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

index/t"none"> a h and index is te">strh.) – if prbooleanierst last">h auee /trf Setss">">curss=t>selecterastrh. isValid(strh.co lectuli.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

h auee "none"> aostrh.co lectulis=rst last">) – if prbooleanierst last">
Strh.
ccaph.ad">">numberh> co lectuli.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if preld-gers=rst last">) §ulipclass=lp-dataset.>noh3>/th>DataSet/table>

href="#tuli="#tu
me">
DataSet /h3>
T>

b">storedois < T"met dataasetlasp booleanieli>dili>eld-gers=li>dili>floate li>dili>strh.dili>a" /> Parameters:Coord/tass="field-bode li>dili>a" /> Parameters:Co or/tass="field-bode li>dili>a" /> Parameters:Size/tass="field-bode li>dili>a" /> Parameters:DataSet/tass="field-bode li>dili>a" /> Parameters:Co orScale/tass="field-bode li>dili>a" /> Parameters:Strh. opertyp/h3> opertyp< Parameters:BooleanP>operty/tass="field-bode li>dili>a" /> opertyp/h3> opertyp< Parameters:Co orP>operty/tass="field-bode li>dili>a" /> opertyp/h3> opertyp< Parameters:DouereP>operty/tass="field-bode li>dili>a" /> opertyp/h3> opertyp< Parameters:Ild-gerP>operty/tass="field-bode li>dili>a" /> opertyp/h3> opertyp< Parameters:LayoutP>operty/tass="field-bode li>dili>a" /> opertyp/h3> opertyp< Parameters:SizeP>operty/tass="field-bode li>dili>a" /> opertyp/h3> opertyp< Parameters:Strh.

operty/tass="field-bode li>dili>a" /> opertyIld-rface /h3> opertyIld-rface < Parameters:P>opertyIld-rface/tass="field-bode li>di/ul> h/mivra/blockquote If yous"ryaassstoresan unsupporteradataaphthrown. Each>haluelstoredois < dataaset issa> ociatera/od< strh.haluelis < dataaset issdist>through /tab[]loper/d>r>e>sillustratedsbelowlasp ) &highancht-pydivn) &highanchtpr>pre/tt>(# dataaset freatuli/tass="dit>(=class=" >t>((.class="ft>((# writh.t>(t>(=class=" >t>(100class="dit>(t>(t>(=class=" >t>(300class="ddit>(# rd>t>(=class=" >t>(t>(t>(*class=" >t>(t>(When rd>node">key/t/trf

DataSet.ex3.7./h3>
Checks ifste">dataaset fontains/<>haluela> ociatera/od< particularbkey.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

key/t"none"> ">">key assfhecks=rst last">) – if prbooleanierst last">node">
DataSet.getKeys./h3>
ccaph.ad">"> 3.7h> ociatera/od/tabhaluesbstoredois te">dataaset.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if pr 3.7h> key/t/trf

DataSet.remove /h3>
ccmove ">">halue>a> ociatera/od< particularbkeyl/som te">dataaset if itlex3.7s.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

key/t"none"> ">">key ofs/tabhaluelassremove.h/t class="xra class="reference internal" href="#tuli
DataSet.size /h3>
ccaph.ad">">numberh> dataaset.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if preld-gers=rst last">) §ulipclass=lp-plugisprogretu /th>PlugisProgretu/table>

href="#tuli="#tu
me">
PlugisProgretu /h3>
T> andofontrs ate">g>ogretuuli ofsa>g>ocetu.fi"verref="#tuli
PlugisProgretu.ca="fl /h3>
Setss">">statesfla">g>ocetus/tatb">">userhwantssassca="fldit. Ca="flh.ocetusmust stop itlandorevert all te">changessperp>rmerasi="fietsbstart.fi"ver internal" href="#tuli
PlugisProgretu.getError /h3>
ccaph.ada metuage>d scribh.< ae">error s="ould-reradurh.< ae">g>ocetu. Ifsno>error has been s="ould-rer,sanlemptybstrh.New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prstrh.

PlugisProgretu.isPreviewMode /h3>
ccaph.ad.edge.isValid"> isValid(preview modtsiadenfered. Te">preview modtsrerrawss">">graph while applyh.< ae">algorithm, makh.New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prbooleanierst last">

PlugisProgretu.progretu /h3>
Uses"> >assnotify>te">g>ogretuuli ofsae">g>ocetu.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

a:none">stepe "none"> ">">curss=t>step>numbere li>dili>a: ">">total>numberh> di/ul> h/t class="xref py py-class docutils litation between graphs.) – if pripare also arst e atpra haluelisdicath.g>ogretu has been stoppera(.edge.isValid"> isValid(TLP_STOPclass="217;t),sca="fllera(.edge.isValid"> isValid(TLP_CANCELclass="217;t),sor wsll fontinuel(.edge.isValid"> isValid(TLP_CONTINUEclass="217;t).fi"ver rst last">node">
PlugisProgretu.setComms=t./h3>
Changesste">commena>about ">">g>ocetusg>ogretuuli.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

A>d scriptuli ofswtatb">">g>ocetus rmo">">user.h/t class="xra class="reference internal" href="#tuli
errorMsge /trg
PlugisProgretu.setError /h3>
Setss">">metuage>d scribh.< ae">error s="ould-reradurh.< ae">g>ocetu.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

">">error metuage>assset/ti class="xra class="reference internal" href="#tuli
previewe /trg
PlugisProgretu.setPreviewMode /h3>
Enferes / disferes te">preview modt. Te">preview modtsrerrawss">">graph while applyh.< ae">algorithm, makh.New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

isdicates ifste">preview modtsshould b">activater/ti class="xra class="reference internal" href="#tuli
PlugisProgretu.showPreview /h3>
T> ">widgetsa> ociatera/od/t eview fheckbox, allowh.< ">">userh/oddecidtsif ae">algorithmlshould rrawb< g>eview or not.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.

wheVher te">g>ogretu widgetsshould fontainb< g>eview fheckbox or not.fii class="xra class="reference internal" href="#tuli
PlugisProgretu.state /h3>
Getss">">curss=t>eld-body>statesofsae">PlugisProgretu.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if pra haluelisdicath.g>ogretu has been stoppera(.edge.isValid"> isValid(TLP_STOPclass="217;t),sca="fllera(.edge.isValid"> isValid(TLP_CANCELclass="217;t),sor wsll fontinuel(.edge.isValid"> isValid(TLP_CONTINUEclass="217;t).fii class="xra class="reference internal" href="#tuli

PlugisProgretu.stop./h3>
Setss">">statesfla">g>ocetus/tatb">">userhwantssassstop it. Stopph.ocetusdoes not>revert changes.fi"ver internal" h internal" hidiv ) §ulipclass="met-observatuli-mechanism T"met observatuli mechanism/table>
) §ulipclass=lp-ocutt.>noh3>/th>Ecutt/table>
href="#tuli="#tu
me">
Ecutt./h3>
T> ">basesone>p>rsrepr"senth.el T"met. Ecutta arebobjects sent bybobjects w>oseafielde
a" /> Parameters:Observable/tass="field-bodsone. Abievs=t>es charact rizedsbyietsbph Parameters:Ecutt/tass="field-bodsfield"only>carriessinp>rmatuli as ass">">/h.edge.isValid"> isValid(Ecutt>TLP_DELETEclass="217;t : send rirectly assall observe c/ 3.7ene c, not>affecterabyia" /> .edge.isValid"> Parameters:Observable.holdObserve c()class="field-bod.e li>dili>aedge.isValid"> isValid(Ecutt>TLP_MODIFICATIONclass="217;t : sent assall observe c/ 3.7ene c. Ttatb"hes arst sent assobserve cs">"n ass 3.7ene c.e li>dili>aedge.isValid"> isValid(Ecutt>TLP_INFORMATIONclass="217;t : sent only>ass 3.7ene c.e li>dili>aedge.isValid"> isValid(Ecutt>TLP_INVALIDclass="217;t : never sent,du/eraeld-bodyly>p>rsdelayh.< evs=tc.e li>di/ul> h/mivra/blockquote Implemena>asfield"t rivedd/som a" /> Parameters:Ecutt/tass="field-bodsassadd custom evs=tc. Hereliad< sample codtsbelowlasp ) &highancht-pydivn) &highanchtpr>pre/tt>(fieldclass=" >t>(MyEcutt/tass="ft>((.class="ft>(t>(# sender must b">anainsta="fit rivh.< /som tth>Observable/tass="d >t>(t iclass=" >t>(__d="t__/tass="ft>(((((.class="ft>(.class="ft>((t>(t>((.class="ft>(.class="ft>(((.class="ft>(=class=" >t>(t>(t iclass=" >t>(getData/tass="ft>((t>(.class="ft>(
Ecutt>sender /h3>
ccaph.ad">">objects/tatbsent a>">evenp.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if pra" /> Parameters:Observable/tass="field-bodsorsone>ofietsbt riveddph

Ecutt>ph
ccaph.ad">">"h">evenp.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if praedge.isValid"> isValid(Ecutt>TLP_DELETEclass="217;t orsaedge.isValid"> isValid(Ecutt>TLP_MODIFICATIONclass="217;t orsaedge.isValid"> isValid(Ecutt>TLP_INFORMATIONclass="217;t orsaedge.isValid"> isValid(Ecutt>TLP_INVALIDclass="217;ts=rst last">) §ulipclass=lp-graphocutt.>noh3>/th>GraphEcutt/table>

href="#tuli="#tu
me">
GraphEcutt./h3>
T>aiteral""repr"sentssabievs=t>/tatbhappe.ed li a a" /> Parameters:Graph/tass="field-bodsinsta="f. To gets">">graph /tatbsent a>">evenp,du/e te">a" /> .edge.isValid"> Parameters:GraphEcutt.getGraph()class="field-bod. Te">"hce">b">reprieveddphrough /taba" /> .edge.isValid"> Parameters:GraphEcutt.getTh. Below issanlexhaustiveo 3.7h> oseaph.edge.isValid"> isValid(GraphEcutt.TLP_ADD_NODEclass="217;t : a nodtshas been addedois te">graph (usesa" /> .edge.isValid"> Parameters:GraphEcutt.getNode()class="field-boddto gets">">assceh.ed node)e li>dili>aedge.isValid"> isValid(GraphEcutt.TLP_DEL_NODEclass="217;t : a nodtshas been deletedois te">graph (usesa" /> .edge.isValid"> Parameters:GraphEcutt.getNode()class="field-boddto gets">">assceh.ed node)e li>dili>aedge.isValid"> isValid(GraphEcutt.TLP_ADD_EDGEclass="217;t : anledgtshas been addedois te">graph (usesa" /> .edge.isValid"> Parameters:GraphEcutt.getEdgt()class="field-boddto gets">">assceh.ed edgt)e li>dili>aedge.isValid"> isValid(GraphEcutt.TLP_DEL_EDGEclass="217;t : anledgtshas been deletedois te">graph (usesa" /> .edge.isValid"> Parameters:GraphEcutt.getEdgt()class="field-boddto gets">">assceh.ed edgt)e li>dili>aedge.isValid"> isValid(GraphEcutt.TLP_REVERSE_EDGEclass="217;t : te">directuli ofsanledgtshas been reversedois te">graph (usesa" /> .edge.isValid"> Parameters:GraphEcutt.getEdgt()class="field-boddto gets">">assceh.ed edgt)e li>dili>aedge.isValid"> isValid(GraphEcutt.TLP_BEFORE_SET_ENDSclass="217;t : te">extrem"tu/ssofsanledgtsissabout "o>b">modifiedb(usesa" /> .edge.isValid"> Parameters:GraphEcutt.getEdgt()class="field-boddto gets">">assceh.ed edgt)e li>dili>aedge.isValid"> isValid(GraphEcutt.TLP_AFTER_SET_ENDSclass="217;t : te">extrem"tu/ssofsanledgtshave been modifiedb(usesa" /> .edge.isValid"> Parameters:GraphEcutt.getEdgt()class="field-boddto gets">">assceh.ed edgt)e li>dili>.edge.isValid"> isValid(GraphEcutt.TLP_ADD_NODESclass="217;t : several>nodesshave been addedois te">graph (usesa" /> .edge.isValid"> Parameters:GraphEcutt.getNodec()class="field-boddto gets">"> 3.7h> dili>aedge.isValid"> isValid(GraphEcutt.TLP_ADD_EDGESclass="217;t : several>edgtsshave been addedois te">graph (usesa" /> .edge.isValid"> Parameters:GraphEcutt.getEdgtc()class="field-boddto gets">"> 3.7h> dili>aedge.isValid"> isValid(GraphEcutt.TLP_BEFORE_ADD_DESCENDANTGRAPHclass="217;t : a spanenda=t>graph (i.e. not>necetuarily a sirect sub-graph)sissabout "o>b">addedois te">sub-graphsshialirchy. Usesa" /> .edge.isValid"> Parameters:GraphEcutt.getSubGraph()class="field-boddto getsit.e li>dili>aedge.isValid"> isValid(GraphEcutt.TLP_AFTER_ADD_DESCENDANTGRAPHclass="217;t : a spanenda=t>graph (i.e. not>necetuarily a sirect sub-graph)shas been addedois te">sub-graphsshialirchy. Usesa" /> .edge.isValid"> Parameters:GraphEcutt.getSubGraph()class="field-boddto getsit.e li>dili>aedge.isValid"> isValid(GraphEcutt.TLP_BEFORE_DEL_DESCENDANTGRAPHclass="217;t : a spanenda=t>graph (i.e. not>necetuarily a sirect sub-graph)sissabout "o>b">removedois te">sub-graphsshialirchy. Usesa" /> .edge.isValid"> Parameters:GraphEcutt.getSubGraph()class="field-boddto getsit.e li>dili>aedge.isValid"> isValid(GraphEcutt.TLP_AFTER_DEL_DESCENDANTGRAPHclass="217;t : a spanenda=t>graph (i.e. not>necetuarily a sirect sub-graph)shas been removedois te">sub-graphsshialirchy. Usesa" /> .edge.isValid"> Parameters:GraphEcutt.getSubGraph()class="field-boddto getsit.e li>dili>aedge.isValid"> isValid(GraphEcutt.TLP_BEFORE_ADD_SUBGRAPHclass="217;t : a sub-graphsissabout "o>b">addedois te">graph. Usesa" /> .edge.isValid"> Parameters:GraphEcutt.getSubGraph()class="field-boddto getsit.e li>dili>aedge.isValid"> isValid(GraphEcutt.TLP_AFTER_ADD_SUBGRAPHclass="217;t : a sub-graphshas been addedois te">graph. Usesa" /> .edge.isValid"> Parameters:GraphEcutt.getSubGraph()class="field-boddto getsit.e li>dili>aedge.isValid"> isValid(GraphEcutt.TLP_BEFORE_DEL_SUBGRAPHclass="217;t : a sub-graphsissabout "o>b">removedois te">graph. Usesa" /> .edge.isValid"> Parameters:GraphEcutt.getSubGraph()class="field-boddto getsit.e li>dili>aedge.isValid"> isValid(GraphEcutt.TLP_AFTER_DEL_SUBGRAPHclass="217;t : a sub-graphshas been removedois te">graph. Usesa" /> .edge.isValid"> Parameters:GraphEcutt.getSubGraph()class="field-boddto getsit.e li>dili>aedge.isValid"> isValid(GraphEcutt.TLP_BEFORE_ADD_LOCAL_PROPERTYclass="217;t : a local>g>opertysissabout "o>b">addedois te">graph. Usesa" /> opertyN. Theh3> opertyN. Th>.edge.isValid"> Parameters:GraphEcutt.getP>opertyN. T()class="field-boddto gets">"> cla ofsa>">assceh.ed g>operty.e li>dili>aedge.isValid"> isValid(GraphEcutt.TLP_ADD_LOCAL_PROPERTYclass="217;t : a local>g>opertyshas been addedois te">graph. Usesa" /> opertyN. Theh3> opertyN. Th>.edge.isValid"> Parameters:GraphEcutt.getP>opertyN. T()class="field-boddto gets">"> cla ofsa>">assceh.ed g>operty.e li>dili>aedge.isValid"> isValid(GraphEcutt.TLP_BEFORE_DEL_LOCAL_PROPERTYclass="217;t : a local>g>opertysissabout "o>b">deletedois te">graph. Usesa" /> opertyN. Theh3> opertyN. Th>.edge.isValid"> Parameters:GraphEcutt.getP>opertyN. T()class="field-boddto gets">"> cla ofsa>">assceh.ed g>operty.e li>dili>aedge.isValid"> isValid(GraphEcutt.TLP_AFTER_DEL_LOCAL_PROPERTYclass="217;t : a local>g>opertyshas been deletedois te">graph. Usesa" /> opertyN. Theh3> opertyN. Th>.edge.isValid"> Parameters:GraphEcutt.getP>opertyN. T()class="field-boddto gets">"> cla ofsa>">assceh.ed g>operty.e li>dili>aedge.isValid"> isValid(GraphEcutt.TLP_BEFORE_ADD_INHERITED_PROPERTYclass="217;t : anainherited g>operty (not>attachera/od/tabgraphsitself butsone>ofietsbpass=t)sissabout "o>b">addedois te">graph. Usesa" /> opertyN. Theh3> opertyN. Th>.edge.isValid"> Parameters:GraphEcutt.getP>opertyN. T()class="field-boddto gets">"> cla ofsa>">assceh.ed g>operty.e li>dili>aedge.isValid"> isValid(GraphEcutt.TLP_ADD_INHERITED_PROPERTYclass="217;t : anainherited g>operty (not>attachera/od/tabgraphsitself butsone>ofietsbpass=t)shas been addedois te">graph. Usesa" /> opertyN. Theh3> opertyN. Th>.edge.isValid"> Parameters:GraphEcutt.getP>opertyN. T()class="field-boddto gets">"> cla ofsa>">assceh.ed g>operty.e li>dili>aedge.isValid"> isValid(GraphEcutt.TLP_BEFORE_DEL_INHERITED_PROPERTYclass="217;t : anainherited g>operty (not>attachera/od/tabgraphsitself butsone>ofietsbpass=t)sissabout "o>b">deletedois te">graph. Usesa" /> opertyN. Theh3> opertyN. Th>.edge.isValid"> Parameters:GraphEcutt.getP>opertyN. T()class="field-boddto gets">"> cla ofsa>">assceh.ed g>operty.e li>dili>aedge.isValid"> isValid(GraphEcutt.TLP_AFTER_DEL_INHERITED_PROPERTYclass="217;t : anainherited g>operty (not>attachera/od/tabgraphsitself butsone>ofietsbpass=t)shas been deletedois te">graph. Usesa" /> opertyN. Theh3> opertyN. Th>.edge.isValid"> Parameters:GraphEcutt.getP>opertyN. T()class="field-boddto gets">"> cla ofsa>">assceh.ed g>operty.e li>dili>aedge.isValid"> isValid(GraphEcutt.TLP_BEFORE_SET_ATTRIBUTEclass="217;t : ">graphsissabout "o>b">set/modified. Usesa" /> .edge.isValid"> Parameters:GraphEcutt.getAttributaN. T()class="field-boddto gets">"> cla ofsa>">assceh.ed attributa.e li>dili>aedge.isValid"> isValid(GraphEcutt.TLP_AFTER_SET_ATTRIBUTEclass="217;t : ">graphshas been set/modified. Usesa" /> .edge.isValid"> Parameters:GraphEcutt.getAttributaN. T()class="field-boddto gets">"> cla ofsa>">assceh.ed attributa.e li>dili>aedge.isValid"> isValid(GraphEcutt.TLP_REMOVE_ATTRIBUTEclass="217;t : ">graphshas been removed. Usesa" /> .edge.isValid"> Parameters:GraphEcutt.getAttributaN. T()class="field-boddto gets">"> cla ofsa>">assceh.ed attributa.e li>di/ul> h/mivra/blockquote
GraphEcutt.getAttributaN. Theh3>
ccaph.ad">">ncla ofsa>">attributa assceh.ed by a>">evenp (ifsany, oVherwise reaph.ssanlemptybstrh.<)fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prstrh.node">

GraphEcutt.getEdgt /h3>
ccaph.ad">">edgtsassceh.ed by a>">evenp (ifsany, oVherwise reaph. anainh and edgt)e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if pra" /> .edge.isValid"> Parameters:edgt/tass="field-bodh/t class="xra class="reference internal" href="#tuli

GraphEcutt.getEdgts./h3>
ccaph.ad">">edgtssassceh.ed by a>">evenp (ifsany, oVherwise reaph. anaemptyb 3.7)e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if pr 3.7h> .edge.isValid"> Parameters:edgt/tass="field-bodh/t class="xra class="reference internal" href="#tuli

GraphEcutt.getGraph /h3>
ccaph.ad">">graphs/tatbsent a>">evenp.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if pra" /> Parameters:Graph/tass="field-bodh/t class="xra class="reference internal" href="#tuli

GraphEcutt.getNode /h3>
ccaph.ad">">nodtsassceh.ed by a>">evenp (ifsany, oVherwise reaph. anainh and node)e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if pra" /> .edge.isValid"> Parameters:node/tass="field-bodh/t class="xra class="reference internal" href="#tuli

GraphEcutt.getNodes./h3>
ccaph.ad">">nodessassceh.ed by a>">evenp (ifsany, oVherwise reaph. anaemptyb 3.7)e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if pr 3.7h> .edge.isValid"> Parameters:node/tass="field-bodh/t class="xra class="reference internal" href="#tuli

opertyN. T/tils add existing
GraphEcutt.getP>opertyN. Theh3>
New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prstrh.node">

GraphEcutt.getSubGraph /h3>
ccaph.ad">">sub-graphs>rsdeanenda=t>graph assceh.ed by a>">evenp (ifsany, reaph. aedge.isValid"> isValid(New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if pra" /> Parameters:Graph/tass="field-bodh/t class="xra class="reference internal" href="#tuli

GraphEcutt.getTh
New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if praedge.isValid"> isValid(GraphEcutt.TLP_*class="217;t (cf. field"> scriptuli above)e rst last">) §ulipclass=lp-g>opertyevenp.>noh3>/th>P>opertyEcutt/table>

opertyevenp./h3>
href="#tuli="#tu
me">opertyEcutt/tils table>
P>opertyEcutt./h3>
T>aiteral""repr"sentssabievs=t>/tatbhappe.ed li a a" /> opertyIld-bface /h3> opertyIld-bface < Parameters:P>opertyIld-bfaceclass="field-boddt riveddinsta="f. To gets">">g>operty /tatbsent a>">evenp,du/e te">a" /> opertyEcutt.getP>operty /h3> opertyEcutt.getP>operty >.edge.isValid"> Parameters:P>opertyEcutt.getP>operty()class="field-bod. Te">"hoperty evs=t>ce">b">reprieveddphrough /taba" /> opertyEcutt.getTh opertyEcutt.getTh.edge.isValid"> Parameters:P>opertyEcutt.getTh. Below issanlexhaustiveo 3.7h> oseaph.edge.isValid"> isValid(P>opertyEcutt.TLP_BEFORE_SET_NODE_VALUEclass="217;t : te">haluelofsa>nodtsissabout "o>b">modified. Usesa" /> opertyEcutt.getNode /h3> opertyEcutt.getNode >.edge.isValid"> Parameters:P>opertyEcutt.getNode()class="field-boddto gets">">assceh.ed node.e li>dili>aedge.isValid"> isValid(P>opertyEcutt.TLP_AFTER_SET_NODE_VALUEclass="217;t : te">haluelofsa>nodtshas been modified. Usesa" /> opertyEcutt.getNode /h3> opertyEcutt.getNode >.edge.isValid"> Parameters:P>opertyEcutt.getNode()class="field-boddto gets">">assceh.ed node.e li>dili>aedge.isValid"> isValid(P>opertyEcutt.TLP_BEFORE_SET_EDGE_VALUEclass="217;t : te">haluelofsanledgtsissabout "o>b">modified. Usesa" /> opertyEcutt.getEdgt /h3> opertyEcutt.getEdgt >.edge.isValid"> Parameters:P>opertyEcutt.getEdgt()class="field-boddto gets">">assceh.ed edgt.e li>dili>aedge.isValid"> isValid(P>opertyEcutt.TLP_AFTER_SET_EDGE_VALUEclass="217;t : te">haluelofsanledgtshas been modified. Usesa" /> opertyEcutt.getEdgt /h3> opertyEcutt.getEdgt >.edge.isValid"> Parameters:P>opertyEcutt.getEdgt()class="field-boddto gets">">assceh.ed edgt.e li>dili>aedge.isValid"> isValid(P>opertyEcutt.TLP_BEFORE_SET_ALL_NODE_VALUEclass="217;t : te">haluelofsall>nodessissabout "o>b">modified.e li>dili>aedge.isValid"> isValid(P>opertyEcutt.TLP_AFTER_SET_ALL_NODE_VALUEclass="217;t : te">haluelofsall>nodesshas been modified.e li>dili>aedge.isValid"> isValid(P>opertyEcutt.TLP_BEFORE_SET_ALL_EDGE_VALUEclass="217;t : te">haluelofsall>edgtssissabout "o>b">modified.e li>dili>aedge.isValid"> isValid(P>opertyEcutt.TLP_AFTER_SET_ALL_EDGE_VALUEclass="217;t : te">haluelofsall>edgtsshas been modified.e li>di/ul> h/mivra/blockquote
P>opertyEcutt.getEdgt /h3>
ccaph.ad">">edgtsassceh.ed by a>">evenp (ifsany, oVherwise reaph. anainh and edgt)e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if pra" /> .edge.isValid"> Parameters:edgt/tass="field-bodh/t class="xra class="reference internal" href="#tuli

P>opertyEcutt.getNode /h3>
ccaph.ad">">nodtsassceh.ed by a>">evenp (ifsany, oVherwise reaph. anainh and node)e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if pra" /> .edge.isValid"> Parameters:node/tass="field-bodh/t class="xra class="reference internal" href="#tuli

operty/tils add existing
P>opertyEcutt.getP>operty /h3>
ccaph.ad">">g>operty assceh.ed by a>">evenp.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prt riveddinsta="fsh> opertyIld-bface /h3> opertyIld-bface < Parameters:P>opertyIld-bfaceclass="field-bodh/t class="xra class="reference internal" href="#tuli

P>opertyEcutt.getTh
New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if praedge.isValid"> isValid(GraphEcutt.TLP_*class="217;t (cf. field"> scriptuli above)e rst last">) §ulipclass=lp-observable /th>Observable/table>

href="#tuli="#tu
me">
Observable /h3>
T>">a" /> Parameters:Observable/tass="field-bodsfield" ">basesof T"met’ssobservatuli system.fi"verp>Eacon betw /tatbwishes asssend >rsreceiveonotificatulis needs assinheritd/som a" /> Parameters:Observable/tass="field-bod.fi"verp>T"metshas twssseparate mechanismsh> diflass="filiessin te">way anaObserve >rsL3.7ene sissattachera/o ">">objectsw>oseaevenpssitbwillsreceive.fi"verp>T>">L3.7ene sissclosera/od/taboriginal>gatt-bo,sw>erelevenpssarebsent rirectly ass/tabrecipiutt. Te">Observe iad< tw3.7hp>rsperp>rma="fipurposem, it>ce">receiveoa>">evenpssin asdelayedd/ashuli, and ce"not>know ifsa>">evenp>was just sent >rswas delayed.fi"verp>T>">purposeh> rm ashigh numbe >f modificatulis (e.g. freatung asgrira/odrout">edgts, freatung multiple subgraphshwithdrslayouts)a/odrui smooVhly without overcrowdung a>">evenp>queue. Aslevenpssarebsent p>rsevery>graph modificatuli (e.g. addung asnode, deletung asnode, settung ashaluelon asnode), te" shee quanh3>y ofsevs=tsbsent by a>"sehalgortithmw would ceu/e a y> sperp>rma="fihit.fi"verp>T>ississa/p> ed by usung a>">staticd a" /> .edge.isValid"> Parameters:Observable.holdObserve c()class="field-bod. Te evenpssin asqueue and only send"msw>en a>">staticd a" /> .edge.isValid"> Parameters:Observable.unholdObserve c()class="field-boddisscalled.fi"verp>T>">only exceptuli ass"> ">aedge.isValid"> isValid(Ecutt>TLP_DELETEclass="217;t kind of>evenp,d/tatbis neve h211>back. Te "clofiet assanlunmaskionmoPOSIX snceal;sw>ateve ">">assnectuli /od/tabobjectsand a>">stateh> willsgets">rough. Te crashes in te">casesw>ereland objectsiso 3.7e.ed lrT>">L3.7ene showeve iadnot>aflacted by a>">useh> .edge.isValid"> Parameters:Observable.holdObserve c()class="field-bod and a" /> .edge.isValid"> Parameters:Observable.unholdObserve c()class="field-bod.fi"verp>T>">observables Observe c and L3.7ene csarebeld-bodyly stockedois a>graph strucp.Ge, allowung ao visuss=ze ">">assnectuli Evenpssarebalwaysbsent ao L3.7ene csfirst,sand a>"i /odObserve c,devensw>en a>"re iadnoTo>receiveoevenps,sinheritd/som a" /> Parameters:Observable/tass="field-bod,sand implement >ne>ofipwssvirtuss functuli<.fi"verp>To>received>evenpsswithout delay, implement a" /> .edge.isValid"> Parameters:Observable.treatEcutt()class="field-bod. Tosattach assan objectsf>rsreceivung evenps,scallietsba" /> .edge.isValid"> Parameters:Observable.addL3.7ene ()class="field-bodd.fi"verp>To>receiveoevenps>afd-b a delay, implement a" /> Parameters:Observable.treatEcuttcclass="field-bod. Tosattach assan objectsf>rsreceivung evenps,scallietsba" /> .edge.isValid"> Parameters:Observable.addObserve ()class="field-bodd.fi"verref="#tuli
l3.7ene /t/tr>
Observable.addL3.7ene ./h3>
Addssa>L3.7ene sass"> ">L3.7ene swillsreceiveoevenps>regardless ofsa>">stateh> .edge.isValid"> Parameters:Observable.holdObserve c()class="field-bod and a" /> .edge.isValid"> Parameters:Observable.unholdObserve c()class="field-bod.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>l3.7ene /tstrong> (a" /> Parameters:Observable/tass="field-bod) – Ttabobjects/tatbwillsreceiveoevenps.h/t class="xra class="reference internal" href="#tuli

observe /t/tr>
Observable.addObserve ./h3>
AddssanaObserve ass"> ">Observe willsreceiveoevenps>sent by a> "re iadnoNew in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>observe /tstrong> (a" /> Parameters:Observable/tass="field-bod) – Ttabobjects/tatbwillsreceiveoevenps.h/t class="xra class="reference internal" href="#tuli

Observable.countL3.7ene c./h3>
Getad">">numbe >f L3.7ene csattachera/od/t New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if preld-ge /ti class="xra class="reference internal" href="#tuli

Observable.countObserve c /h3>
Getad">">numbe >f Observe c attachera/od/t New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if preld-ge /ti class="xra class="reference internal" href="#tuli

Observable.getReceived /h3>
Getad">">numbe >f received>evenps.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if preld-ge /ti class="xra class="reference internal" href="#tuli

Observable.getSutt./h3>
Getad">">numbe >f sent evenps.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if preld-ge /ti class="xra class="reference internal" href="#tuli

Observable.hasOnlooke c /h3>
ccaph.adwhea>"r a>"re arebObserve c/L3.7ene csattachera/od/t New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prboolean/ti class="xra class="reference internal" href="#tuli

Observable.holdObserve c /h3>
Holdssbacksall>evenpssuntil>aedge.isValid"> Parameters:Observable.unholObserve c()class="fielddisscalled. L3.7ene csarebnot>aflacted by a>issfunctuli. O="fia>issfunctulidisscalled,sall>evenpssdd>aedge.isValid"> isValid(Ecutt>TLP_DELETEclass="217;t evenps. T>">evenpssarebstoredois a>queue,sand willsbe sent >="fiaedge.isValid"> Parameters:Observable.unholObserve c()class="fielddisscalled. Itsisopossionmoao nestscalls ass.edge.isValid"> Parameters:Observable.holObserve c()class="fielddand iaedge.isValid"> Parameters:Observable.unholObserve c()class="field, and inia>isscasesa>">evenpsswillsonly be sent w>en a>"re haveobeen as manyscalls assiaedge.isValid"> Parameters:Observable.unholObserve c()class="fielddas assiaedge.isValid"> Parameters:Observable.holObserve c()class="field. Itsisopossionmoao checkswhea>"r a>">evenpssarebbeung h21p by checkung a>">a" /> .edge.isValid"> Parameters:Observable.observe sHoldCounte ()class="field-bod functuli.fi"ver internal" href="#tuli
Observable.observe sHoldCounte ./h3>
Staticd to gets">"> umbe >f timesba" /> .edge.isValid"> Parameters:Observable.holdObserve c()class="field-bod has been calledswithout a matchung a" /> .edge.isValid"> Parameters:Observable.unholdObserve c()class="field-bod call.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if preld-ge /ti class="xra class="reference internal" href="#tuli

l3.7ene /t/tr>
Observable.removeL3.7ene ./h3>
ccmovessa>L3.7ene s/som "> ">L3.7ene swillsno longe sreceiveoevenps>/som "> New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>l3.7ene /tstrong> (a" /> Parameters:Observable/tass="field-bod) – T>">L3.7ene s/odrcmove>/som "> node">observe /t/tr>

Observable.removeObserve ./h3>
ccmovessanaObserve /som "> ">Observe willsno longe sreceiveoevenps>/som "> New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>observe /tstrong> (a" /> Parameters:Observable/tass="field-bod) – TtabObserve assrcmove>/som "> node">ecutt/t/tr>

Observable.sendEcutt./h3>
Send/ssalls">">Observe c/L3.7ene c.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>ecutt/tstrong> (a" /> .edge.isValid"> Parameters:Ecutt/tass="field-bod) – a>">evenp>asssend /od/tabL3.7ene c/Observe c.fii class="xra class="reference internal" href="#tuli

ecutt/t/tr>
Observable.treatEcutt./h3>
T>issfunctulidisscalled w>en evenpssarebsent /od/tabL3.7ene c, and L3.7ene csonly. Issitspe> ed a class="fi/od/tabevs=t>/tatbjust happe.ed. Implement /tatb ao catch>evenpsswith custom "hrsinsta="fsa" /> Parameters:GraphEcutt/tass="field-bod lr opertyEcutt /h3> opertyEcutt < Parameters:P>opertyEcutt/tass="field-bod)fi"versionmodified">New in version 3.7.

ecutts/t/tr>

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>ecutt/tstrong> (a" /> .edge.isValid"> Parameters:Ecutt/tass="field-bod lr<"h/tatbwas senp.fii class="xra class="reference internal" href="#tuli

Observable.treatEcuttc /h3>
T>issfunctulidisscalled w>en evenpssarebsent /odObserve c, and Observe c only.fi"verp>Itsisope> ed a 3.7h> ">evenpss/tatbhappe.ed si="fia>e le>tscall. Ifsevs=tsbw"re lidhold,s"> b">ersttyb arge,sand ifsevs=tsbw"re not>lidholdsitsiso 3kelysitsonly contai.ssa si=gnmoelement. Itsisoimportant /odnotes/tatbcustom evs=tsbce">not>be catchedswith /tatb. Only insta="fs > .edge.isValid"> Parameters:Ecutt/tass="field-bod "he l3.7. Moreove w>en unholdung evenpsdphrough ascalliass." /> .edge.isValid"> Parameters:Observable.unholdObserve c()class="field-bod, if seve al evs=tsbw"re sent psom ">abscla object, only >ne>insta="fs> .edge.isValid"> Parameters:Ecutt/tass="field-bod willsbe storedois a>e l3.7 f>rs/tatbsenNew in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>ecutts/tstrong> ( 3.7h> .edge.isValid"> Parameters:Ecutt/tass="field-bod) – T>">evenpss/tatbhappe.ed si="fia>e le>ts." /> .edge.isValid"> Parameters:Observable.unholdObserve c()class="field-bod call.fii class="xra class="reference internal" href="#tuli

Observable.unholdObserve c /h3>
Staticd to send allih211>evenpss/os">">Observe c.fi"verp>L3.7ene csarebnot>aflacted by a>issfunctuli.fi"ver internal" h internal" hidiv ) §ulipclassgraph-g>opertieslfieldes.>noh2>Graph g>operties fieldes/table>
opertieslfieldes./h3>
) §ulipclasstlp-g>opertyild-bface /th>P>opertyIld-bfacectable>
opertyild-bface /h3>
href="#tuli="#tu
me">opertyIld-bfaceclils table>
P>opertyIld-bface /h3>
opertyIld-bface.fies/ >node">node/t/tr>
P>opertyIld-bface.fies/ /h3>
ccmovesste">haluelstoredof>rs/t">nodtsgivensis paspan"fi. T>">new>haluelf>rs/t">nodts ">t iault >ne.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/ti class="xrmaintain the subevensph relation between graphs.) – if pranlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>opertyfii class="xra class="reference internal" href="#tuli

P>opertyIld-bface.getEdgtD iaultStrh.
ccaph.ada strh.<"repr"sentatuli ofsa>">edgtst iault halue.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prstrh.opertyIld-bface.getEdgtStrh.node">edgt/t/tr>

P>opertyIld-bface.getEdgtStrh.
ccaph.ada strh.<"conve culi ofsa>">haluelreg3.7eredof>rs/t">givensedgt.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/ti class="xrmaintain the subevensph relation between graphs.) – if prstrh.edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertyfii class="xra class="reference internal" href="#tuli

P>opertyIld-bface.getGraph /h3>
ccaph.ad">">graphs>nsw>ichd">">g>operty has been t id=ed.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if pra" /> Parameters:Graph/tass="field-bodh/t class="xra class="referencemiv>) &admo="tuli warnh.< to p>) rst admo="tuli-h3> <">Warnh.) &le>t">Ifd">">g>operty isoinheritedd">">graphscould b">diflass=t /tatb/tabonedusera/odgets">atbp>operty.fi"ver iiv opertyIld-bface.getNs.

P>opertyIld-bface.getNs.
ccaph.ad">">ncla ofd">">g>operty.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prstrh.opertyIld-bface.getNodeD iaultStrh.node">

P>opertyIld-bface.getNodeD iaultStrh.
ccaph.ada strh.<"repr"sentatuli ofsa>">nodtsd iault halue.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prstrh.opertyIld-bface.getNodeStrh.node">node/t/tr>

P>opertyIld-bface.getNodeStrh.
ccaph.ada strh.<"conve culi ofsa>">haluelreg3.7eredof>rs/t">givensnode.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/ti class="xrmaintain the subevensph relation between graphs.) – if prstrh.nodtsdoes>not>belongs/os">">graph attachera/od/t">g>opertyfii class="xra class="reference internal" href="#tuli

Parametoptulield-[/tass="f/trsubgraph = None/t/tr>ame">Parametoptulield-]/tass="f
P>opertyIld-bface.getNonD iaultValuatedEdgtc /h3>
ccaph.adai i"fietlredgtssw>oseahaluel abd iault halue.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>subgraph/tatrong> (a" /> Parameters:Graph/tass="field-bod) – a sub-graphsce">b">givensis paspan"fi. Ins/tatbcase, only a>">edgts owned by a>isssub-graphsarebreaph.ed by a>">i"fietlr./ti class="xrmaintain the subevensph relation between graphs.) – if pr Parameters:I"fietlrEdgt/tass="field-bi class="xra class="reference internal" href="#tuli

Parametoptulield-[/tass="f/trsubgraph = None/t/tr>ame">Parametoptulield-]/tass="f
P>opertyIld-bface.getNonD iaultValuatedNodec /h3>
ccaph.adai i"fietlrnodessw>oseahaluel abd iault halue.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>subgraph/tatrong> (a" /> Parameters:Graph/tass="field-bod) – a sub-graphsce">b">givensis paspan"fi. Ins/tatbcase, only a>">nodessowned by a>isssub-graphsarebreaph.ed by a>">i"fietlr./ti class="xrmaintain the subevensph relation between graphs.) – if pr Parameters:I"fietlrNode/tass="field-bi class="xra class="reference internal" href="#tuli

P>opertyIld-bface.getTh
ccaph.ada strh.<"> scribung a>">"h">g>operty, i.e. “graph”, “douere”, “layout”, “strh.<”, “eld-ge ”, “es o ”, “size”, ...fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prstrh.opertyIld-bface.setAllEdgtStrh.node">str/t/tr>

P>opertyIld-bface.setAllEdgtStrh.
Clears all>edgtssreg3.7eredohaluec, and setada>new>edgtst iault halue is conve tung a>">givensstrh.<"repr"sentatuli ofsashalue. ccaph.adaedge.isValid"> isValid(givensstrh.<"repr"sentatuli has been successfully conve tera/odashalue,daedge.isValid"> isValid(New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>st /tstrong> (aem>strh.) – a strh.<"repr"sentatuli ofsashalue/ti class="xrmaintain the subevensph relation between graphs.) – if prboolean/ti class="xra class="reference internal" href="#tuli

str/t/tr>
P>opertyIld-bface.setAllNodeStrh.
Clears all>nodessreg3.7eredohaluec, and setada>new>nodtsd iault halue is conve tung a>">givensstrh.<"repr"sentatuli ofsashalue. ccaph.adaedge.isValid"> isValid(givensstrh.<"repr"sentatuli has been successfully conve tera/odashalue,daedge.isValid"> isValid(New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>st /tstrong> (aem>strh.) – a strh.<"repr"sentatuli ofsashalue/ti class="xrmaintain the subevensph relation between graphs.) – if prboolean/ti class="xra class="reference internal" href="#tuli

edgt/t/tr,daem>str/t/tr>
P>opertyIld-bface.setEdgtStrh.
ccg3.7erada>new>haluelf>rs/t">givensedgt is conve tung a>">givensstrh.<"repr"sentatuli. ccaph.adaedge.isValid"> isValid(givensstrh.<"repr"sentatuli has been successfully conve tera/odashalue,daedge.isValid"> isValid(New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/tliro lirastrong>st /tstrong> (aem>strh.) – a strh.<"repr"sentatuli ofsashalue/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rstprboolean/tps="re class="xrmaintain the sub-graph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertyfips="re class="xra class="reference internal" href="#tuli

node/t/tr,daem>str/t/tr>
P>opertyIld-bface.setNodeStrh.
ccg3.7erada>new>haluelf>rs/t">givensnodts s conve tung a>">givensstrh.<"repr"sentatuli. ccaph.adaedge.isValid"> isValid(givensstrh.<"repr"sentatuli has been successfully conve tera/odashalue,daedge.isValid"> isValid(New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/tliro lirastrong>st /tstrong> (aem>strh.) – a strh.<"repr"sentatuli ofsashalue/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rstprboolean/tps="re class="xrmaintain the sub-graph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>opertyfips="re class="xra class="reference internal" h internal" hidiv ) §ulipclasstlp-booleang>opertyp>noh3>/th>BooleanP>opertyctable>

opertyp/h3>
href="#tuli="#tu
me">opertyclils table>
BooleanP>operty /h3>
Base<: opertyIld-bface /h3> opertyIld-bface < Parameters:P>opertyIld-bfaceclass="field-bodh/"verref="#tuli
nodeDst/t/tr,daem>nodeSrc/t/tr,daem>g>op/t/tr>ame">Parametoptulield-[/tass=",daem>ifNotD iault=False/t/tr>ame">Parametoptulield-]/tass="f
BooleanP>operty.copy /h3>
noame">Parametve culimodi#82d >New> s ve culi 3.8.class="fi"verp>Copiesste">haluelholdsbysasg>operty on a>nodtsao anoVher>nodtsonia>issg>operty.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst le>t simple to lirastrong>nodeDst/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – a>">nodtsao copyste">haluelto./tliro lirastrong>nodeSrc/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – a>">nodtsao copyste">haluelpsom./tliro lirastrong>g>op/tatrong> (a" /> operty /h3> operty <.edge.isValid"> Parameters:BooleanP>opertyclass="field-bod) – a>">g>operty holdung te">haluelto copy./tliro lirastrong>ifNotD iault/tstrong> (aem>boolean/tem>) – whea>"r ao nceortsd iault-valuated>nodessor>not. D iaults ass.edge.isValid"> isValid(edgtDst/t/tr,daem>edgtSrc/t/tr,daem>g>op/t/tr>ame">Parametoptulield-[/tass=",daem>ifNotD iault=False/t/tr>ame">Parametoptulield-]/tass="f noame">Parametve culimodi#82d >New> s ve culi 3.8.class="fi"verp>Copiesste">haluelholdsbysasg>operty on ansedgt ao anoVher>edgt onia>issg>operty.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst le>t simple to lirastrong>edgtDst/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – a>">nodtsao copyste">haluelto./tliro lirastrong>edgtSrc/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – a>">nodtsao copyste">haluelpsom./tliro lirastrong>g>op/tatrong> (a" /> operty /h3> operty <.edge.isValid"> Parameters:BooleanP>opertyclass="field-bod) – a>">g>operty holdung te">haluelto copy./tliro lirastrong>ifNotD iault/tstrong> (aem>boolean/tem>) – whea>"r ao nceortsd iault-valuated>nodessor>not. D iaults ass.edge.isValid"> isValid(g>op/t/tr> noame">Parametve culimodi#82d >New> s ve culi 3.8.class="fi"verp>Copiesste">halueslholdsbysasg>operty on a>issg>operty.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>g>op/tatrong> (a" /> operty /h3> operty <.edge.isValid"> Parameters:BooleanP>opertyclass="field-bod) – a>">g>operty to copy"re class="xra class="reference internal" href="#tuli

h a/t/tr>ame">Parametoptulield-[/tass=",daem>graph = None/t/tr>ame">Parametoptulield-]/tass="f
BooleanP>operty.getNodesEqualTo /h3>
ccaph.adai i"fietlrnodessbelongings/os">">attacheragraph w>oseae> ociated>haluel ">onedgivensis paspan"fi.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>h a/tstrong> (aem>boolean/tem>) – ashalue/tliro lirastrong>graph/tatrong> (a" /> Parameters:Graph/tass="field-bod) – a sub-graphsce">b">givensis paspan"fi,ois a>atbcasebreaph.adai i"fietlratbsub-graph/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t"> Parameters:I"fietlrNode/tass="field-bps="re class="xra class="reference internal" href="#tuli

h a/t/tr>ame">Parametoptulield-[/tass=",daem>graph = None/t/tr>ame">Parametoptulield-]/tass="f
BooleanP>operty.getEdgtcEqualTo /h3>
ccaph.adai i"fietlredgtssbelongings/os">">attacheragraph w>oseae> ociated>haluel ">onedgivensis paspan"fi.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>h a/tstrong> (aem>boolean/tem>) – ashalue/tliro lirastrong>graph/tatrong> (a" /> Parameters:Graph/tass="field-bod) – a sub-graphsce">b">givensis paspan"fi,ois a>atbcasebreaph.adai i"fietlratbsub-graph/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t"> Parameters:I"fietlrEdgt/tass="field-bps="re class="xra class="reference internal" href="#tuli

BooleanP>operty.reve s/ /h3>
ccve s/s all>haluesle> ociated>/odgraphselements, i.edaedge.isValid"> isValid( isValid( isValid( isValid(operty.reve s/EdgtDirectulip>node">
BooleanP>operty.reve s/EdgtDirectulip/h3>
ccve s/s all>">abdirectuli ofsedgts is a>e attacheragraph w>ichdarebset ass.edge.isValid"> isValid(operty.getEdgtD iaultValu
BooleanP>operty.getEdgtD iaultValu
ccaph.ad">">d iault haluele> ociated>/oda>">edgts.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prboolean/ti class="xra class="reference internal" href="#tuli

edgt/t/tr>
BooleanP>operty.getEdgtValu
ccaph.ad">">haluele> ociated>/oda pasticularsedgt.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/ti class="xrmaintain the subevensph relation between graphs.) – if prboolean/ti class="xrmaintain the sub-graph relation between graphs.) – if pranlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertyfii class="xra class="reference internal" href="#tuli

BooleanP>operty.getNodeD iaultValu
ccaph.ad">">d iault haluele> ociated>/oda>">nodes.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prboolean/ti class="xra class="reference internal" href="#tuli

node/t/tr>
BooleanP>operty.getNodeValu
ccaph.ad">">haluele> ociated>/oda pasticularsnode.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/ti class="xrmaintain the subevensph relation between graphs.) – if prboolean/ti class="xrmaintain the sub-graph relation between graphs.) – if pranlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>opertyfii class="xra class="reference internal" href="#tuli

h a/t/tr>
BooleanP>operty.setAllEdgtValue /h3>
Setad">">scla haluelos a>e wholebset ofsedgts.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>h a/tstrong> (aem>boolean/tem>) – te">haluelto set onda>">edgts.fii class="xra class="reference internal" href="#tuli

h a/t/tr>
BooleanP>operty.setAllNodeValu
Setad">">scla haluelos a>e wholebset ofsnodes.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>h a/tstrong> (aem>boolean/tem>) – te">haluelto set onda>">nodes.e i class="xra class="reference internal" href="#tuli

edgt/t/tr,daem>h a/t/tr>
BooleanP>operty.setEdgtValue /h3>
Setad">">haluelofda pasticularsedgt.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/tliro lirastrong>h a/tstrong> (aem>boolean/tem>) – te">haluelto set onda>">edgt/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertyfips="re class="xra class="reference internal" href="#tuli

node/t/tr,daem>h a/t/tr>
BooleanP>operty.setNodeValu
Setad">">haluelofda pasticularsnode.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/tliro lirastrong>h a/tstrong> (aem>boolean/tem>) – te">haluelto set onda>">node/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>opertyfips="re class="xra class="reference internal" h internal" hidiv ) §ulipclasstlp-es o g>opertyp>noh3>/th>Cs o P>opertyctable>

opertyp/h3>
href="#tuli="#tu
me">opertyclils table>
Cs o P>operty /h3>
Base<: opertyIld-bface /h3> opertyIld-bface < Parameters:P>opertyIld-bfaceclass="field-bodh/"verref="#tuli
nodeDst/t/tr,daem>nodeSrc/t/tr,daem>g>op/t/tr>ame">Parametoptulield-[/tass=",daem>ifNotD iault=False/t/tr>ame">Parametoptulield-]/tass="f
Cs o P>operty.copy /h3>
noame">Parametve culimodi#82d >New> s ve culi 3.8.class="fi"verp>Copiesste">haluelholdsbysasg>operty on a>nodtsao anoVher>nodtsonia>issg>operty.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst le>t simple to lirastrong>nodeDst/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – a>">nodtsao copyste">haluelto./tliro lirastrong>nodeSrc/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – a>">nodtsao copyste">haluelpsom./tliro lirastrong>g>op/tatrong> (a" /> operty /h3> operty <.edge.isValid"> Parameters:Cs o P>opertyclass="field-bod) – a>">g>operty holdung te">haluelto copy./tliro lirastrong>ifNotD iault/tstrong> (aem>boolean/tem>) – whea>"r ao nceortsd iault-valuated>nodessor>not. D iaults ass.edge.isValid"> isValid(edgtDst/t/tr,daem>edgtSrc/t/tr,daem>g>op/t/tr>ame">Parametoptulield-[/tass=",daem>ifNotD iault=False/t/tr>ame">Parametoptulield-]/tass="f noame">Parametve culimodi#82d >New> s ve culi 3.8.class="fi"verp>Copiesste">haluelholdsbysasg>operty on ansedgt ao anoVher>edgt onia>issg>operty.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst le>t simple to lirastrong>edgtDst/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – a>">nodtsao copyste">haluelto./tliro lirastrong>edgtSrc/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – a>">nodtsao copyste">haluelpsom./tliro lirastrong>g>op/tatrong> (a" /> operty /h3> operty <.edge.isValid"> Parameters:Cs o P>opertyclass="field-bod) – a>">g>operty holdung te">haluelto copy./tliro lirastrong>ifNotD iault/tstrong> (aem>boolean/tem>) – whea>"r ao nceortsd iault-valuated>nodessor>not. D iaults ass.edge.isValid"> isValid(g>op/t/tr> noame">Parametve culimodi#82d >New> s ve culi 3.8.class="fi"verp>Copiesste">halueslholdsbysasg>operty on a>issg>operty.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>g>op/tatrong> (a" /> operty /h3> operty <.edge.isValid"> Parameters:Cs o P>opertyclass="field-bod) – a>">g>operty to copy"re class="xra class="reference internal" href="#tuli

Cs o P>operty.getEdgtD iaultValu
ccaph.ad">">d iault haluele> ociated>/oda>">edgts.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if pra" /> Parameters:Cs o class="field-bodh/e class="xra class="reference internal" href="#tuli

edgt/t/tr>
Cs o P>operty.getEdgtValu
ccaph.ad">">haluele> ociated>/oda pasticularsedgt.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/ti class="xrmaintain the subevensph relation between graphs.) – if pra" /> Parameters:Cs o class="field-bodh/e class="xrmaintain the sub-graph relation between graphs.) – if pranlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertyfii class="xra class="reference internal" href="#tuli

Cs o P>operty.getNodeD iaultValu
ccaph.ad">">d iault haluele> ociated>/oda>">nodes.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if pra" /> Parameters:Cs o class="field-bodh/e class="xra class="reference internal" href="#tuli

node/t/tr>
Cs o P>operty.getNodeValu
ccaph.ad">">haluele> ociated>/oda pasticularsnode.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/ti class="xrmaintain the subevensph relation between graphs.) – if pra" /> Parameters:Cs o class="field-bodh/e class="xrmaintain the sub-graph relation between graphs.) – if pranlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>opertyfii class="xra class="reference internal" href="#tuli

h a/t/tr>
Cs o P>operty.setAllEdgtValue /h3>
Setad">">scla haluelos a>e wholebset ofsedgts.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>h a/tstrong> (a" /> Parameters:Cs o class="field-bod) – te">haluelto set onda>">edgts.fii class="xra class="reference internal" href="#tuli

h a/t/tr>
Cs o P>operty.setAllNodeValu
Setad">">scla haluelos a>e wholebset ofsnodes.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>h a/tstrong> (a" /> Parameters:Cs o class="field-bod) – te">haluelto set onda>">nodes.e i class="xra class="reference internal" href="#tuli

edgt/t/tr,daem>h a/t/tr>
Cs o P>operty.setEdgtValue /h3>
Setad">">haluelofda pasticularsedgt.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/tliro lirastrong>h a/tstrong> (a" /> Parameters:Cs o class="field-bod) – te">haluelto set onda>">edgt/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertyfips="re class="xra class="reference internal" href="#tuli

node/t/tr,daem>h a/t/tr>
Cs o P>operty.setNodeValu
Setad">">haluelofda pasticularsnode.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/tliro lirastrong>h a/tstrong> (a" /> Parameters:Cs o class="field-bod) – te">haluelto set onda>">node/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>opertyfips="re class="xra class="reference internal" h internal" hidiv ) §ulipclasstlp-douereg>opertyp>noh3>/th>DouereP>opertyctable>

opertyp/h3>
href="#tuli="#tu
me">opertyclils table>
DouereP>operty /h3>
Base<: opertyIld-bface /h3> opertyIld-bface < Parameters:P>opertyIld-bfaceclass="field-bodh/"verref="#tuli
nodeDst/t/tr,daem>nodeSrc/t/tr,daem>g>op/t/tr>ame">Parametoptulield-[/tass=",daem>ifNotD iault=False/t/tr>ame">Parametoptulield-]/tass="f
DouereP>operty.copy /h3>
noame">Parametve culimodi#82d >New> s ve culi 3.8.class="fi"verp>Copiesste">haluelholdsbysasg>operty on a>nodtsao anoVher>nodtsonia>issg>operty.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst le>t simple to lirastrong>nodeDst/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – a>">nodtsao copyste">haluelto./tliro lirastrong>nodeSrc/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – a>">nodtsao copyste">haluelpsom./tliro lirastrong>g>op/tatrong> (a" /> operty /h3> operty <.edge.isValid"> Parameters:DouereP>opertyclass="field-bod) – a>">g>operty holdung te">haluelto copy./tliro lirastrong>ifNotD iault/tstrong> (aem>boolean/tem>) – whea>"r ao nceortsd iault-valuated>nodessor>not. D iaults ass.edge.isValid"> isValid(edgtDst/t/tr,daem>edgtSrc/t/tr,daem>g>op/t/tr>ame">Parametoptulield-[/tass=",daem>ifNotD iault=False/t/tr>ame">Parametoptulield-]/tass="f noame">Parametve culimodi#82d >New> s ve culi 3.8.class="fi"verp>Copiesste">haluelholdsbysasg>operty on ansedgt ao anoVher>edgt onia>issg>operty.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst le>t simple to lirastrong>edgtDst/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – a>">nodtsao copyste">haluelto./tliro lirastrong>edgtSrc/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – a>">nodtsao copyste">haluelpsom./tliro lirastrong>g>op/tatrong> (a" /> operty /h3> operty <.edge.isValid"> Parameters:DouereP>opertyclass="field-bod) – a>">g>operty holdung te">haluelto copy./tliro lirastrong>ifNotD iault/tstrong> (aem>boolean/tem>) – whea>"r ao nceortsd iault-valuated>nodessor>not. D iaults ass.edge.isValid"> isValid(g>op/t/tr> noame">Parametve culimodi#82d >New> s ve culi 3.8.class="fi"verp>Copiesste">halueslholdsbysasg>operty on a>issg>operty.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>g>op/tatrong> (a" /> operty /h3> operty <.edge.isValid"> Parameters:DouereP>opertyclass="field-bod) – a>">g>operty to copy"re class="xra class="reference internal" href="#tuli

Parametoptulield-[/tass="gem>subgraph = None/t/tr>ame">Parametoptulield-]/tass="f
DouereP>operty.getNodeMiip/h3>
ccaph.ad">">md="mum haluelos a>e nodessflroperty.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>subgraph/tatrong> (a" /> Parameters:Graph/tass="field-bod) – a sub-graphsce">b">givensis paspan"fi,ois a>atbcasebreaph.d">">md="mum haluelos a>e nodessbelongings/os">atbsub-graph.e i class="xrmaintain the subevensph relation between graphs.) – if prfloat"re class="xra class="reference internal" href="#tuli

Parametoptulield-[/tass="gem>subgraph = None/t/tr>ame">Parametoptulield-]/tass="f
DouereP>operty.getNodeMaxp/h3>
ccaph.ad">">max"mum haluelos a>e nodessflroperty.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>subgraph/tatrong> (a" /> Parameters:Graph/tass="field-bod) – a sub-graphsce">b">givensis paspan"fi,ois a>atbcasebreaph.d">">max"mum haluelos a>e nodessbelongings/os">atbsub-graph.e i class="xrmaintain the subevensph relation between graphs.) – if prfloat"re class="xra class="reference internal" href="#tuli

Parametoptulield-[/tass="gem>subgraph = None/t/tr>ame">Parametoptulield-]/tass="f
DouereP>operty.getEdgtMiip/h3>
ccaph.ad">">md="mum haluelos a>e edgts flroperty.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>subgraph/tatrong> (a" /> Parameters:Graph/tass="field-bod) – a sub-graphsce">b">givensis paspan"fi,ois a>atbcasebreaph.d">">md="mum haluelos a>e edgtssbelongings/os">atbsub-graph.e i class="xrmaintain the subevensph relation between graphs.) – if prfloat"re class="xra class="reference internal" href="#tuli

Parametoptulield-[/tass="gem>subgraph = None/t/tr>ame">Parametoptulield-]/tass="f
DouereP>operty.getEdgtMaxp/h3>
ccaph.ad">">max"mum haluelos a>e edgts flroperty.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>subgraph/tatrong> (a" /> Parameters:Graph/tass="field-bod) – a sub-graphsce">b">givensis paspan"fi,ois a>atbcasebreaph.d">">max"mum haluelos a>e edgtssbelongings/os">atbsub-graph.e i class="xrmaintain the subevensph relation between graphs.) – if prfloat"re class="xra class="reference internal" href="#tuli

n/t/tr>
DouereP>operty.uniflrmQuantificatulip/h3>
clflrmadai uniflrm quantificatulilos nodessand edgtssbasedlos a>e halueslstoredlis a>atbesueresg>operty. Ai uniflrm quantificatuliltriessto sepaspte a>e nodessand edgtssis ">Paramessofdequihalent size accordings/os">"irs halueslinsiscreasingsordfi.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>n/tstrong> (aem>eld-ger/tem>) – te">numbersofddesiredlParames"re class="xra class="referencemiv>) &admo="tuli warning to p>) rst admo="tuli-h3> <">Warningfi"verp>) &le>t">Allsg>evious halueslos nodessand edgtsswillsb">fiesedland replacedsbyste">idsofdte">field"te"y>belongs/o.fi"ver iiv operty.nodesUniflrmQuantificatulip>node">n/t/tr>

DouereP>operty.nodesUniflrmQuantificatulip/h3>
clflrmadai uniflrm quantificatulilos nodessbasedlos a>e halueslstoredlis a>atbesueresg>operty. Ai uniflrm quantificatuliltriessto sepaspte a>e nodessis ">Paramessofdequihalent size accordings/os">"irs halueslinsiscreasingsordfi.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>n/tstrong> (aem>eld-ger/tem>) – te">numbersofddesiredlParames"re class="xra class="referencemiv>) &admo="tuli warning to p>) rst admo="tuli-h3> <">Warningfi"verp>) &le>t">Allsg>evious halueslos nodesswillsb">fiesedland replacedsbyste">idsofdte">field"te"y>belongs/o.fi"ver iiv operty.edgtsUniflrmQuantificatulip>node">n/t/tr>

DouereP>operty.edgtsUniflrmQuantificatulip/h3>
clflrmadai uniflrm quantificatulilos edgtssbasedlos a>e halueslstoredlis a>atbesueresg>operty. Ai uniflrm quantificatuliltriessto sepaspte a>e edgtssis ">Paramessofdequihalent size accordings/os">"irs halueslinsiscreasingsordfi.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>n/tstrong> (aem>eld-ger/tem>) – te">numbersofddesiredlParames"re class="xra class="referencemiv>) &admo="tuli warning to p>) rst admo="tuli-h3> <">Warningfi"verp>) &le>t">Allsg>evious halueslos edgtsswillsb">fiesedland replacedsbyste">idsofdte">field"te"y>belongs/o.fi"ver iiv operty.getEdgtD iaultValu

DouereP>operty.getEdgtD iaultValu
ccaph.ad">">d iault haluele> ociated>/oda>">edgts.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prfloat"re class="xra class="reference internal" href="#tuli

edgt/t/tr>
DouereP>operty.getEdgtValu
ccaph.ad">">haluele> ociated>/oda pasticularsedgt.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/ti class="xrmaintain the subevensph relation between graphs.) – if prfloat"re class="xrmaintain the sub-graph relation between graphs.) – if pranlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertyfii class="xra class="reference internal" href="#tuli

DouereP>operty.getNodeD iaultValu
ccaph.ad">">d iault haluele> ociated>/oda>">nodes.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prfloat"re class="xra class="reference internal" href="#tuli

node/t/tr>
DouereP>operty.getNodeValu
ccaph.ad">">haluele> ociated>/oda pasticularsnode.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/ti class="xrmaintain the subevensph relation between graphs.) – if prfloat"re class="xrmaintain the sub-graph relation between graphs.) – if pranlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>opertyfii class="xra class="reference internal" href="#tuli

h a/t/tr>
DouereP>operty.setAllEdgtValue /h3>
Setad">">scla haluelos a>e wholebset ofsedgts.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>v a/tstrong> (aem>float"rem>) – te">haluelto set onda>">edgts.e i class="xra class="reference internal" href="#tuli

h a/t/tr>
DouereP>operty.setAllNodeValu
Setad">">scla haluelos a>e wholebset ofsnodes.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>v a/tstrong> (aem>float"rem>) – te">haluelto set onda>">nodes.e i class="xra class="reference internal" href="#tuli

edgt/t/tr,daem>h a/t/tr>
DouereP>operty.setEdgtValue /h3>
Setad">">haluelofda pasticularsedgt.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/tliro lirastrong>v a/tstrong> (aem>float"rem>) – te">haluelto set onda>">edgt/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertyfips="re class="xra class="reference internal" href="#tuli

node/t/tr,daem>h a/t/tr>
DouereP>operty.setNodeValu
Setad">">haluelofda pasticularsnode.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/tliro lirastrong>v a/tstrong> (aem>float"rem>) – te">haluelto set onda>">node/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>opertyfips="re class="xra class="reference internal" h internal" hidiv ) §ulipclasstlp-eld-gerg>opertyp>noh3>/th>Ild-gerP>opertyctable>

opertyp/h3>
href="#tuli="#tu
me">opertyclils table>
Ild-gerP>operty /h3>
Base<: opertyIld-bface /h3> opertyIld-bface < Parameters:P>opertyIld-bfaceclass="field-bodh/"verref="#tuli
nodeDst/t/tr,daem>nodeSrc/t/tr,daem>g>op/t/tr>ame">Parametoptulield-[/tass=",daem>ifNotD iault=False/t/tr>ame">Parametoptulield-]/tass="f
Ild-gerP>operty.copy /h3>
noame">Parametve culimodi#82d >New> s ve culi 3.8.class="fi"verp>Copiesste">haluelholdsbysasg>operty on a>nodtsao anoVher>nodtsonia>issg>operty.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst le>t simple to lirastrong>nodeDst/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – a>">nodtsao copyste">haluelto./tliro lirastrong>nodeSrc/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – a>">nodtsao copyste">haluelpsom./tliro lirastrong>g>op/tatrong> (a" /> operty /h3> operty <.edge.isValid"> Parameters:Ild-gerP>opertyclass="field-bod) – a>">g>operty holdung te">haluelto copy./tliro lirastrong>ifNotD iault/tstrong> (aem>boolean/tem>) – whea>"r ao nceortsd iault-valuated>nodessor>not. D iaults ass.edge.isValid"> isValid(edgtDst/t/tr,daem>edgtSrc/t/tr,daem>g>op/t/tr>ame">Parametoptulield-[/tass=",daem>ifNotD iault=False/t/tr>ame">Parametoptulield-]/tass="f noame">Parametve culimodi#82d >New> s ve culi 3.8.class="fi"verp>Copiesste">haluelholdsbysasg>operty on ansedgt ao anoVher>edgt onia>issg>operty.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst le>t simple to lirastrong>edgtDst/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – a>">nodtsao copyste">haluelto./tliro lirastrong>edgtSrc/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – a>">nodtsao copyste">haluelpsom./tliro lirastrong>g>op/tatrong> (a" /> operty /h3> operty <.edge.isValid"> Parameters:Ild-gerP>opertyclass="field-bod) – a>">g>operty holdung te">haluelto copy./tliro lirastrong>ifNotD iault/tstrong> (aem>boolean/tem>) – whea>"r ao nceortsd iault-valuated>nodessor>not. D iaults ass.edge.isValid"> isValid(g>op/t/tr> noame">Parametve culimodi#82d >New> s ve culi 3.8.class="fi"verp>Copiesste">halueslholdsbysasg>operty on a>issg>operty.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>g>op/tatrong> (a" /> operty /h3> operty <.edge.isValid"> Parameters:Ild-gerP>opertyclass="field-bod) – a>">g>operty to copy"re class="xra class="reference internal" href="#tuli

Parametoptulield-[/tass="gem>subgraph = None/t/tr>ame">Parametoptulield-]/tass="f
Ild-gerP>operty.getNodeMiip/h3>
ccaph.ad">">md="mum haluelos a>e nodessflroperty.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>subgraph/tatrong> (a" /> Parameters:Graph/tass="field-bod) – a sub-graphsce">b">givensis paspan"fi,ois a>atbcasebreaph.d">">md="mum haluelos a>e nodessbelongings/os">atbsub-graph.e i class="xrmaintain the subevensph relation between graphs.) – if preld-ger/te class="xra class="reference internal" href="#tuli

Parametoptulield-[/tass="gem>subgraph = None/t/tr>ame">Parametoptulield-]/tass="f
Ild-gerP>operty.getNodeMaxp/h3>
ccaph.ad">">max"mum haluelos a>e nodessflroperty.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>subgraph/tatrong> (a" /> Parameters:Graph/tass="field-bod) – a sub-graphsce">b">givensis paspan"fi,ois a>atbcasebreaph.d">">max"mum haluelos a>e nodessbelongings/os">atbsub-graph.e i class="xrmaintain the subevensph relation between graphs.) – if preld-ger/te class="xra class="reference internal" href="#tuli

Parametoptulield-[/tass="gem>subgraph = None/t/tr>ame">Parametoptulield-]/tass="f
Ild-gerP>operty.getEdgtMiip/h3>
ccaph.ad">">md="mum haluelos a>e edgts flroperty.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>subgraph/tatrong> (a" /> Parameters:Graph/tass="field-bod) – a sub-graphsce">b">givensis paspan"fi,ois a>atbcasebreaph.d">">md="mum haluelos a>e edgtssbelongings/os">atbsub-graph.e i class="xrmaintain the subevensph relation between graphs.) – if preld-ger/te class="xra class="reference internal" href="#tuli

Parametoptulield-[/tass="gem>subgraph = None/t/tr>ame">Parametoptulield-]/tass="f
Ild-gerP>operty.getEdgtMaxp/h3>
ccaph.ad">">max"mum haluelos a>e edgts flroperty.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>subgraph/tatrong> (a" /> Parameters:Graph/tass="field-bod) – a sub-graphsce">b">givensis paspan"fi,ois a>atbcasebreaph.d">">max"mum haluelos a>e edgtssbelongings/os">atbsub-graph.e i class="xrmaintain the subevensph relation between graphs.) – if preld-ger/te class="xra class="reference internal" href="#tuli

Ild-gerP>operty.getEdgtD iaultValu
ccaph.ad">">d iault haluele> ociated>/oda>">edgts.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if preld-ger/te class="xra class="reference internal" href="#tuli

edgt/t/tr>
Ild-gerP>operty.getEdgtValu
ccaph.ad">">haluele> ociated>/oda pasticularsedgt.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/ti class="xrmaintain the subevensph relation between graphs.) – if preld-ger/te class="xrmaintain the sub-graph relation between graphs.) – if pranlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertyfii class="xra class="reference internal" href="#tuli

Ild-gerP>operty.getNodeD iaultValu
ccaph.ad">">d iault haluele> ociated>/oda>">nodes.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if preld-ger/te class="xra class="reference internal" href="#tuli

node/t/tr>
Ild-gerP>operty.getNodeValu
ccaph.ad">">haluele> ociated>/oda pasticularsnode.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/ti class="xrmaintain the subevensph relation between graphs.) – if preld-ger/te class="xrmaintain the sub-graph relation between graphs.) – if pranlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>opertyfii class="xra class="reference internal" href="#tuli

h a/t/tr>
Ild-gerP>operty.setAllEdgtValue /h3>
Setad">">scla haluelos a>e wholebset ofsedgts.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>v a/tstrong> (aem>eld-ger/tem>) – te">haluelto set onda>">edgts.e i class="xra class="reference internal" href="#tuli

h a/t/tr>
Ild-gerP>operty.setAllNodeValu
Setad">">scla haluelos a>e wholebset ofsnodes.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>v a/tstrong> (aem>eld-ger/tem>) – te">haluelto set onda>">nodes.e i class="xra class="reference internal" href="#tuli

edgt/t/tr,daem>h a/t/tr>
Ild-gerP>operty.setEdgtValue /h3>
Setad">">haluelofda pasticularsedgt.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/tliro lirastrong>v a/tstrong> (aem>eld-ger/tem>) – te">haluelto set onda>">edgt/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertyfips="re class="xra class="reference internal" href="#tuli

node/t/tr,daem>h a/t/tr>
Ild-gerP>operty.setNodeValu
Setad">">haluelofda pasticularsnode.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/tliro lirastrong>v a/tstrong> (aem>eld-ger/tem>) – te">haluelto set onda>">node/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>opertyfips="re class="xra class="reference internal" h internal" hidiv ) §ulipclasstlp-layoutg>opertyp>noh3>/th>LayoutP>opertyctable>

opertyp/h3>
href="#tuli="#tu
me">opertyclils table>
LayoutP>operty /h3>
Base<: opertyIld-bface /h3> opertyIld-bface < Parameters:P>opertyIld-bfaceclass="field-bodh/"verref="#tuli
node/t/tr>ame">Parametoptulield-[/tass=",daem>subgraph=None/t/tr>ame">Parametoptulield-]/tass="f
LayoutP>operty.angularResolutulis//h3>
ccaph.ada 3.7lofdall angular resolutulilofda node. I clsloslydt id=eraflr<2D drawung, meanung te">"> rt>New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/tliro lirastrong>subgraph/tatrong> (a" /> Parameters:Graph/tass="field-bod) – a sub-graphsce">b">givensis paspan"fi,ois a>atbcasebreaph.ad">"> 3.7lofdangular resolutulilflrnodtsis a>atbsub-graph/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst"> 3.7lofdfloat"rps="re class="xrmaintain the sub-graph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>opertysor>ifsa>">g>oviderasub-graphsis>not>addescendantsofdte">graph attachera/od/t">g>opertyfips="re class="xra class="reference internal" href="#tuli

Parametoptulield-[/tass="gem>subgraph = None/t/tr>ame">Parametoptulield-]/tass="f
LayoutP>operty.avfiegeAngularResolutuli//h3>
ccaph.ad">">avfiege angular resolutulilofd">"> ayout. I clsloslydt id=eraflr<2D drawung, meanung te">"> rt>New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>subgraph/tatrong> (a" /> Parameters:Graph/tass="field-bod) – a sub-graphsce">b">givensis paspan"fi,ois a>atbcasebcomputead">">avfiege angular resolutulilflr ayoutlofd">">nodessbelongings/os">atbsub-graph.e i class="xrmaintain the subevensph relation between graphs.) – if prfloat"re class="xrmaintain the sub-graph relation between graphs.) – if pranlexceptuli ifsa>">g>oviderasub-graphsis>not>addescendantsofdte">graph attachera/od/t">g>opertyfie class="xra class="reference internal" href="#tuli

node">node/t/tr>ame">Parametoptulield-[/tass=",daem>subgraph = None/t/tr>ame">Parametoptulield-]/tass="f ccaph.ad">">avfiege angular resolutulilofda node. I clsloslydt id=eraflr<2D drawung, meanung te">"> rt>New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/tliro lirastrong>subgraph/tatrong> (a" /> Parameters:Graph/tass="field-bod) – a sub-graphsce">b">givensis paspan"fi,ois a>atbcasebcomputead">">avfiege angular resolutulilofda nodesis a>atbsub-graph./tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst">float"rps="re class="xrmaintain the sub-graph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>opertysor>ifsa>">g>oviderasub-graphsis>not>addescendantsofdte">graph attachera/od/t">g>opertyfips="re class="xra class="reference internal" href="#tuli

Parametoptulield-[/tass="gem>subgraph=None/t/tr>ame">Parametoptulield-]/tass="f
LayoutP>operty.avfiegeEdgtLength//h3>
noame">Parametve culimodi#82d >New> s ve culi 3.7.class="fi"verp>ccaph.ad">">avfiege edgtslengthlofd">"> ayout,d">">bends ar">"akensis/odaccount.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>subgraph/tatrong> (a" /> Parameters:Graph/tass="field-bod) – a sub-graphsce">b">givensis paspan"fi,ois a>atbcaseboslydcomputead">">avfiege edgtslengthlflrg>oviderasub-graphsis>not>addescendantsofdte">graph attachera/od/t">g>opertyfie class="xra class="reference internal" href="#tuli

node">Parametoptulield-[/tass="gem>subgraph = None/t/tr>ame">Parametoptulield-]/tass="f
LayoutP>operty.cen"fi /h3>
Cen"fisd">"> ayout,dmeanung transla7ung i"delsordfi">cen"fisofditssboundung boxsis>(0,0,0)e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>subgraph/tatrong> (a" /> Parameters:Graph/tass="field-bod) – a sub-graphsce">b">givensis paspan"fi,ois a>atbcaseboslydcen"fisd">"> ayoutsofdtea"dsub-graph.e i class="xrmaintain the subevensph relation between graphs.) – if pranlexceptuli ifsa>">g>oviderasub-graphsis>not>addescendantsofdte">graph attachera/od/t">g>opertyfie class="xra class="reference internal" href="#tuli

node">newCen"fi/t/tr>ame">Parametoptulield-[/tass=",daem>subgraph = None/t/tr>ame">Parametoptulield-]/tass="f noame">Parametve culimodi#82d >New> s ve culi 3.7.class="fi"verp>Cen"fisd">"> ayouta/odnewCen"fi,dmeanung transla7ung i"delsordfi">cen"fisofditssboundung boxsis>equala/odnewCen"fi.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>newCen"fi/tatrong> (a" /> Parameters:Vec3f/tass="field-bod) – a>">new>cen"fisofd">"> ayout/tliro lirastrong>subgraph/tatrong> (a" /> Parameters:Graph/tass="field-bod) – a sub-graphsce">b">givensis paspan"fi,ois a>atbcaseboslydcen"fisd">"> ayoutsofdtea"dsub-graph.e liro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">g>oviderasub-graphsis>not>addescendantsofdte">graph attachera/od/t">g>opertyfips="re class="xra class="reference internal" href="#tuli

Parametoptulield-[/tass="gem>subgraph=None/t/tr>ame">Parametoptulield-]/tass="f
LayoutP>operty.computeEmbeddung /h3>
Fixeadembeddungsofdte">graph accordings/os">"> ayout, ie. sort edgtssaround>nodessaccordings/os">"ir>neighbors/bends posituli ind">"> ayout. Oslydworks ind2D, te">"> rt>"akensis/odaccount.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>subgraph/tatrong> (a" /> Parameters:Graph/tass="field-bod) – a sub-graphsce">b">givensis paspan"fi,ois a>atbcasebfixeadembeddungsofdteatbsub-graph/ti class="xrmaintain the subevensph relation between graphs.) – if pranlexceptuli ifsa>">g>oviderasub-graphsis>not>addescendantsofdte">graph attachera/od/t">g>opertyfie class="xra class="reference internal" href="#tuli

node">node/t/tr>ame">Parametoptulield-[/tass=",daem>subgraph=None/t/tr>ame">Parametoptulield-]/tass="f Fixeadembeddungsofdte">nodtsaccordings/os">"> ayout, ie. sort edgtssaround>te">nodtsaccordings/os">"ir>neighbors/bends posituli ind">"> ayout. Oslydworks ind2D, te">"> rt>"akensis/odaccount.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>subgraph/tatrong> (a" /> Parameters:Graph/tass="field-bod) – a sub-graphsce">b">givensis paspan"fi,ois a>atbcasebfixeadembeddungsofdte">nodtsis a>atbsub-graph/ti class="xrmaintain the subevensph relation between graphs.) – if pranlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>opertysor>ifsa>">g>oviderasub-graphsis>not>addescendantsofdte">graph attachera/od/t">g>opertyfie class="xra class="reference internal" href="#tuli

nodeDst/t/tr,daem>nodeSrc/t/tr,daem>g>op/t/tr>ame">Parametoptulield-[/tass=",daem>ifNotD iault=False/t/tr>ame">Parametoptulield-]/tass="f
LayoutP>operty.copy /h3>
noame">Parametve culimodi#82d >New> s ve culi 3.8.class="fi"verp>Copiesste">haluelholdsbysasg>operty on a>nodtsao anoVher>nodtsonia>issg>operty.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst le>t simple to lirastrong>nodeDst/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – a>">nodtsao copyste">haluelto./tliro lirastrong>nodeSrc/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – a>">nodtsao copyste">haluelpsom./tliro lirastrong>g>op/tatrong> (a" /> operty /h3> operty <.edge.isValid"> Parameters:LayoutP>opertyclass="field-bod) – a>">g>operty holdung te">haluelto copy./tliro lirastrong>ifNotD iault/tstrong> (aem>boolean/tem>) – whea>"r ao nceortsd iault-valuated>nodessor>not. D iaults ass.edge.isValid"> isValid(edgtDst/t/tr,daem>edgtSrc/t/tr,daem>g>op/t/tr>ame">Parametoptulield-[/tass=",daem>ifNotD iault=False/t/tr>ame">Parametoptulield-]/tass="f noame">Parametve culimodi#82d >New> s ve culi 3.8.class="fi"verp>Copiesste">haluelholdsbysasg>operty on ansedgt ao anoVher>edgt onia>issg>operty.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst le>t simple to lirastrong>edgtDst/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – a>">nodtsao copyste">haluelto./tliro lirastrong>edgtSrc/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – a>">nodtsao copyste">haluelpsom./tliro lirastrong>g>op/tatrong> (a" /> operty /h3> operty <.edge.isValid"> Parameters:LayoutP>opertyclass="field-bod) – a>">g>operty holdung te">haluelto copy./tliro lirastrong>ifNotD iault/tstrong> (aem>boolean/tem>) – whea>"r ao nceortsd iault-valuated>nodessor>not. D iaults ass.edge.isValid"> isValid(g>op/t/tr> noame">Parametve culimodi#82d >New> s ve culi 3.8.class="fi"verp>Copiesste">halueslholdsbysasg>operty on a>issg>operty.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>g>op/tatrong> (a" /> operty /h3> operty <.edge.isValid"> Parameters:LayoutP>opertyclass="field-bod) – a>">g>operty to copy"re class="xra class="reference internal" href="#tuli

edgt/t/tr>
LayoutP>operty.edgtLength//h3>
ccaph.ad">">lengthlofdansedgt,d">">bends ar">"akensis/odaccount. Thus, i"dmeasuread">">lengthlofda polys="e.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/ti class="xrmaintain the subevensph relation between graphs.) – if prfloat"re class="xrmaintain the sub-graph relation between graphs.) – if pranlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertyfii class="xra class="referencemiv>) &admo="tuli warnung >nop>) rst admo="tuli-h3> <">Warnungfi"verp>) &le>t">T> ">lengthlofd/t">golys="e>between>bends, when usung curveass=ke Bezier>etc...d/t">reault will>not>bed">">lengthlofd/t">curve.fi"veridiv operty.getMiip>node">Parametoptulield-[/tass="gem>subgraph = None/t/tr>ame">Parametoptulield-]/tass="f

LayoutP>operty.getMiip/h3>
ccaph.ad">">md="mum atb ayoutsg>operty, i.e.d/t">bottom-lefe">ornfisofd">">graph drawungsboundung box.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>subgraph/tatrong> (a" /> Parameters:Graph/tass="field-bod) – a sub-graphsce">b">givensis paspan"fi,ois a>atbcasebreaph.d">">md="mum ">sub-graphs ayout."re class="xrmaintain the subevensph relation between graphs.) – if pr " /> Parameters:Coordclass="field-bodh/e class="xrmaintain the sub-graph relation between graphs.) – if pranlexceptuli ifsa>">g>oviderasub-graphsis>not>addescendantsofdte">graph attachera/od/t">g>opertyfie class="xra class="reference internal" href="#tuli

Parametoptulield-[/tass="gem>subgraph = None/t/tr>ame">Parametoptulield-]/tass="f
LayoutP>operty.getMaxp/h3>
ccaph.ad">">max"mum atb ayoutsg>operty, i.e.d/t">ors-righe">ornfisofd">">graph drawungsboundung box.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>subgraph/tatrong> (a" /> Parameters:Graph/tass="field-bod) – a sub-graphsce">b">givensis paspan"fi,ois a>atbcasebreaph.d">">max"mum ">sub-graphs ayout."re class="xrmaintain the subevensph relation between graphs.) – if pr " /> Parameters:Coordclass="field-bodh/e class="xrmaintain the sub-graph relation between graphs.) – if pranlexceptuli ifsa>">g>oviderasub-graphsis>not>addescendantsofdte">graph attachera/od/t">g>opertyfie class="xra class="reference internal" href="#tuli

Parametoptulield-[/tass="gem>subgraph = None/t/tr>ame">Parametoptulield-]/tass="f
LayoutP>operty.nolass=z
Nolass=z"> ayout,dmeanung dividung each>nodessand edgtss">max"mum mag="tudelofd">">wholebNew in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>subgraph/tatrong> (a" /> Parameters:Graph/tass="field-bod) – a sub-graphsce">b">givensis paspan"fi,ois a>atbcaseboslydnolass=z"> ayoutsofdtea"dsub-graph.e i class="xrmaintain the subevensph relation between graphs.) – if pranlexceptuli ifsa>">g>oviderasub-graphsis>not>addescendantsofdte">graph attachera/od/t">g>opertyfie class="xra class="reference internal" href="#tuli

LayoutP>operty.perfectAspectRatul//h3>
Scal"> ayoutselsordfioach>anlaspect ratul (widion/ height)sofd1.0 .fi"veridnternal" href="#tuli
alpha/t/tr>ame">Parametoptulield-[/tass=",daem>subgraph = None/t/tr>ame">Parametoptulield-]/tass="f
LayoutP>operty.rotateX//h3>
noame">Parametve culimodi#82d >New> s ve culi 3.7.class="fi"verp>cotatesd">"> ayoutsaround>te">X-ax"ssaccordings/osanlanglelis degrees.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>alpha/tstrong> (aem>float"rem>) – anlanglelis degrees/tliro lirastrong>subgraph/tatrong> (a" /> Parameters:Graph/tass="field-bod) – a sub-graphsce">b">givensis paspan"fi,ois a>atbcasebrotatesd">"> ayoutsofd">">nodessbelongings/os">atbsub-graph.e liro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">g>oviderasub-graphsis>not>addescendantsofdte">graph attachera/od/t">g>opertyfips="re class="xra class="reference internal" href="#tuli

node">alpha/t/tr,daem>itNodes/t/tr,daem>itEdgts/t/tr> cotatesd">"> ayoutsaround>te">X-ax"ssofd">">nodessand edgtssg>oviderathroughsi"fietorssaccordings/osanlanglelis degrees.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst le>t simple to lirastrong>alpha/tstrong> (aem>float"rem>) – anlanglelis degrees/tliro lirastrong>itNodes/tstrong> (aParameters:I"fietorNode/tass="field) – anli"fietor on graph nodes/tliro lirastrong>itEdgts/tstrong> (aParameters:I"fietorEdgt/tass="field) – anli"fietor on graph edgts/tliro /uls="re class="xra class="reference internal" href="#tuli

alpha/t/tr>ame">Parametoptulield-[/tass=",daem>subgraph = None/t/tr>ame">Parametoptulield-]/tass="f
LayoutP>operty.rotateY//h3>
noame">Parametve culimodi#82d >New> s ve culi 3.7.class="fi"verp>cotatesd">"> ayoutsaround>te">Y-ax"ssaccordings/osanlanglelis degrees.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>alpha/tstrong> (aem>float"rem>) – anlanglelis degrees/tliro lirastrong>subgraph/tatrong> (a" /> Parameters:Graph/tass="field-bod) – a sub-graphsce">b">givensis paspan"fi,ois a>atbcasebrotatesd">"> ayoutsofd">">nodessbelongings/os">atbsub-graph.e liro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">g>oviderasub-graphsis>not>addescendantsofdte">graph attachera/od/t">g>opertyfips="re class="xra class="reference internal" href="#tuli

node">alpha/t/tr,daem>itNodes/t/tr,daem>itEdgts/t/tr> cotatesd">"> ayoutsaround>te">Y-ax"ssofd">">nodessand edgtssg>oviderathroughsi"fietorssaccordings/osanlanglelis degrees.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst le>t simple to lirastrong>alpha/tstrong> (aem>float"rem>) – anlanglelis degrees/tliro lirastrong>itNodes/tstrong> (aParameters:I"fietorNode/tass="field) – anli"fietor on graph nodes/tliro lirastrong>itEdgts/tstrong> (aParameters:I"fietorEdgt/tass="field) – anli"fietor on graph edgts/tliro /uls="re class="xra class="reference internal" href="#tuli

alpha/t/tr>ame">Parametoptulield-[/tass=",daem>subgraph = None/t/tr>ame">Parametoptulield-]/tass="f
LayoutP>operty.rotateZp/h3>
cotatesd">"> ayoutsaround>te">Z-ax"ssaccordings/osanlanglelis degrees.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>alpha/tstrong> (aem>float"rem>) – anlanglelis degrees/tliro lirastrong>subgraph/tatrong> (a" /> Parameters:Graph/tass="field-bod) – a sub-graphsce">b">givensis paspan"fi,ois a>atbcasebrotatesd">"> ayoutsofd">">nodessbelongings/os">atbsub-graph.e liro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">g>oviderasub-graphsis>not>addescendantsofdte">graph attachera/od/t">g>opertyfips="re class="xra class="reference internal" href="#tuli

node">alpha/t/tr,daem>itNodes/t/tr,daem>itEdgts/t/tr> cotatesd">"> ayoutsaround>te">Z-ax"ssofd">">nodessand edgtssg>oviderathroughsi"fietorssaccordings/osanlanglelis degrees.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst le>t simple to lirastrong>alpha/tstrong> (aem>float"rem>) – anlanglelis degrees/tliro lirastrong>itNodes/tstrong> (aParameters:I"fietorNode/tass="field) – anli"fietor on graph nodes/tliro lirastrong>itEdgts/tstrong> (aParameters:I"fietorEdgt/tass="field) – anli"fietor on graph edgts/tliro /uls="re class="xra class="reference internal" href="#tuli

scalame">Parametoptulield-[/tass=",daem>subgraph = None/t/tr>ame">Parametoptulield-]/tass="f
LayoutP>operty.scal
Scal"> ayoutsaccordings/osa vector of scal< factors (sx, sy, sz).e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>movt/tatrong> (a" /> Parameters:Vec3f/tass="field-bod) – a vector of scal< factors/tliro lirastrong>subgraph/tatrong> (a" /> Parameters:Graph/tass="field-bod) – a sub-graphsce">b">givensis paspan"fi,ois a>atbcasebscal"> ayoutsofd">">nodessbelongings/os">atbsub-graph.e liro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">g>oviderasub-graphsis>not>addescendantsofdte">graph attachera/od/t">g>opertyfips="re class="xra class="reference internal" href="#tuli

node">scalitNodes/t/tr,daem>itEdgts/t/tr> Scal"> ayoutsofd">">nodessand edgtssg>oviderathroughsi"fietorssaccordings/osa vector of scal< factors (sx, sy, sz).e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst le>t simple to lirastrong>movt/tatrong> (a" /> Parameters:Vec3f/tass="field-bod) – a vector of scal< factors/tliro lirastrong>itNodes/tstrong> (aParameters:I"fietorNode/tass="field) – anli"fietor on graph nodes/tliro lirastrong>itEdgts/tstrong> (aParameters:I"fietorEdgt/tass="field) – anli"fietor on graph edgts/tliro /uls="re class="xra class="reference internal" href="#tuli

movt/t/tr>ame">Parametoptulield-[/tass=",daem>subgraph = None/t/tr>ame">Parametoptulield-]/tass="f
LayoutP>operty.transla7
Transla7curss=t> ayoutsaccordings/osa movtms=t>vector.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>movt/tatrong> (a" /> Parameters:Vec3f/tass="field-bod) – a movtms=t>vector/tliro lirastrong>subgraph/tatrong> (a" /> Parameters:Graph/tass="field-bod) – a sub-graphsce">b">givensis paspan"fi,ois a>atbcasebtransla7 ayoutsofd">">nodessbelongings/os">atbsub-graph.e liro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">g>oviderasub-graphsis>not>addescendantsofdte">graph attachera/od/t">g>opertyfips="re class="xra class="reference internal" href="#tuli

node">movt/t/tr,daem>itNodes/t/tr,daem>itEdgts/t/tr> Transla7 ayoutsofdalsetsofdnodessand edgtssg>oviderathroughsi"fietorssaccordings/osa movtms=t>vector.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst le>t simple to lirastrong>movt/tatrong> (a" /> Parameters:Vec3f/tass="field-bod) – a movtms=t>vector/tliro lirastrong>itNodes/tstrong> (aParameters:I"fietorNode/tass="field) – anli"fietor on graph nodes/tliro lirastrong>itEdgts/tstrong> (aParameters:I"fietorEdgt/tass="field) – anli"fietor on graph edgts/tliro /uls="re class="xra class="reference internal" href="#tuli

LayoutP>operty.getEdgtD iaultValuep/h3>
ccaph.ad">">d iault>haluele> ociated>/od/t">edgts.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if pr 3.7sofd " /> Parameters:Coordclass="field-bodh/e class="xra class="reference internal" href="#tuli

edgt/t/tr>
LayoutP>operty.getEdgtValuep/h3>
ccaph.ad">">haluele> ociated>/oda pasticular edgt.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/ti class="xrmaintain the subevensph relation between graphs.) – if pr 3.7sofd " /> Parameters:Coordclass="field-bodh/e class="xrmaintain the sub-graph relation between graphs.) – if pranlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertyfii class="xra class="reference internal" href="#tuli

LayoutP>operty.getNodeD iaultValuep/h3>
ccaph.ad">">d iault>haluele> ociated>/od/t">nodes.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if pr " /> Parameters:Coordclass="field-bodh/e class="xra class="reference internal" href="#tuli

node/t/tr>
LayoutP>operty.getNodeValuep/h3>
ccaph.ad">">haluele> ociated>/oda pasticular node.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/te class="xrmaintain the subevensph relation between graphs.) – if pr " /> Parameters:Coordclass="field-bodh/e class="xrmaintain the sub-graph relation between graphs.) – if pranlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>operty"re class="xra class="reference internal" href="#tuli

h a/t/tr>
LayoutP>operty.setAllEdgtValuep/h3>
Setad">">scla>haluelond">">wholebsetsofdedgts.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>h a/tatrong> ( 3.7sofd " /> Parameters:Coordclass="field-bod) – a>">haluelto setsond/t">edgts.e e class="xra class="reference internal" href="#tuli

h a/t/tr>
LayoutP>operty.setAllNodeValuep/h3>
Setad">">scla>haluelond">">wholebsetsofdnodes.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>h a/tatrong> ( " /> Parameters:Coordclass="field-bod) – a>">haluelto setsond/t">nodes.e e class="xra class="reference internal" href="#tuli

edgt/t/tr,daem>h a/t/tr>
LayoutP>operty.setEdgtValuep/h3>
Setad">">haluelofda pasticular edgt.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/tliro lirastrong>h a/tatrong> ( 3.7sofd " /> Parameters:Coordclass="field-bod) – a>">haluelto setsond/t">edgte liro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertyfips="re class="xra class="reference internal" href="#tuli

node/t/tr,daem>h a/t/tr>
LayoutP>operty.setNodeValuep/h3>
Setad">">haluelofda pasticular node.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/tliro lirastrong>h a/tatrong> ( " /> Parameters:Coordclass="field-bod) – a>">haluelto setsond/t">node/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>operty"rps="re class="xra class="reference internal" h internal" h iiv ) §uli"class=lp-sizeg>operty to h3SizeP>opertyctable>

operty /h3>
de">opertycield-table>
SizeP>operty /h3>
Bases:d " /> opertyIld-bface /h3> opertyIld-bface < Parameters:P>opertyIld-bfaceclass="field-bodh/p> href="#tuli
nodeDst/t/tr,daem>nodeSrc/t/tr,daem>g>op/t/tr>ame">Parametoptulield-[/tass=",daem>ifNotD iault=False/t/tr>ame">Parametoptulield-]/tass="f
SizeP>operty.copy /h3>
noame">Parametve culimodi#82d >New> s ve culi 3.8.class="fi"verp>Copiesste">haluelholdsbysasg>operty on a>nodtsao anoVher>nodtsonia>issg>operty.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst le>t simple to lirastrong>nodeDst/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – a>">nodtsao copyste">haluelto./tliro lirastrong>nodeSrc/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – a>">nodtsao copyste">haluelpsom./tliro lirastrong>g>op/tatrong> (a" /> operty /h3> operty <.edge.isValid"> Parameters:SizeP>opertyciass="field-bod) – a>">g>operty holdung te">haluelto copy./tliro lirastrong>ifNotD iault/tstrong> (aem>boolean/tem>) – whea>"r ao nceortsd iault-valuated>nodessor>not. D iaults ass.edge.isValid"> isValid(edgtDst/t/tr,daem>edgtSrc/t/tr,daem>g>op/t/tr>ame">Parametoptulield-[/tass=",daem>ifNotD iault=False/t/tr>ame">Parametoptulield-]/tass="f noame">Parametve culimodi#82d >New> s ve culi 3.8.class="fi"verp>Copiesste">haluelholdsbysasg>operty on ansedgt ao anoVher>edgt onia>issg>operty.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst le>t simple to lirastrong>edgtDst/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – a>">nodtsao copyste">haluelto./tliro lirastrong>edgtSrc/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – a>">nodtsao copyste">haluelpsom./tliro lirastrong>g>op/tatrong> (a" /> operty /h3> operty <.edge.isValid"> Parameters:SizeP>opertyciass="field-bod) – a>">g>operty holdung te">haluelto copy./tliro lirastrong>ifNotD iault/tstrong> (aem>boolean/tem>) – whea>"r ao nceortsd iault-valuated>nodessor>not. D iaults ass.edge.isValid"> isValid(g>op/t/tr> noame">Parametve culimodi#82d >New> s ve culi 3.8.class="fi"verp>Copiesste">halueslholdsbysasg>operty on a>issg>operty.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>g>op/tatrong> (a" /> operty /h3> operty <.edge.isValid"> Parameters:SizeP>opertyciass="field-bod) – a>">g>operty to copy"re class="xra class="reference internal" href="#tuli

Parametoptulield-[/tass="gem>subgraph = None/t/tr>ame">Parametoptulield-]/tass="f
SizeP>operty.getMiip/h3>
ccaph.ad">">md="mum haluelond">">nodessfor>">atbsizesg>operty.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>subgraph/tatrong> (a" /> Parameters:Graph/tass="field-bod) – a sub-graphsce">b">givensis paspan"fi,ois a>atbcasebreaph.d">">md="mum haluelond">">nodessbelongings/os">atbsub-graph.e e class="xrmaintain the subevensph relation between graphs.) – if pr " /> Parameters:Sizeclass="field-bodh/e class="xra class="reference internal" href="#tuli

Parametoptulield-[/tass="gem>subgraph = None/t/tr>ame">Parametoptulield-]/tass="f
SizeP>operty.getMaxp/h3>
ccaph.ad">">max"mum haluelond">">nodessfor>">atbsizesg>operty.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>subgraph/tatrong> (a" /> Parameters:Graph/tass="field-bod) – a sub-graphsce">b">givensis paspan"fi,ois a>atbcasebreaph.d">">max"mum haluelond">">nodessbelongings/os">atbsub-graph.e e class="xrmaintain the subevensph relation between graphs.) – if pr " /> Parameters:Sizeclass="field-bodh/e class="xra class="reference internal" href="#tuli

scalame">Parametoptulield-[/tass=",daem>subgraph = None/t/tr>ame">Parametoptulield-]/tass="f
SizeP>operty.scal
Scal">s=z">nodessand edgtssaccordings/osa scal< factors vector (sx, sy, sz).e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst le>t simple to lirastrong>scal (a" /> Parameters:Sizeclass="field-bod) – a vector of scalsubgraph/tatrong> (a" /> Parameters:Graph/tass="field-bod) – a sub-graphsce">b">givensis paspan"fi,ois a>atbcasebscal">sizesofd">">nodessbelongings/os">atbsub-graph.e liro /uls="re class="xra class="reference internal" href="#tuli

node">scalitNodes/t/tr,daem>itEdgts/t/tr> Scal">s=z">nodessand edgtssg>oviderathroughsi"fietorssaccordings/osa scal< factors vector (sx, sy, sz).e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst le>t simple to lirastrong>scal (a" /> Parameters:Sizeclass="field-bod) – a vector of scal< factors/tliro lirastrong>itNodes/tstrong> (aParameters:I"fietorNode/tass="field) – anli"fietor on graph nodes/tliro lirastrong>itEdgts/tstrong> (aParameters:I"fietorEdgt/tass="field) – anli"fietor on graph edgts/tliro /uls="re class="xra class="reference internal" href="#tuli

SizeP>operty.getEdgtD iaultValuep/h3>
ccaph.ad">">d iault>haluele> ociated>/od/t">edgts.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if pr " /> Parameters:Sizeclass="field-bodh/e class="xra class="reference internal" href="#tuli

edgt/t/tr>
SizeP>operty.getEdgtValuep/h3>
ccaph.ad">">haluele> ociated>/oda pasticular edgt.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/te class="xrmaintain the subevensph relation between graphs.) – if pr " /> Parameters:Sizeclass="field-bodh/e class="xrmaintain the sub-graph relation between graphs.) – if pranlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertyfii class="xra class="reference internal" href="#tuli

SizeP>operty.getNodeD iaultValuep>node">
SizeP>operty.getNodeD iaultValuep/h3>
ccaph.ad">">d iault>haluele> ociated>/od/t">nodes.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if pr " /> Parameters:Sizeclass="field-bodh/e class="xra class="reference internal" href="#tuli

SizeP>operty.getNodeValuep>node">node/t/tr>
SizeP>operty.getNodeValuep/h3>
ccaph.ad">">haluele> ociated>/oda pasticular node.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/te class="xrmaintain the subevensph relation between graphs.) – if pr " /> Parameters:Sizeclass="field-bodh/e class="xrmaintain the sub-graph relation between graphs.) – if pranlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>operty"re class="xra class="reference internal" href="#tuli

SizeP>operty.setAllEdgtValuep>node">h a/t/tr>
SizeP>operty.setAllEdgtValuep/h3>
Setad">">scla>haluelond">">wholebsetsofdedgts.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>h a/tatrong> ( " /> Parameters:Sizeclass="field-bod) – a>">haluelto setsond/t">edgts.e e class="xra class="reference internal" href="#tuli

h a/t/tr>
SizeP>operty.setAllNodeValuep/h3>
Setad">">scla>haluelond">">wholebsetsofdnodes.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>h a/tatrong> ( " /> Parameters:Sizeclass="field-bod) – a>">haluelto setsond/t">nodes.e e class="xra class="reference internal" href="#tuli

edgt/t/tr,daem>h a/t/tr>
SizeP>operty.setEdgtValuep/h3>
Setad">">haluelofda pasticular edgt.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/tliro lirastrong>h a/tatrong> ( " /> Parameters:Sizeclass="field-bod) – a>">haluelto setsond/t">edgte liro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertyfips="re class="xra class="reference internal" href="#tuli

node/t/tr,daem>h a/t/tr>
SizeP>operty.setNodeValuep/h3>
Setad">">haluelofda pasticular node.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/tliro lirastrong>h a/tatrong> ( " /> Parameters:Sizeclass="field-bod) – a>">haluelto setsond/t">node/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>operty"rps="re class="xra class="reference internal" h internal" h iiv ) §uli"class=lp-strungg>operty to h3StrungP>opertyctable>

operty /h3>
de">opertycield-table>
StrungP>operty /h3>
Bases:d " /> opertyIld-bface /h3> opertyIld-bface < Parameters:P>opertyIld-bfaceclass="field-bodh/p> href="#tuli
nodeDst/t/tr,daem>nodeSrc/t/tr,daem>g>op/t/tr>ame">Parametoptulield-[/tass=",daem>ifNotD iault=False/t/tr>ame">Parametoptulield-]/tass="f
StrungP>operty.copy /h3>
noame">Parametve culimodi#82d >New> s ve culi 3.8.class="fi"verp>Copiesste">haluelholdsbysasg>operty on a>nodtsao anoVher>nodtsonia>issg>operty.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst le>t simple to lirastrong>nodeDst/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – a>">nodtsao copyste">haluelto./tliro lirastrong>nodeSrc/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – a>">nodtsao copyste">haluelpsom./tliro lirastrong>g>op/tatrong> ( " /> operty /h3> operty <.edge.isValid"> Parameters:StrungP>opertyciass="field-bod) – a>">g>operty holdung te">haluelto copy./tliro lirastrong>ifNotD iault/tstrong> (aem>boolean/tem>) – whea>"r ao nceortsd iault-valuated>nodessor>not. D iaults ass.edge.isValid"> isValid(edgtDst/t/tr,daem>edgtSrc/t/tr,daem>g>op/t/tr>ame">Parametoptulield-[/tass=",daem>ifNotD iault=False/t/tr>ame">Parametoptulield-]/tass="f noame">Parametve culimodi#82d >New> s ve culi 3.8.class="fi"verp>Copiesste">haluelholdsbysasg>operty on ansedgt ao anoVher>edgt onia>issg>operty.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst le>t simple to lirastrong>edgtDst/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – a>">nodtsao copyste">haluelto./tliro lirastrong>edgtSrc/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – a>">nodtsao copyste">haluelpsom./tliro lirastrong>g>op/tatrong> (a" /> operty /h3> operty <.edge.isValid"> Parameters:StrungP>opertyciass="field-bod) – a>">g>operty holdung te">haluelto copy./tliro lirastrong>ifNotD iault/tstrong> (aem>boolean/tem>) – whea>"r ao nceortsd iault-valuated>nodessor>not. D iaults ass.edge.isValid"> isValid(g>op/t/tr> noame">Parametve culimodi#82d >New> s ve culi 3.8.class="fi"verp>Copiesste">halueslholdsbysasg>operty on a>issg>operty.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>g>op/tatrong> (a" /> operty /h3> operty <.edge.isValid"> Parameters:StrungP>opertyciass="field-bod) – a>">g>operty to copy"re class="xra class="reference internal" href="#tuli

StrungP>operty.getEdgtD iaultValuep/h3>
ccaph.ad">">d iault>haluele> ociated>/od/t">edgts.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prstrung"re class="xra class="reference internal" href="#tuli

edgt/t/tr>
StrungP>operty.getEdgtValuep/h3>
ccaph.ad">">haluele> ociated>/oda pasticular edgt.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/te class="xrmaintain the subevensph relation between graphs.) – if prstrung"re class="xrmaintain the sub-graph relation between graphs.) – if pranlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertyfii class="xra class="reference internal" href="#tuli

StrungP>operty.getNodeD iaultValuep>node">
StrungP>operty.getNodeD iaultValuep/h3>
ccaph.ad">">d iault>haluele> ociated>/od/t">nodes.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prstrung"re class="xra class="reference internal" href="#tuli

node/t/tr>
StrungP>operty.getNodeValuep/h3>
ccaph.ad">">haluele> ociated>/oda pasticular node.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/te class="xrmaintain the subevensph relation between graphs.) – if prstrung"re class="xrmaintain the sub-graph relation between graphs.) – if pranlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>operty"re class="xra class="reference internal" href="#tuli

StrungP>operty.setAllEdgtValuep>node">h a/t/tr>
StrungP>operty.setAllEdgtValuep/h3>
Setad">">scla>haluelond">">wholebsetsofdedgts.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>h a/tatrong> ( em>strung"rem>) – a>">haluelto setsond/t">edgts.e e class="xra class="reference internal" href="#tuli

h a/t/tr>
StrungP>operty.setAllNodeValuep/h3>
Setad">">scla>haluelond">">wholebsetsofdnodes.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>h a/tatrong> ( em>strung"rem>) – a>">haluelto setsond/t">nodes.e e class="xra class="reference internal" href="#tuli

edgt/t/tr,daem>h a/t/tr>
StrungP>operty.setEdgtValuep/h3>
Setad">">haluelofda pasticular edgt.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/tliro lirastrong>h a/tatrong> ( em>strung"rem>) – a>">haluelto setsond/t">edgt/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertyfips="re class="xra class="reference internal" href="#tuli

node/t/tr,daem>h a/t/tr>
StrungP>operty.setNodeValuep/h3>
Setad">">haluelofda pasticular node.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/tliro lirastrong>h a/tatrong> ( em>strung"rem>) – a>">haluelto setsond/t">node/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>operty"rps="re class="xra class="reference internal" h internal" h iiv ) §uli"class=lp-booleanvectorg>operty to h3BooleanVectorP>opertyctable>

operty /h3>
de">opertycield-table>
BooleanVectorP>operty /h3>
Bases:d " /> opertyIld-bface /h3> opertyIld-bface < Parameters:P>opertyIld-bfaceclass="field-bodh/p> href="#tuli
nodeDst/t/tr,daem>nodeSrc/t/tr,daem>g>op/t/tr>ame">Parametoptulield-[/tass=",daem>ifNotD iault=False/t/tr>ame">Parametoptulield-]/tass="f
BooleanVectorP>operty.copy /h3>
noame">Parametve culimodi#82d >New> s ve culi 3.8.class="fi"verp>Copiesste">haluelholdsbysasg>operty on a>nodtsao anoVher>nodtsonia>issg>operty.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst le>t simple to lirastrong>nodeDst/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – a>">nodtsao copyste">haluelto./tliro lirastrong>nodeSrc/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – a>">nodtsao copyste">haluelpsom./tliro lirastrong>g>op/tatrong> (a" /> operty /h3> operty <.edge.isValid"> Parameters:BooleanVectorP>opertyciass="field-bod) – a>">g>operty holdung te">haluelto copy./tliro lirastrong>ifNotD iault/tstrong> (aem>boolean/tem>) – whea>"r ao nceortsd iault-valuated>nodessor>not. D iaults ass.edge.isValid"> isValid(edgtDst/t/tr,daem>edgtSrc/t/tr,daem>g>op/t/tr>ame">Parametoptulield-[/tass=",daem>ifNotD iault=False/t/tr>ame">Parametoptulield-]/tass="f noame">Parametve culimodi#82d >New> s ve culi 3.8.class="fi"verp>Copiesste">haluelholdsbysasg>operty on ansedgt ao anoVher>edgt onia>issg>operty.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst le>t simple to lirastrong>edgtDst/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – a>">nodtsao copyste">haluelto./tliro lirastrong>edgtSrc/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – a>">nodtsao copyste">haluelpsom./tliro lirastrong>g>op/tatrong> (a" /> operty /h3> operty <.edge.isValid"> Parameters:BooleanVectorP>opertyciass="field-bod) – a>">g>operty holdung te">haluelto copy./tliro lirastrong>ifNotD iault/tstrong> (aem>boolean/tem>) – whea>"r ao nceortsd iault-valuated>nodessor>not. D iaults ass.edge.isValid"> isValid(g>op/t/tr> noame">Parametve culimodi#82d >New> s ve culi 3.8.class="fi"verp>Copiesste">halueslholdsbysasg>operty on a>issg>operty.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>g>op/tatrong> (a" /> operty /h3> operty <.edge.isValid"> Parameters:BooleanVectorP>opertyciass="field-bod) – a>">g>operty to copy"re class="xra class="reference internal" href="#tuli

BooleanVectorP>operty.getEdgtD iaultValuep/h3>
ccaph.ad">">d iault> 3.7lofdhaluesla> ociated>/od/t">edgts.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if pr 3.7lofdboolean/te class="xra class="reference internal" href="#tuli

edgt/t/tr>
BooleanVectorP>operty.getEdgtValuep/h3>
ccaph.ad">"> 3.7lofdhaluesla> ociated>/oda pasticular edgt.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/te class="xrmaintain the subevensph relation between graphs.) – if pr 3.7lofdboolean/te class="xrmaintain the sub-graph relation between graphs.) – if pranlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertyfii class="xra class="reference internal" href="#tuli

BooleanVectorP>operty.getNodeD iaultValuep>node">
BooleanVectorP>operty.getNodeD iaultValuep/h3>
ccaph.ad">">d iault> 3.7lofdhaluesla> ociated>/od/t">nodes.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if pr 3.7lofdboolean/te class="xra class="reference internal" href="#tuli

node/t/tr>
BooleanVectorP>operty.getNodeValuep/h3>
ccaph.ad">"> 3.7lofdhaluesla> ociated>/oda pasticular node.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/te class="xrmaintain the subevensph relation between graphs.) – if pr 3.7lofdboolean/te class="xrmaintain the sub-graph relation between graphs.) – if pranlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>operty"re class="xra class="reference internal" href="#tuli

BooleanVectorP>operty.setAllEdgtValuep>node">h a/t/tr>
BooleanVectorP>operty.setAllEdgtValuep/h3>
Setad">">scla> 3.7lofdhalueslond">">wholebsetsofdedgts.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>h a/tatrong> ( em> 3.7lofdboolean/tem>) – a>"> 3.7lofdhalueslto setsond/t">edgts"re class="xra class="reference internal" href="#tuli

BooleanVectorP>operty.setAllNodeValuep>node">h a/t/tr>
BooleanVectorP>operty.setAllNodeValuep/h3>
Setad">">scla> 3.7lofdhalueslond">">wholebsetsofdnodes.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>h a/tatrong> ( em> 3.7lofdboolean/tem>) – a>"> 3.7lofdhalueslto setsond/t">nodes/te class="xra class="reference internal" href="#tuli

BooleanVectorP>operty.setEdgtValuep>node">edgt/t/tr,daem>h a/t/tr>
BooleanVectorP>operty.setEdgtValuep/h3>
Setad">"> 3.7lofdhalueslofda pasticular edgt.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/tliro lirastrong>h a/tatrong> ( em> 3.7lofdboolean/tem>) – a>"> 3.7lofdhalueslto setsond/t">edgt/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertyfips="re class="xra class="reference internal" href="#tuli

node/t/tr,daem>h a/t/tr>
BooleanVectorP>operty.setNodeValuep/h3>
Setad">"> 3.7lofdhalueslofda pasticular node.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/tliro lirastrong>h a/tatrong> ( em> 3.7lofdboolean/tem>) – a>"> 3.7lofdhalueslto setsond/t">node/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>operty"rps="re class="xra class="reference internal" href="#tuli

node/t/tr,daem>index/t/tr>
BooleanVectorP>operty.getNodeEltValuep/h3>
ccaph.ad">">haluelin a>"> 3.7lattachera/oda pasticular nodelats">">givensindex.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/tliro lirastrong>index/tatrong> ( em>eld-ger/tem>) – a>">indexlin a>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst">boolean/tps="re class="xrmaintain the sub-graph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>opertysor>ifsa>"> 3.7lattachera/oda>">nodtshasda sizebsassl"r ahans">">givensindex.e "verre class="xra class="reference internal" href="#tuli

node/t/tr,daem>index/t/tr,daem>h a/t/tr>
BooleanVectorP>operty.setNodeEltValuep/h3>
Setad">">haluelin a>"> 3.7lattachera/oda pasticular nodelats">">givensindex.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/tliro lirastrong>index/tatrong> ( em>eld-ger/tem>) – a>">indexlin a>"> 3.7/tliro lirastrong>h a/tatrong> ( em>boolean/tem>) – a>">haluelto setsin a>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>opertysor>ifsa>"> 3.7lattachera/oda>">nodtshasda sizebsassl"r ahans">">givensindex.e "verre class="xra class="reference internal" href="#tuli

node/t/tr,daem>h a/t/tr>
BooleanVectorP>operty.pushBackNodeEltValuep/h3>
Insertsda haluelets">">endlofda>"> 3.7lattachera/oda pasticular node. T>">sizebofda>"> 3.7l by one.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/tliro lirastrong>h a/tatrong> ( em>boolean/tem>) – a>">haluelto agrain a>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>opertye "verre class="xra class="reference internal" href="#tuli

node/t/tr>
BooleanVectorP>operty.popBackNodeEltValuep/h3>
ccmovesste">haluelets">">endlofda>"> 3.7l(if>not>empty)lattachera/oda pasticular node. T>">sizebofda>"> 3.7l by one.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/te class="xrmaintain the subevensph relation between graphs.) – if pranlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>operty"re class="xra class="reference internal" href="#tuli

BooleanVectorP>operty.resizeNodeValuep>node">node/t/tr,daem>sizecl/tr>
BooleanVectorP>operty.resizeNodeValuep/h3>
ccsizesda>"> 3.7lattachera/oda pasticular node. A>d iault>haluelwill>bela> nceera/odnew elementsl(if>any).e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/tliro lirastrong>sizeclatrong> ( em>eld-ger/tem>) – a>">new sizebofda>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>opertye "verre class="xra class="reference internal" href="#tuli

node">node/t/tr,daem>sizecl/tr,daem>h a/t/tr> ccsizesda>"> 3.7lattachera/oda pasticular node. Te">haluelgivensin pasama"filwill>bela> nceera/odnew elementsl(if>any).e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/tliro lirastrong>sizeclatrong> ( em>eld-ger/tem>) – a>">new sizebofda>"> 3.7/tliro lirastrong>h a/tatrong> ( em>boolean/tem>) – a>">haluelto a> ncesondnew elementslin a>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>opertye "verre class="xra class="reference internal" href="#tuli

edgt/t/tr,daem>index/t/tr>
BooleanVectorP>operty.getEdgtEltValuep/h3>
ccaph.ad">">haluelin a>"> 3.7lattachera/oda pasticular edgtsats">">givensindex.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/tliro lirastrong>index/tatrong> ( em>eld-ger/tem>) – a>">indexlin a>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst">boolean/tps="re class="xrmaintain the sub-graph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertysor>ifsa>"> 3.7lattachera/oda>">edgtshasda sizebsassl"r ahans">">givensindex.e "verre class="xra class="reference internal" href="#tuli

edgt/t/tr,daem>index/t/tr,daem>h a/t/tr>
BooleanVectorP>operty.setEdgtEltValuep/h3>
Setad">">haluelin a>"> 3.7lattachera/oda pasticular edgtsats">">givensindex.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/tliro lirastrong>index/tatrong> ( em>eld-ger/tem>) – a>">indexlin a>"> 3.7/tliro lirastrong>h a/tatrong> ( em>boolean/tem>) – a>">haluelto setsin a>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertysor>ifsa>"> 3.7lattachera/oda>">edgtshasda sizebsassl"r ahans">">givensindex.e "verre class="xra class="reference internal" href="#tuli

BooleanVectorP>operty.pushBackEdgtEltValuep>node">edgt/t/tr,daem>h a/t/tr>
BooleanVectorP>operty.pushBackEdgtEltValuep/h3>
Insertsda haluelets">">endlofda>"> 3.7lattachera/oda pasticular edgt. T>">sizebofda>"> 3.7l by one.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/tliro lirastrong>h a/tatrong> ( em>boolean/tem>) – a>">haluelto agrain a>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertyfips="re class="xra class="reference internal" href="#tuli

edgt/t/tr>
BooleanVectorP>operty.popBackEdgtEltValuep/h3>
ccmovesste">haluelets">">endlofda>"> 3.7l(if>not>empty)lattachera/oda pasticular edgt. T>">sizebofda>"> 3.7l by one.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/te class="xrmaintain the subevensph relation between graphs.) – if pranlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertyfii class="xra class="reference internal" href="#tuli

BooleanVectorP>operty.resizeEdgtValuep>node">edgt/t/tr,daem>sizecl/tr>
BooleanVectorP>operty.resizeEdgtValuep/h3>
ccsizesda>"> 3.7lattachera/oda pasticular edgt. A>d iault>haluelwill>bela> nceera/odnew elementsl(if>any).e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/tliro lirastrong>sizeclatrong> ( em>eld-ger/tem>) – a>">new sizebofda>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertyfips="re class="xra class="reference internal" href="#tuli

node">edgt/t/tr,daem>sizecl/tr,daem>h a/t/tr> ccsizesda>"> 3.7lattachera/oda pasticular edgt. T>">haluelgivensin pasama"filwill>bela> nceera/odnew elementsl(if>any).e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/tliro lirastrong>sizeclatrong> ( em>eld-ger/tem>) – a>">new sizebofda>"> 3.7/tliro lirastrong>h a/tatrong> ( em>boolean/tem>) – a>">haluelto a> ncesondnew elementslin a>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>operty"rps="re class="xra class="reference internal" h internal" h iiv ) §uli"class=lp-coordvectorg>operty to h3CoordVectorP>opertyctable>

operty /h3>
de">opertycield-table>
CoordVectorP>operty /h3>
Bases:d " /> opertyIld-bface /h3> opertyIld-bface < Parameters:P>opertyIld-bfaceclass="field-bodh/p> href="#tuli
nodeDst/t/tr,daem>nodeSrc/t/tr,daem>g>op/t/tr>ame">Parametoptulield-[/tass=",daem>ifNotD iault=False/t/tr>ame">Parametoptulield-]/tass="f
CoordVectorP>operty.copy /h3>
noame">Parametve culimodi#82d >New> s ve culi 3.8.class="fi"verp>Copiesste">haluelholdsbysasg>operty on a>nodtsao anoVher>nodtsonia>issg>operty.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst le>t simple to lirastrong>nodeDst/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – a>">nodtsao copyste">haluelto./tliro lirastrong>nodeSrc/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – a>">nodtsao copyste">haluelpsom./tliro lirastrong>g>op/tatrong> (a" /> operty /h3> operty <.edge.isValid"> Parameters:CoordVectorP>opertyciass="field-bod) – a>">g>operty holdung te">haluelto copy./tliro lirastrong>ifNotD iault/tstrong> (aem>boolean/tem>) – whea>"r ao nceortsd iault-valuated>nodessor>not. D iaults ass.edge.isValid"> isValid(edgtDst/t/tr,daem>edgtSrc/t/tr,daem>g>op/t/tr>ame">Parametoptulield-[/tass=",daem>ifNotD iault=False/t/tr>ame">Parametoptulield-]/tass="f noame">Parametve culimodi#82d >New> s ve culi 3.8.class="fi"verp>Copiesste">haluelholdsbysasg>operty on ansedgt ao anoVher>edgt onia>issg>operty.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst le>t simple to lirastrong>edgtDst/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – a>">nodtsao copyste">haluelto./tliro lirastrong>edgtSrc/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – a>">nodtsao copyste">haluelpsom./tliro lirastrong>g>op/tatrong> (a" /> operty /h3> operty <.edge.isValid"> Parameters:CoordVectorP>opertyciass="field-bod) – a>">g>operty holdung te">haluelto copy./tliro lirastrong>ifNotD iault/tstrong> (aem>boolean/tem>) – whea>"r ao nceortsd iault-valuated>nodessor>not. D iaults ass.edge.isValid"> isValid(g>op/t/tr> noame">Parametve culimodi#82d >New> s ve culi 3.8.class="fi"verp>Copiesste">halueslholdsbysasg>operty on a>issg>operty.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>g>op/tatrong> (a" /> operty /h3> operty <.edge.isValid"> Parameters:CoordVectorP>opertyciass="field-bod) – a>">g>operty to copy"re class="xra class="reference internal" href="#tuli

CoordVectorP>operty.getEdgtD iaultValuep/h3>
ccaph.ad">">d iault> 3.7lofdhaluesla> ociated>/od/t">edgts.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if pr 3.7lofda" /> Parameters:Coordclass="field-bodh/e class="xra class="reference internal" href="#tuli

edgt/t/tr>
CoordVectorP>operty.getEdgtValuep/h3>
ccaph.ad">"> 3.7lofdhaluesla> ociated>/oda pasticular edgt.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/te class="xrmaintain the subevensph relation between graphs.) – if pr 3.7lofda" /> Parameters:Coordclass="field-bodh/e class="xrmaintain the sub-graph relation between graphs.) – if pranlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertyfii class="xra class="reference internal" href="#tuli

CoordVectorP>operty.getNodeD iaultValuep>node">
CoordVectorP>operty.getNodeD iaultValuep/h3>
ccaph.ad">">d iault> 3.7lofdhaluesla> ociated>/od/t">nodes.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if pr 3.7lofda" /> Parameters:Coordclass="field-bodh/e class="xra class="reference internal" href="#tuli

node/t/tr>
CoordVectorP>operty.getNodeValuep/h3>
ccaph.ad">"> 3.7lofdhaluesla> ociated>/oda pasticular node.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/te class="xrmaintain the subevensph relation between graphs.) – if pr 3.7lofda" /> Parameters:Coordclass="field-bodh/e class="xrmaintain the sub-graph relation between graphs.) – if pranlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>operty"re class="xra class="reference internal" href="#tuli

CoordVectorP>operty.setAllEdgtValuep>node">h a/t/tr>
CoordVectorP>operty.setAllEdgtValuep/h3>
Setad">">scla> 3.7lofdhalueslond">">wholebsetsofdedgts.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>h a/tatrong> ( 3.7lofda" /> Parameters:Coordclass="field-bod) – a>"> 3.7lofdhalueslto setsond/t">edgts"re class="xra class="reference internal" href="#tuli

CoordVectorP>operty.setAllNodeValuep>node">h a/t/tr>
CoordVectorP>operty.setAllNodeValuep/h3>
Setad">">scla> 3.7lofdhalueslond">">wholebsetsofdnodes.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>h a/tatrong> ( 3.7lofda" /> Parameters:Coordclass="field-bod) – a>"> 3.7lofdhalueslto setsond/t">nodes/te class="xra class="reference internal" href="#tuli

CoordVectorP>operty.setEdgtValuep>node">edgt/t/tr,daem>h a/t/tr>
CoordVectorP>operty.setEdgtValuep/h3>
Setad">"> 3.7lofdhalueslofda pasticular edgt.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/tliro lirastrong>h a/tatrong> ( 3.7lofda" /> Parameters:Coordclass="field-bod) – a>"> 3.7lofdhalueslto setsond/t">edgt/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertyfips="re class="xra class="reference internal" href="#tuli

CoordVectorP>operty.setNodeValuep>node">node/t/tr,daem>h a/t/tr>
CoordVectorP>operty.setNodeValuep/h3>
Setad">"> 3.7lofdhalueslofda pasticular node.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/tliro lirastrong>h a/tatrong> ( 3.7lofda" /> Parameters:Coordclass="field-bod) – a>"> 3.7lofdhalueslto setsond/t">node/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>operty"rps="re class="xra class="reference internal" href="#tuli

node/t/tr,daem>index/t/tr>
CoordVectorP>operty.getNodeEltValuep/h3>
ccaph.ad">">haluelin a>"> 3.7lattachera/oda pasticular nodelats">">givensindex.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/tliro lirastrong>index/tatrong> ( em>eld-ger/tem>) – a>">indexlin a>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst">a" /> Parameters:Coordclass="field-bod/tps="re class="xrmaintain the sub-graph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>opertysor>ifsa>"> 3.7lattachera/oda>">nodtshasda sizebsassl"r ahans">">givensindex.e "verre class="xra class="reference internal" href="#tuli

node/t/tr,daem>index/t/tr,daem>h a/t/tr>
CoordVectorP>operty.setNodeEltValuep/h3>
Setad">">haluelin a>"> 3.7lattachera/oda pasticular nodelats">">givensindex.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/tliro lirastrong>index/tatrong> ( em>eld-ger/tem>) – a>">indexlin a>"> 3.7/tliro lirastrong>h a/tatrong> ( " /> Parameters:Coordclass="field-bod) – a>">haluelto setsin a>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>opertysor>ifsa>"> 3.7lattachera/oda>">nodtshasda sizebsassl"r ahans">">givensindex.e "verre class="xra class="reference internal" href="#tuli

node/t/tr,daem>h a/t/tr>
CoordVectorP>operty.pushBackNodeEltValuep/h3>
Insertsda haluelets">">endlofda>"> 3.7lattachera/oda pasticular node. T>">sizebofda>"> 3.7l by one.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/tliro lirastrong>h a/tatrong> ( " /> Parameters:Coordclass="field-bod) – a>">haluelto agrain a>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>operty"rps="re class="xra class="reference internal" href="#tuli

node/t/tr>
CoordVectorP>operty.popBackNodeEltValuep/h3>
ccmovesste">haluelets">">endlofda>"> 3.7l(if>not>empty)lattachera/oda pasticular node. T>">sizebofda>"> 3.7l by one.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/te class="xrmaintain the subevensph relation between graphs.) – if pranlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>operty"re class="xra class="reference internal" href="#tuli

CoordVectorP>operty.resizeNodeValuep>node">node/t/tr,daem>sizecl/tr>
CoordVectorP>operty.resizeNodeValuep/h3>
ccsizesda>"> 3.7lattachera/oda pasticular node. A>d iault>haluelwill>bela> nceera/odnew elementsl(if>any).e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/tliro lirastrong>sizeclatrong> ( em>eld-ger/tem>) – a>">new sizebofda>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>operty"rps="re class="xra class="reference internal" href="#tuli

node">node/t/tr,daem>sizecl/tr,daem>h a/t/tr> ccsizesda>"> 3.7lattachera/oda pasticular node. Te">haluelgivensin pasama"filwill>bela> nceera/odnew elementsl(if>any).e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/tliro lirastrong>sizeclatrong> ( em>eld-ger/tem>) – a>">new sizebofda>"> 3.7/tliro lirastrong>h a/tatrong> ( " /> Parameters:Coordclass="field-bod) – a>">haluelto a> ncesondnew elementslin a>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>operty"rps="re class="xra class="reference internal" href="#tuli

edgt/t/tr,daem>index/t/tr>
CoordVectorP>operty.getEdgtEltValuep/h3>
ccaph.ad">">haluelin a>"> 3.7lattachera/oda pasticular edgtsats">">givensindex.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/tliro lirastrong>index/tatrong> ( em>eld-ger/tem>) – a>">indexlin a>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst">a" /> Parameters:Coordclass="field-bod/tps="re class="xrmaintain the sub-graph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertysor>ifsa>"> 3.7lattachera/oda>">edgtshasda sizebsassl"r ahans">">givensindex.e "verre class="xra class="reference internal" href="#tuli

CoordVectorP>operty.setEdgtEltValuep>node">edgt/t/tr,daem>index/t/tr,daem>h a/t/tr>
CoordVectorP>operty.setEdgtEltValuep/h3>
Setad">">haluelin a>"> 3.7lattachera/oda pasticular edgtsats">">givensindex.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/tliro lirastrong>index/tatrong> ( em>eld-ger/tem>) – a>">indexlin a>"> 3.7/tliro lirastrong>h a/tatrong> ( " /> Parameters:Coordclass="field-bod) – a>">haluelto setsin a>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertysor>ifsa>"> 3.7lattachera/oda>">edgtshasda sizebsassl"r ahans">">givensindex.e "verre class="xra class="reference internal" href="#tuli

CoordVectorP>operty.pushBackEdgtEltValuep>node">edgt/t/tr,daem>h a/t/tr>
CoordVectorP>operty.pushBackEdgtEltValuep/h3>
Insertsda haluelets">">endlofda>"> 3.7lattachera/oda pasticular edgt. T>">sizebofda>"> 3.7l by one.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/tliro lirastrong>h a/tatrong> ( " /> Parameters:Coordclass="field-bod) – a>">haluelto agrain a>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertyfips="re class="xra class="reference internal" href="#tuli

CoordVectorP>operty.popBackEdgtEltValuep>node">edgt/t/tr>
CoordVectorP>operty.popBackEdgtEltValuep/h3>
ccmovesste">haluelets">">endlofda>"> 3.7l(if>not>empty)lattachera/oda pasticular edgt. T>">sizebofda>"> 3.7l by one.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/te class="xrmaintain the subevensph relation between graphs.) – if pranlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertyfii class="xra class="reference internal" href="#tuli

CoordVectorP>operty.resizeEdgtValuep>node">edgt/t/tr,daem>sizecl/tr>
CoordVectorP>operty.resizeEdgtValuep/h3>
ccsizesda>"> 3.7lattachera/oda pasticular edgt. A>d iault>haluelwill>bela> nceera/odnew elementsl(if>any).e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/tliro lirastrong>sizeclatrong> ( em>eld-ger/tem>) – a>">new sizebofda>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertyfips="re class="xra class="reference internal" href="#tuli

node">edgt/t/tr,daem>sizecl/tr,daem>h a/t/tr> ccsizesda>"> 3.7lattachera/oda pasticular edgt. T>">haluelgivensin pasama"filwill>bela> nceera/odnew elementsl(if>any).e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/tliro lirastrong>sizeclatrong> ( em>eld-ger/tem>) – a>">new sizebofda>"> 3.7/tliro lirastrong>h a/tatrong> ( " /> Parameters:Coordclass="field-bod) – a>">haluelto a> ncesondnew elementslin a>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>operty"rps="re class="xra class="reference internal" h internal" h iiv ) §uli"class=lp-colorvectorg>operty to h3ColorVectorP>opertyctable>

operty /h3>
de">opertycield-table>
ColorVectorP>operty /h3>
Bases:d " /> opertyIld-bface /h3> opertyIld-bface < Parameters:P>opertyIld-bfaceclass="field-bod/tps="ref="#tuli
ColorVectorP>operty.copy >node">nodeDst/t/tr,daem>nodeSrc/t/tr,daem>g>op/t/tr>ame">Parametoptulield-[/tass=",daem>ifNotD iault=False/t/tr>ame">Parametoptulield-]/tass="f
ColorVectorP>operty.copy /h3>
noame">Parametve culimodi#82d >New> s ve culi 3.8.class="fi"verp>Copiesste">haluelholdsbysasg>operty on a>nodtsao anoVher>nodtsonia>issg>operty.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst le>t simple to lirastrong>nodeDst/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – a>">nodtsao copyste">haluelto./tliro lirastrong>nodeSrc/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – a>">nodtsao copyste">haluelpsom./tliro lirastrong>g>op/tatrong> ( " /> operty /h3> operty <.edge.isValid"> Parameters:ColorVectorP>opertyciass="field-bod) – a>">g>operty holdung te">haluelto copy./tliro lirastrong>ifNotD iault/tstrong> (aem>boolean/tem>) – whea>"r ao nceortsd iault-valuated>nodessor>not. D iaults ass.edge.isValid"> isValid(edgtDst/t/tr,daem>edgtSrc/t/tr,daem>g>op/t/tr>ame">Parametoptulield-[/tass=",daem>ifNotD iault=False/t/tr>ame">Parametoptulield-]/tass="f noame">Parametve culimodi#82d >New> s ve culi 3.8.class="fi"verp>Copiesste">haluelholdsbysasg>operty on ansedgt ao anoVher>edgt onia>issg>operty.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst le>t simple to lirastrong>edgtDst/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – a>">nodtsao copyste">haluelto./tliro lirastrong>edgtSrc/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – a>">nodtsao copyste">haluelpsom./tliro lirastrong>g>op/tatrong> ( " /> operty /h3> operty <.edge.isValid"> Parameters:ColorVectorP>opertyciass="field-bod) – a>">g>operty holdung te">haluelto copy./tliro lirastrong>ifNotD iault/tstrong> (aem>boolean/tem>) – whea>"r ao nceortsd iault-valuated>nodessor>not. D iaults ass.edge.isValid"> isValid(g>op/t/tr> noame">Parametve culimodi#82d >New> s ve culi 3.8.class="fi"verp>Copiesste">halueslholdsbysasg>operty on a>issg>operty.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>g>op/tatrong> ( " /> operty /h3> operty <.edge.isValid"> Parameters:ColorVectorP>opertyciass="field-bod) – a>">g>operty to copy"re class="xra class="reference internal" href="#tuli

ColorVectorP>operty.getEdgtD iaultValuep/h3>
ccaph.ad">">d iault> 3.7lofdhaluesla> ociated>/od/t">edgts.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if pr 3.7lofda" /> Parameters:Colorclass="field-bodh/e class="xra class="reference internal" href="#tuli

edgt/t/tr>
ColorVectorP>operty.getEdgtValuep/h3>
ccaph.ad">"> 3.7lofdhaluesla> ociated>/oda pasticular edgt.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/te class="xrmaintain the subevensph relation between graphs.) – if pr 3.7lofda" /> Parameters:Colorclass="field-bodh/e class="xrmaintain the sub-graph relation between graphs.) – if pranlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertyfii class="xra class="reference internal" href="#tuli

ColorVectorP>operty.getNodeD iaultValuep>node">
ColorVectorP>operty.getNodeD iaultValuep/h3>
ccaph.ad">">d iault> 3.7lofdhaluesla> ociated>/od/t">nodes.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if pr 3.7lofda" /> Parameters:Colorclass="field-bodh/e class="xra class="reference internal" href="#tuli

node/t/tr>
ColorVectorP>operty.getNodeValuep/h3>
ccaph.ad">"> 3.7lofdhaluesla> ociated>/oda pasticular node.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/te class="xrmaintain the subevensph relation between graphs.) – if pr 3.7lofda" /> Parameters:Colorclass="field-bodh/e class="xrmaintain the sub-graph relation between graphs.) – if pranlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>operty"re class="xra class="reference internal" href="#tuli

ColorVectorP>operty.setAllEdgtValuep>node">h a/t/tr>
ColorVectorP>operty.setAllEdgtValuep/h3>
Setad">">scla> 3.7lofdhalueslond">">wholebsetsofdedgts.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>h a/tatrong> ( 3.7lofda" /> Parameters:Colorclass="field-bod) – a>"> 3.7lofdhalueslto setsond/t">edgts"re class="xra class="reference internal" href="#tuli

ColorVectorP>operty.setAllNodeValuep>node">h a/t/tr>
ColorVectorP>operty.setAllNodeValuep/h3>
Setad">">scla> 3.7lofdhalueslond">">wholebsetsofdnodes.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>h a/tatrong> ( 3.7lofda" /> Parameters:Colorclass="field-bod) – a>"> 3.7lofdhalueslto setsond/t">nodes/te class="xra class="reference internal" href="#tuli

ColorVectorP>operty.setEdgtValuep>node">edgt/t/tr,daem>h a/t/tr>
ColorVectorP>operty.setEdgtValuep/h3>
Setad">"> 3.7lofdhalueslofda pasticular edgt.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/tliro lirastrong>h a/tatrong> ( 3.7lofda" /> Parameters:Colorclass="field-bod) – a>"> 3.7lofdhalueslto setsond/t">edgt/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertyfips="re class="xra class="reference internal" href="#tuli

ColorVectorP>operty.setNodeValuep>node">node/t/tr,daem>h a/t/tr>
ColorVectorP>operty.setNodeValuep/h3>
Setad">"> 3.7lofdhalueslofda pasticular node.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/tliro lirastrong>h a/tatrong> ( 3.7lofda" /> Parameters:Colorclass="field-bod) – a>"> 3.7lofdhalueslto setsond/t">node/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>operty"rps="re class="xra class="reference internal" href="#tuli

node/t/tr,daem>index/t/tr>
ColorVectorP>operty.getNodeEltValuep/h3>
ccaph.ad">">haluelin a>"> 3.7lattachera/oda pasticular nodelats">">givensindex.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/tliro lirastrong>index/tatrong> ( em>eld-ger/tem>) – a>">indexlin a>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst">a" /> Parameters:Colorclass="field-bodh/ps="re class="xrmaintain the sub-graph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>opertysor>ifsa>"> 3.7lattachera/oda>">nodtshasda sizebsassl"r ahans">">givensindex.e "verre class="xra class="reference internal" href="#tuli

node/t/tr,daem>index/t/tr,daem>h a/t/tr>
ColorVectorP>operty.setNodeEltValuep/h3>
Setad">">haluelin a>"> 3.7lattachera/oda pasticular nodelats">">givensindex.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/tliro lirastrong>index/tatrong> ( em>eld-ger/tem>) – a>">indexlin a>"> 3.7/tliro lirastrong>h a/tatrong> ( " /> Parameters:Colorclass="field-bod) – a>">haluelto setsin a>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>opertysor>ifsa>"> 3.7lattachera/oda>">nodtshasda sizebsassl"r ahans">">givensindex.e "verre class="xra class="reference internal" href="#tuli

node/t/tr,daem>h a/t/tr>
ColorVectorP>operty.pushBackNodeEltValuep/h3>
Insertsda haluelets">">endlofda>"> 3.7lattachera/oda pasticular node. T>">sizebofda>"> 3.7l by one.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/tliro lirastrong>h a/tatrong> ( " /> Parameters:Colorclass="field-bod) – a>">haluelto agrain a>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>operty"rps="re class="xra class="reference internal" href="#tuli

node/t/tr>
ColorVectorP>operty.popBackNodeEltValuep/h3>
ccmovesste">haluelets">">endlofda>"> 3.7l(if>not>empty)lattachera/oda pasticular node. T>">sizebofda>"> 3.7l by one.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/te class="xrmaintain the subevensph relation between graphs.) – if pranlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>operty"re class="xra class="reference internal" href="#tuli

ColorVectorP>operty.resizeNodeValuep>node">node/t/tr,daem>sizecl/tr>
ColorVectorP>operty.resizeNodeValuep/h3>
ccsizesda>"> 3.7lattachera/oda pasticular node. A>d iault>haluelwill>bela> nceera/odnew elementsl(if>any).e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/tliro lirastrong>sizeclatrong> ( em>eld-ger/tem>) – a>">new sizebofda>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>operty"rps="re class="xra class="reference internal" href="#tuli

node">node/t/tr,daem>sizecl/tr,daem>h a/t/tr> ccsizesda>"> 3.7lattachera/oda pasticular node. Te">haluelgivensin pasama"filwill>bela> nceera/odnew elementsl(if>any).e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/tliro lirastrong>sizeclatrong> ( em>eld-ger/tem>) – a>">new sizebofda>"> 3.7/tliro lirastrong>h a/tatrong> ( " /> Parameters:Colorclass="field-bod) – a>">haluelto a> ncesondnew elementslin a>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>operty"rps="re class="xra class="reference internal" href="#tuli

edgt/t/tr,daem>index/t/tr>
ColorVectorP>operty.getEdgtEltValuep/h3>
ccaph.ad">">haluelin a>"> 3.7lattachera/oda pasticular edgtsats">">givensindex.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/tliro lirastrong>index/tatrong> ( em>eld-ger/tem>) – a>">indexlin a>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst">a" /> Parameters:Colorclass="field-bodh/ps="re class="xrmaintain the sub-graph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertysor>ifsa>"> 3.7lattachera/oda>">edgtshasda sizebsassl"r ahans">">givensindex.e "verre class="xra class="reference internal" href="#tuli

ColorVectorP>operty.setEdgtEltValuep>node">edgt/t/tr,daem>index/t/tr,daem>h a/t/tr>
ColorVectorP>operty.setEdgtEltValuep/h3>
Setad">">haluelin a>"> 3.7lattachera/oda pasticular edgtsats">">givensindex.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/tliro lirastrong>index/tatrong> ( em>eld-ger/tem>) – a>">indexlin a>"> 3.7/tliro lirastrong>h a/tatrong> ( " /> Parameters:Colorclass="field-bod) – a>">haluelto setsin a>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertysor>ifsa>"> 3.7lattachera/oda>">edgtshasda sizebsassl"r ahans">">givensindex.e "verre class="xra class="reference internal" href="#tuli

ColorVectorP>operty.pushBackEdgtEltValuep>node">edgt/t/tr,daem>h a/t/tr>
ColorVectorP>operty.pushBackEdgtEltValuep/h3>
Insertsda haluelets">">endlofda>"> 3.7lattachera/oda pasticular edgt. T>">sizebofda>"> 3.7l by one.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/tliro lirastrong>h a/tatrong> ( " /> Parameters:Colorclass="field-bod) – a>">haluelto agrain a>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertyfips="re class="xra class="reference internal" href="#tuli

ColorVectorP>operty.popBackEdgtEltValuep>node">edgt/t/tr>
ColorVectorP>operty.popBackEdgtEltValuep/h3>
ccmovesste">haluelets">">endlofda>"> 3.7l(if>not>empty)lattachera/oda pasticular edgt. T>">sizebofda>"> 3.7l by one.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/te class="xrmaintain the subevensph relation between graphs.) – if pranlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertyfii class="xra class="reference internal" href="#tuli

ColorVectorP>operty.resizeEdgtValuep>node">edgt/t/tr,daem>sizecl/tr>
ColorVectorP>operty.resizeEdgtValuep/h3>
ccsizesda>"> 3.7lattachera/oda pasticular edgt. A>d iault>haluelwill>bela> nceera/odnew elementsl(if>any).e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/tliro lirastrong>sizeclatrong> ( em>eld-ger/tem>) – a>">new sizebofda>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertyfips="re class="xra class="reference internal" href="#tuli

node">edgt/t/tr,daem>sizecl/tr,daem>h a/t/tr> ccsizesda>"> 3.7lattachera/oda pasticular edgt. T>">haluelgivensin pasama"filwill>bela> nceera/odnew elementsl(if>any).e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/tliro lirastrong>sizeclatrong> ( em>eld-ger/tem>) – a>">new sizebofda>"> 3.7/tliro lirastrong>h a/tatrong> ( " /> Parameters:Colorclass="field-bod) – a>">haluelto a> ncesondnew elementslin a>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>operty"rps="re class="xra class="reference internal" h internal" h iiv ) §uli"class=lp-douerevectorg>operty to h3DouereVectorP>opertyctable>

operty /h3>
de">opertycield-table>
DouereVectorP>operty /h3>
Bases:d " /> opertyIld-bface /h3> opertyIld-bface < Parameters:P>opertyIld-bfaceclass="field-bodh/ps="ref="#tuli
DouereVectorP>operty.copy >node">nodeDst/t/tr,daem>nodeSrc/t/tr,daem>g>op/t/tr>ame">Parametoptulield-[/tass=",daem>ifNotD iault=False/t/tr>ame">Parametoptulield-]/tass="f
DouereVectorP>operty.copy /h3>
noame">Parametve culimodi#82d >New> s ve culi 3.8.class="fi"verp>Copiesste">haluelholdsbysasg>operty on a>nodtsao anoVher>nodtsonia>issg>operty.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst le>t simple to lirastrong>nodeDst/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – a>">nodtsao copyste">haluelto./tliro lirastrong>nodeSrc/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – a>">nodtsao copyste">haluelpsom./tliro lirastrong>g>op/tatrong> (a" /> operty /h3> operty <.edge.isValid"> Parameters:DouereVectorP>opertyciass="field-bod) – a>">g>operty holdung te">haluelto copy./tliro lirastrong>ifNotD iault/tstrong> (aem>boolean/tem>) – whea>"r ao nceortsd iault-valuated>nodessor>not. D iaults ass.edge.isValid"> isValid(edgtDst/t/tr,daem>edgtSrc/t/tr,daem>g>op/t/tr>ame">Parametoptulield-[/tass=",daem>ifNotD iault=False/t/tr>ame">Parametoptulield-]/tass="f noame">Parametve culimodi#82d >New> s ve culi 3.8.class="fi"verp>Copiesste">haluelholdsbysasg>operty on ansedgt ao anoVher>edgt onia>issg>operty.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst le>t simple to lirastrong>edgtDst/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – a>">nodtsao copyste">haluelto./tliro lirastrong>edgtSrc/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – a>">nodtsao copyste">haluelpsom./tliro lirastrong>g>op/tatrong> (a" /> operty /h3> operty <.edge.isValid"> Parameters:DouereVectorP>opertyciass="field-bod) – a>">g>operty holdung te">haluelto copy./tliro lirastrong>ifNotD iault/tstrong> (aem>boolean/tem>) – whea>"r ao nceortsd iault-valuated>nodessor>not. D iaults ass.edge.isValid"> isValid(g>op/t/tr> noame">Parametve culimodi#82d >New> s ve culi 3.8.class="fi"verp>Copiesste">halueslholdsbysasg>operty on a>issg>operty.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>g>op/tatrong> ( " /> operty /h3> operty <.edge.isValid"> Parameters:DouereVectorP>opertyciass="field-bod) – a>">g>operty to copy"re class="xra class="reference internal" href="#tuli

DouereVectorP>operty.getEdgtD iaultValuep/h3>
ccaph.ad">">d iault> 3.7lofdhaluesla> ociated>/od/t">edgts.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if pr 3.7lofdfloat"re class="xra class="reference internal" href="#tuli

edgt/t/tr>
DouereVectorP>operty.getEdgtValuep/h3>
ccaph.ad">"> 3.7lofdhaluesla> ociated>/oda pasticular edgt.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/te class="xrmaintain the subevensph relation between graphs.) – if pr 3.7lofdfloat"re class="xrmaintain the sub-graph relation between graphs.) – if pranlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertyfii class="xra class="reference internal" href="#tuli

DouereVectorP>operty.getNodeD iaultValuep>node">
DouereVectorP>operty.getNodeD iaultValuep/h3>
ccaph.ad">">d iault> 3.7lofdhaluesla> ociated>/od/t">nodes.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if pr 3.7lofdfloat"re class="xra class="reference internal" href="#tuli

node/t/tr>
DouereVectorP>operty.getNodeValuep/h3>
ccaph.ad">"> 3.7lofdhaluesla> ociated>/oda pasticular node.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/te class="xrmaintain the subevensph relation between graphs.) – if pr 3.7lofdfloat"re class="xrmaintain the sub-graph relation between graphs.) – if pranlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>operty"re class="xra class="reference internal" href="#tuli

DouereVectorP>operty.setAllEdgtValuep>node">h a/t/tr>
DouereVectorP>operty.setAllEdgtValuep/h3>
Setad">">scla> 3.7lofdhalueslond">">wholebsetsofdedgts.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>h a/tatrong> ( /tr 3.7lofdfloat"rem>) – a>"> 3.7lofdhalueslto setsond/t">edgts"re class="xra class="reference internal" href="#tuli

DouereVectorP>operty.setAllNodeValuep>node">h a/t/tr>
DouereVectorP>operty.setAllNodeValuep/h3>
Setad">">scla> 3.7lofdhalueslond">">wholebsetsofdnodes.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>h a/tatrong> ( /tr 3.7lofdfloat"rem>) – a>"> 3.7lofdhalueslto setsond/t">nodes/te class="xra class="reference internal" href="#tuli

DouereVectorP>operty.setEdgtValuep>node">edgt/t/tr,daem>h a/t/tr>
DouereVectorP>operty.setEdgtValuep/h3>
Setad">"> 3.7lofdhalueslofda pasticular edgt.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/tliro lirastrong>h a/tatrong> ( /tr 3.7lofdfloat"rem>) – a>"> 3.7lofdhalueslto setsond/t">edgt/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertyfips="re class="xra class="reference internal" href="#tuli

DouereVectorP>operty.setNodeValuep>node">node/t/tr,daem>h a/t/tr>
DouereVectorP>operty.setNodeValuep/h3>
Setad">"> 3.7lofdhalueslofda pasticular node.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/tliro lirastrong>h a/tatrong> ( /tr 3.7lofdfloat"rem>) – a>"> 3.7lofdhalueslto setsond/t">node/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>operty"rps="re class="xra class="reference internal" href="#tuli

node/t/tr,daem>index/t/tr>
DouereVectorP>operty.getNodeEltValuep/h3>
ccaph.ad">">haluelin a>"> 3.7lattachera/oda pasticular nodelats">">givensindex.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/tliro lirastrong>index/tatrong> ( em>eld-ger/tem>) – a>">indexlin a>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst">float"rps="re class="xrmaintain the sub-graph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>opertysor>ifsa>"> 3.7lattachera/oda>">nodtshasda sizebsassl"r ahans">">givensindex.e "verre class="xra class="reference internal" href="#tuli

node/t/tr,daem>index/t/tr,daem>h a/t/tr>
DouereVectorP>operty.setNodeEltValuep/h3>
Setad">">haluelin a>"> 3.7lattachera/oda pasticular nodelats">">givensindex.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/tliro lirastrong>index/tatrong> ( em>eld-ger/tem>) – a>">indexlin a>"> 3.7/tliro lirastrong>h a/tatrong> ( /trfloat"rem>) – a>">haluelto setsin a>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>opertysor>ifsa>"> 3.7lattachera/oda>">nodtshasda sizebsassl"r ahans">">givensindex.e "verre class="xra class="reference internal" href="#tuli

node/t/tr,daem>h a/t/tr>
DouereVectorP>operty.pushBackNodeEltValuep/h3>
Insertsda haluelets">">endlofda>"> 3.7lattachera/oda pasticular node. T>">sizebofda>"> 3.7l by one.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/tliro lirastrong>h a/tatrong> ( /trfloat"rem>) – a>">haluelto agrain a>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>operty"rps="re class="xra class="reference internal" href="#tuli

node/t/tr>
DouereVectorP>operty.popBackNodeEltValuep/h3>
ccmovesste">haluelets">">endlofda>"> 3.7l(if>not>empty)lattachera/oda pasticular node. T>">sizebofda>"> 3.7l by one.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/te class="xrmaintain the subevensph relation between graphs.) – if pranlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>operty"re class="xra class="reference internal" href="#tuli

DouereVectorP>operty.resizeNodeValuep>node">node/t/tr,daem>sizecl/tr>
DouereVectorP>operty.resizeNodeValuep/h3>
ccsizesda>"> 3.7lattachera/oda pasticular node. A>d iault>haluelwill>bela> nceera/odnew elementsl(if>any).e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/tliro lirastrong>sizeclatrong> ( em>eld-ger/tem>) – a>">new sizebofda>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>operty"rps="re class="xra class="reference internal" href="#tuli

node">node/t/tr,daem>sizecl/tr,daem>h a/t/tr> ccsizesda>"> 3.7lattachera/oda pasticular node. Te">haluelgivensin pasama"filwill>bela> nceera/odnew elementsl(if>any).e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/tliro lirastrong>sizeclatrong> ( em>eld-ger/tem>) – a>">new sizebofda>"> 3.7/tliro lirastrong>h a/tatrong> ( /trfloat"rem>) – a>">haluelto a> ncesondnew elementslin a>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>operty"rps="re class="xra class="reference internal" href="#tuli

edgt/t/tr,daem>index/t/tr>
DouereVectorP>operty.getEdgtEltValuep/h3>
ccaph.ad">">haluelin a>"> 3.7lattachera/oda pasticular edgtsats">">givensindex.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/tliro lirastrong>index/tatrong> ( em>eld-ger/tem>) – a>">indexlin a>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst">float"rps="re class="xrmaintain the sub-graph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertysor>ifsa>"> 3.7lattachera/oda>">edgtshasda sizebsassl"r ahans">">givensindex.e "verre class="xra class="reference internal" href="#tuli

DouereVectorP>operty.setEdgtEltValuep>node">edgt/t/tr,daem>index/t/tr,daem>h a/t/tr>
DouereVectorP>operty.setEdgtEltValuep/h3>
Setad">">haluelin a>"> 3.7lattachera/oda pasticular edgtsats">">givensindex.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/tliro lirastrong>index/tatrong> ( em>eld-ger/tem>) – a>">indexlin a>"> 3.7/tliro lirastrong>h a/tatrong> ( /trfloat"rem>) – a>">haluelto setsin a>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertysor>ifsa>"> 3.7lattachera/oda>">edgtshasda sizebsassl"r ahans">">givensindex.e "verre class="xra class="reference internal" href="#tuli

DouereVectorP>operty.pushBackEdgtEltValuep>node">edgt/t/tr,daem>h a/t/tr>
DouereVectorP>operty.pushBackEdgtEltValuep/h3>
Insertsda haluelets">">endlofda>"> 3.7lattachera/oda pasticular edgt. T>">sizebofda>"> 3.7l by one.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/tliro lirastrong>h a/tatrong> ( /trfloat"rem>) – a>">haluelto agrain a>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertyfips="re class="xra class="reference internal" href="#tuli

DouereVectorP>operty.popBackEdgtEltValuep>node">edgt/t/tr>
DouereVectorP>operty.popBackEdgtEltValuep/h3>
ccmovesste">haluelets">">endlofda>"> 3.7l(if>not>empty)lattachera/oda pasticular edgt. T>">sizebofda>"> 3.7l by one.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/te class="xrmaintain the subevensph relation between graphs.) – if pranlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertyfii class="xra class="reference internal" href="#tuli

DouereVectorP>operty.resizeEdgtValuep>node">edgt/t/tr,daem>sizecl/tr>
DouereVectorP>operty.resizeEdgtValuep/h3>
ccsizesda>"> 3.7lattachera/oda pasticular edgt. A>d iault>haluelwill>bela> nceera/odnew elementsl(if>any).e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/tliro lirastrong>sizeclatrong> ( em>eld-ger/tem>) – a>">new sizebofda>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertyfips="re class="xra class="reference internal" href="#tuli

node">edgt/t/tr,daem>sizecl/tr,daem>h a/t/tr> ccsizesda>"> 3.7lattachera/oda pasticular edgt. T>">haluelgivensin pasama"filwill>bela> nceera/odnew elementsl(if>any).e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/tliro lirastrong>sizeclatrong> ( em>eld-ger/tem>) – a>">new sizebofda>"> 3.7/tliro lirastrong>h a/tatrong> ( /trfloat"rem>) – a>">haluelto a> ncesondnew elementslin a>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>operty"rps="re class="xra class="reference internal" h internal" h iiv ) §uli"class=lp-eld-gervectorg>operty to h3Ild-gerVectorP>opertyctable>

operty /h3>
de">opertycield-table>
Ild-gerVectorP>operty /h3>
Bases:d " /> opertyIld-bface /h3> opertyIld-bface < Parameters:P>opertyIld-bfaceclass="field-bodh/ps="ref="#tuli
Ild-gerVectorP>operty.copy >node">nodeDst/t/tr,daem>nodeSrc/t/tr,daem>g>op/t/tr>ame">Parametoptulield-[/tass=",daem>ifNotD iault=False/t/tr>ame">Parametoptulield-]/tass="f
Ild-gerVectorP>operty.copy /h3>
noame">Parametve culimodi#82d >New> s ve culi 3.8.class="fi"verp>Copiesste">haluelholdsbysasg>operty on a>nodtsao anoVher>nodtsonia>issg>operty.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst le>t simple to lirastrong>nodeDst/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – a>">nodtsao copyste">haluelto./tliro lirastrong>nodeSrc/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – a>">nodtsao copyste">haluelpsom./tliro lirastrong>g>op/tatrong> (a" /> operty /h3> operty <.edge.isValid"> Parameters:Ild-gerVectorP>opertyciass="field-bod) – a>">g>operty holdung te">haluelto copy./tliro lirastrong>ifNotD iault/tstrong> (aem>boolean/tem>) – whea>"r ao nceortsd iault-valuated>nodessor>not. D iaults ass.edge.isValid"> isValid(edgtDst/t/tr,daem>edgtSrc/t/tr,daem>g>op/t/tr>ame">Parametoptulield-[/tass=",daem>ifNotD iault=False/t/tr>ame">Parametoptulield-]/tass="f noame">Parametve culimodi#82d >New> s ve culi 3.8.class="fi"verp>Copiesste">haluelholdsbysasg>operty on ansedgt ao anoVher>edgt onia>issg>operty.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst le>t simple to lirastrong>edgtDst/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – a>">nodtsao copyste">haluelto./tliro lirastrong>edgtSrc/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – a>">nodtsao copyste">haluelpsom./tliro lirastrong>g>op/tatrong> (a" /> operty /h3> operty <.edge.isValid"> Parameters:Ild-gerVectorP>opertyciass="field-bod) – a>">g>operty holdung te">haluelto copy./tliro lirastrong>ifNotD iault/tstrong> (aem>boolean/tem>) – whea>"r ao nceortsd iault-valuated>nodessor>not. D iaults ass.edge.isValid"> isValid(g>op/t/tr> noame">Parametve culimodi#82d >New> s ve culi 3.8.class="fi"verp>Copiesste">halueslholdsbysasg>operty on a>issg>operty.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>g>op/tatrong> (a" /> operty /h3> operty <.edge.isValid"> Parameters:Ild-gerVectorP>opertyciass="field-bod) – a>">g>operty to copy"re class="xra class="reference internal" href="#tuli

Ild-gerVectorP>operty.getEdgtD iaultValuep/h3>
ccaph.ad">">d iault> 3.7lofdhaluesla> ociated>/od/t">edgts.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if pr 3.7lofdeld-ger/te class="xra class="reference internal" href="#tuli

edgt/t/tr>
Ild-gerVectorP>operty.getEdgtValuep/h3>
ccaph.ad">"> 3.7lofdhaluesla> ociated>/oda pasticular edgt.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/te class="xrmaintain the subevensph relation between graphs.) – if pr 3.7lofdeld-ger/te class="xrmaintain the sub-graph relation between graphs.) – if pranlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertyfii class="xra class="reference internal" href="#tuli

Ild-gerVectorP>operty.getNodeD iaultValuep>node">
Ild-gerVectorP>operty.getNodeD iaultValuep/h3>
ccaph.ad">">d iault> 3.7lofdhaluesla> ociated>/od/t">nodes.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if pr 3.7lofdeld-ger/te class="xra class="reference internal" href="#tuli

node/t/tr>
Ild-gerVectorP>operty.getNodeValuep/h3>
ccaph.ad">"> 3.7lofdhaluesla> ociated>/oda pasticular node.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/te class="xrmaintain the subevensph relation between graphs.) – if pr 3.7lofdeld-ger/te class="xrmaintain the sub-graph relation between graphs.) – if pranlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>operty"re class="xra class="reference internal" href="#tuli

Ild-gerVectorP>operty.setAllEdgtValuep>node">h a/t/tr>
Ild-gerVectorP>operty.setAllEdgtValuep/h3>
Setad">">scla> 3.7lofdhalueslond">">wholebsetsofdedgts.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>h a/tatrong> ( /tr 3.7lofdeld-ger/tem>) – a>"> 3.7lofdhalueslto setsond/t">edgts"re class="xra class="reference internal" href="#tuli

Ild-gerVectorP>operty.setAllNodeValuep>node">h a/t/tr>
Ild-gerVectorP>operty.setAllNodeValuep/h3>
Setad">">scla> 3.7lofdhalueslond">">wholebsetsofdnodes.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>h a/tatrong> ( /tr 3.7lofdeld-ger/tem>) – a>"> 3.7lofdhalueslto setsond/t">nodes/te class="xra class="reference internal" href="#tuli

Ild-gerVectorP>operty.setEdgtValuep>node">edgt/t/tr,daem>h a/t/tr>
Ild-gerVectorP>operty.setEdgtValuep/h3>
Setad">"> 3.7lofdhalueslofda pasticular edgt.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/tliro lirastrong>h a/tatrong> ( /tr 3.7lofdeld-ger/tem>) – a>"> 3.7lofdhalueslto setsond/t">edgt/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertyfips="re class="xra class="reference internal" href="#tuli

Ild-gerVectorP>operty.setNodeValuep>node">node/t/tr,daem>h a/t/tr>
Ild-gerVectorP>operty.setNodeValuep/h3>
Setad">"> 3.7lofdhalueslofda pasticular node.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/tliro lirastrong>h a/tatrong> ( /tr 3.7lofdeld-ger/tem>) – a>"> 3.7lofdhalueslto setsond/t">node/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>operty"rps="re class="xra class="reference internal" href="#tuli

node/t/tr,daem>index/t/tr>
Ild-gerVectorP>operty.getNodeEltValuep/h3>
ccaph.ad">">haluelin a>"> 3.7lattachera/oda pasticular nodelats">">givensindex.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/tliro lirastrong>index/tatrong> ( em>eld-ger/tem>) – a>">indexlin a>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst">eld-ger/tps="re class="xrmaintain the sub-graph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>opertysor>ifsa>"> 3.7lattachera/oda>">nodtshasda sizebsassl"r ahans">">givensindex.e "verre class="xra class="reference internal" href="#tuli

node/t/tr,daem>index/t/tr,daem>h a/t/tr>
Ild-gerVectorP>operty.setNodeEltValuep/h3>
Setad">">haluelin a>"> 3.7lattachera/oda pasticular nodelats">">givensindex.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/tliro lirastrong>index/tatrong> ( em>eld-ger/tem>) – a>">indexlin a>"> 3.7/tliro lirastrong>h a/tatrong> ( /treld-ger/tem>) – a>">haluelto setsin a>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>opertysor>ifsa>"> 3.7lattachera/oda>">nodtshasda sizebsassl"r ahans">">givensindex.e "verre class="xra class="reference internal" href="#tuli

node/t/tr,daem>h a/t/tr>
Ild-gerVectorP>operty.pushBackNodeEltValuep/h3>
Insertsda haluelets">">endlofda>"> 3.7lattachera/oda pasticular node. T>">sizebofda>"> 3.7l by one.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/tliro lirastrong>h a/tatrong> ( /treld-ger/tem>) – a>">haluelto agrain a>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>operty"rps="re class="xra class="reference internal" href="#tuli

node/t/tr>
Ild-gerVectorP>operty.popBackNodeEltValuep/h3>
ccmovesste">haluelets">">endlofda>"> 3.7l(if>not>empty)lattachera/oda pasticular node. T>">sizebofda>"> 3.7l by one.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/te class="xrmaintain the subevensph relation between graphs.) – if pranlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>operty"re class="xra class="reference internal" href="#tuli

Ild-gerVectorP>operty.resizeNodeValuep>node">node/t/tr,daem>sizecl/tr>
Ild-gerVectorP>operty.resizeNodeValuep/h3>
ccsizesda>"> 3.7lattachera/oda pasticular node. A>d iault>haluelwill>bela> nceera/odnew elementsl(if>any).e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/tliro lirastrong>sizeclatrong> ( em>eld-ger/tem>) – a>">new sizebofda>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>operty"rps="re class="xra class="reference internal" href="#tuli

node">node/t/tr,daem>sizecl/tr,daem>h a/t/tr> ccsizesda>"> 3.7lattachera/oda pasticular node. Te">haluelgivensin pasama"filwill>bela> nceera/odnew elementsl(if>any).e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/tliro lirastrong>sizeclatrong> ( em>eld-ger/tem>) – a>">new sizebofda>"> 3.7/tliro lirastrong>h a/tatrong> ( /treld-ger/tem>) – a>">haluelto a> ncesondnew elementslin a>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>operty"rps="re class="xra class="reference internal" href="#tuli

edgt/t/tr,daem>index/t/tr>
Ild-gerVectorP>operty.getEdgtEltValuep/h3>
ccaph.ad">">haluelin a>"> 3.7lattachera/oda pasticular edgtsats">">givensindex.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/tliro lirastrong>index/tatrong> ( em>eld-ger/tem>) – a>">indexlin a>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst">eld-ger/tps="re class="xrmaintain the sub-graph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertysor>ifsa>"> 3.7lattachera/oda>">edgtshasda sizebsassl"r ahans">">givensindex.e "verre class="xra class="reference internal" href="#tuli

Ild-gerVectorP>operty.setEdgtEltValuep>node">edgt/t/tr,daem>index/t/tr,daem>h a/t/tr>
Ild-gerVectorP>operty.setEdgtEltValuep/h3>
Setad">">haluelin a>"> 3.7lattachera/oda pasticular edgtsats">">givensindex.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/tliro lirastrong>index/tatrong> ( em>eld-ger/tem>) – a>">indexlin a>"> 3.7/tliro lirastrong>h a/tatrong> ( /treld-ger/tem>) – a>">haluelto setsin a>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertysor>ifsa>"> 3.7lattachera/oda>">edgtshasda sizebsassl"r ahans">">givensindex.e "verre class="xra class="reference internal" href="#tuli

Ild-gerVectorP>operty.pushBackEdgtEltValuep>node">edgt/t/tr,daem>h a/t/tr>
Ild-gerVectorP>operty.pushBackEdgtEltValuep/h3>
Insertsda haluelets">">endlofda>"> 3.7lattachera/oda pasticular edgt. T>">sizebofda>"> 3.7l by one.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/tliro lirastrong>h a/tatrong> ( /treld-ger/tem>) – a>">haluelto agrain a>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertyfips="re class="xra class="reference internal" href="#tuli

Ild-gerVectorP>operty.popBackEdgtEltValuep>node">edgt/t/tr>
Ild-gerVectorP>operty.popBackEdgtEltValuep/h3>
ccmovesste">haluelets">">endlofda>"> 3.7l(if>not>empty)lattachera/oda pasticular edgt. T>">sizebofda>"> 3.7l by one.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/te class="xrmaintain the subevensph relation between graphs.) – if pranlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertyfii class="xra class="reference internal" href="#tuli

Ild-gerVectorP>operty.resizeEdgtValuep>node">edgt/t/tr,daem>sizecl/tr>
Ild-gerVectorP>operty.resizeEdgtValuep/h3>
ccsizesda>"> 3.7lattachera/oda pasticular edgt. A>d iault>haluelwill>bela> nceera/odnew elementsl(if>any).e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/tliro lirastrong>sizeclatrong> ( em>eld-ger/tem>) – a>">new sizebofda>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertyfips="re class="xra class="reference internal" href="#tuli

node">edgt/t/tr,daem>sizecl/tr,daem>h a/t/tr> ccsizesda>"> 3.7lattachera/oda pasticular edgt. T>">haluelgivensin pasama"filwill>bela> nceera/odnew elementsl(if>any).e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/tliro lirastrong>sizeclatrong> ( em>eld-ger/tem>) – a>">new sizebofda>"> 3.7/tliro lirastrong>h a/tatrong> ( /treld-ger/tem>) – a>">haluelto a> ncesondnew elementslin a>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>operty"rps="re class="xra class="reference internal" h internal" h iiv ) §uli"class=lp-sizevectorg>operty to h3SizeVectorP>opertyctable>

operty /h3>
de">opertycield-table>
SizeVectorP>operty /h3>
Bases:d " /> opertyIld-bface /h3> opertyIld-bface < Parameters:P>opertyIld-bfaceclass="field-bodh/ps="ref="#tuli
SizeVectorP>operty.copy >node">nodeDst/t/tr,daem>nodeSrc/t/tr,daem>g>op/t/tr>ame">Parametoptulield-[/tass=",daem>ifNotD iault=False/t/tr>ame">Parametoptulield-]/tass="f
SizeVectorP>operty.copy /h3>
noame">Parametve culimodi#82d >New> s ve culi 3.8.class="fi"verp>Copiesste">haluelholdsbysasg>operty on a>nodtsao anoVher>nodtsonia>issg>operty.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst le>t simple to lirastrong>nodeDst/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – a>">nodtsao copyste">haluelto./tliro lirastrong>nodeSrc/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – a>">nodtsao copyste">haluelpsom./tliro lirastrong>g>op/tatrong> (a" /> operty /h3> operty <.edge.isValid"> Parameters:SizeVectorP>opertyciass="field-bod) – a>">g>operty holdung te">haluelto copy./tliro lirastrong>ifNotD iault/tstrong> (aem>boolean/tem>) – whea>"r ao nceortsd iault-valuated>nodessor>not. D iaults ass.edge.isValid"> isValid(edgtDst/t/tr,daem>edgtSrc/t/tr,daem>g>op/t/tr>ame">Parametoptulield-[/tass=",daem>ifNotD iault=False/t/tr>ame">Parametoptulield-]/tass="f noame">Parametve culimodi#82d >New> s ve culi 3.8.class="fi"verp>Copiesste">haluelholdsbysasg>operty on ansedgt ao anoVher>edgt onia>issg>operty.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst le>t simple to lirastrong>edgtDst/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – a>">nodtsao copyste">haluelto./tliro lirastrong>edgtSrc/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – a>">nodtsao copyste">haluelpsom./tliro lirastrong>g>op/tatrong> (a" /> operty /h3> operty <.edge.isValid"> Parameters:SizeVectorP>opertyciass="field-bod) – a>">g>operty holdung te">haluelto copy./tliro lirastrong>ifNotD iault/tstrong> (aem>boolean/tem>) – whea>"r ao nceortsd iault-valuated>nodessor>not. D iaults ass.edge.isValid"> isValid(g>op/t/tr> noame">Parametve culimodi#82d >New> s ve culi 3.8.class="fi"verp>Copiesste">halueslholdsbysasg>operty on a>issg>operty.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>g>op/tatrong> (a" /> operty /h3> operty <.edge.isValid"> Parameters:SizeVectorP>opertyciass="field-bod) – a>">g>operty to copy"re class="xra class="reference internal" href="#tuli

SizeVectorP>operty.getEdgtD iaultValuep/h3>
ccaph.ad">">d iault> 3.7lofdhaluesla> ociated>/od/t">edgts.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if pr 3.7lofda" /> Parameters:Sizeclass="field-bodh/e class="xra class="reference internal" href="#tuli

edgt/t/tr>
SizeVectorP>operty.getEdgtValuep/h3>
ccaph.ad">"> 3.7lofdhaluesla> ociated>/oda pasticular edgt.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/te class="xrmaintain the subevensph relation between graphs.) – if pr 3.7lofda" /> Parameters:Sizeclass="field-bodh/e class="xrmaintain the sub-graph relation between graphs.) – if pranlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertyfii class="xra class="reference internal" href="#tuli

SizeVectorP>operty.getNodeD iaultValuep>node">
SizeVectorP>operty.getNodeD iaultValuep/h3>
ccaph.ad">">d iault> 3.7lofdhaluesla> ociated>/od/t">nodes.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if pr 3.7lofda" /> Parameters:Sizeclass="field-bodh/e class="xra class="reference internal" href="#tuli

node/t/tr>
SizeVectorP>operty.getNodeValuep/h3>
ccaph.ad">"> 3.7lofdhaluesla> ociated>/oda pasticular node.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/te class="xrmaintain the subevensph relation between graphs.) – if pr 3.7lofda" /> Parameters:Sizeclass="field-bodh/e class="xrmaintain the sub-graph relation between graphs.) – if pranlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>operty"re class="xra class="reference internal" href="#tuli

SizeVectorP>operty.setAllEdgtValuep>node">h a/t/tr>
SizeVectorP>operty.setAllEdgtValuep/h3>
Setad">">scla> 3.7lofdhalueslond">">wholebsetsofdedgts.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>h a/tatrong> ( 3.7lofda" /> Parameters:Sizeclass="field-bod) – a>"> 3.7lofdhalueslto setsond/t">edgts"re class="xra class="reference internal" href="#tuli

SizeVectorP>operty.setAllNodeValuep>node">h a/t/tr>
SizeVectorP>operty.setAllNodeValuep/h3>
Setad">">scla> 3.7lofdhalueslond">">wholebsetsofdnodes.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>h a/tatrong> ( 3.7lofda" /> Parameters:Sizeclass="field-bod) – a>"> 3.7lofdhalueslto setsond/t">nodes/te class="xra class="reference internal" href="#tuli

SizeVectorP>operty.setEdgtValuep>node">edgt/t/tr,daem>h a/t/tr>
SizeVectorP>operty.setEdgtValuep/h3>
Setad">"> 3.7lofdhalueslofda pasticular edgt.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/tliro lirastrong>h a/tatrong> ( 3.7lofda" /> Parameters:Sizeclass="field-bod) – a>"> 3.7lofdhalueslto setsond/t">edgt/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertyfips="re class="xra class="reference internal" href="#tuli

SizeVectorP>operty.setNodeValuep>node">node/t/tr,daem>h a/t/tr>
SizeVectorP>operty.setNodeValuep/h3>
Setad">"> 3.7lofdhalueslofda pasticular node.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/tliro lirastrong>h a/tatrong> ( 3.7lofda" /> Parameters:Sizeclass="field-bod) – a>"> 3.7lofdhalueslto setsond/t">node/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>operty"rps="re class="xra class="reference internal" href="#tuli

node/t/tr,daem>index/t/tr>
SizeVectorP>operty.getNodeEltValuep/h3>
ccaph.ad">">haluelin a>"> 3.7lattachera/oda pasticular nodelats">">givensindex.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/tliro lirastrong>index/tatrong> ( em>eld-ger/tem>) – a>">indexlin a>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst">a" /> Parameters:Sizeclass="field-bod/tps="re class="xrmaintain the sub-graph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>opertysor>ifsa>"> 3.7lattachera/oda>">nodtshasda sizebsassl"r ahans">">givensindex.e "verre class="xra class="reference internal" href="#tuli

node/t/tr,daem>index/t/tr,daem>h a/t/tr>
SizeVectorP>operty.setNodeEltValuep/h3>
Setad">">haluelin a>"> 3.7lattachera/oda pasticular nodelats">">givensindex.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/tliro lirastrong>index/tatrong> ( em>eld-ger/tem>) – a>">indexlin a>"> 3.7/tliro lirastrong>h a/tatrong> ( " /> Parameters:Sizeclass="field-bod) – a>">haluelto setsin a>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>opertysor>ifsa>"> 3.7lattachera/oda>">nodtshasda sizebsassl"r ahans">">givensindex.e "verre class="xra class="reference internal" href="#tuli

node/t/tr,daem>h a/t/tr>
SizeVectorP>operty.pushBackNodeEltValuep/h3>
Insertsda haluelets">">endlofda>"> 3.7lattachera/oda pasticular node. T>">sizebofda>"> 3.7l by one.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/tliro lirastrong>h a/tatrong> ( " /> Parameters:Sizeclass="field-bod) – a>">haluelto agrain a>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>operty"rps="re class="xra class="reference internal" href="#tuli

node/t/tr>
SizeVectorP>operty.popBackNodeEltValuep/h3>
ccmovesste">haluelets">">endlofda>"> 3.7l(if>not>empty)lattachera/oda pasticular node. T>">sizebofda>"> 3.7l by one.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/te class="xrmaintain the subevensph relation between graphs.) – if pranlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>operty"re class="xra class="reference internal" href="#tuli

SizeVectorP>operty.resizeNodeValuep>node">node/t/tr,daem>sizecl/tr>
SizeVectorP>operty.resizeNodeValuep/h3>
ccsizesda>"> 3.7lattachera/oda pasticular node. A>d iault>haluelwill>bela> nceera/odnew elementsl(if>any).e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/tliro lirastrong>sizeclatrong> ( em>eld-ger/tem>) – a>">new sizebofda>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>operty"rps="re class="xra class="reference internal" href="#tuli

node">node/t/tr,daem>sizecl/tr,daem>h a/t/tr> ccsizesda>"> 3.7lattachera/oda pasticular node. Te">haluelgivensin pasama"filwill>bela> nceera/odnew elementsl(if>any).e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/tliro lirastrong>sizeclatrong> ( em>eld-ger/tem>) – a>">new sizebofda>"> 3.7/tliro lirastrong>h a/tatrong> ( " /> Parameters:Sizeclass="field-bod) – a>">haluelto a> ncesondnew elementslin a>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>operty"rps="re class="xra class="reference internal" href="#tuli

edgt/t/tr,daem>index/t/tr>
SizeVectorP>operty.getEdgtEltValuep/h3>
ccaph.ad">">haluelin a>"> 3.7lattachera/oda pasticular edgtsats">">givensindex.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/tliro lirastrong>index/tatrong> ( em>eld-ger/tem>) – a>">indexlin a>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst">a" /> Parameters:Sizeclass="field-bod/tps="re class="xrmaintain the sub-graph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertysor>ifsa>"> 3.7lattachera/oda>">edgtshasda sizebsassl"r ahans">">givensindex.e "verre class="xra class="reference internal" href="#tuli

SizeVectorP>operty.setEdgtEltValuep>node">edgt/t/tr,daem>index/t/tr,daem>h a/t/tr>
SizeVectorP>operty.setEdgtEltValuep/h3>
Setad">">haluelin a>"> 3.7lattachera/oda pasticular edgtsats">">givensindex.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/tliro lirastrong>index/tatrong> ( em>eld-ger/tem>) – a>">indexlin a>"> 3.7/tliro lirastrong>h a/tatrong> ( " /> Parameters:Sizeclass="field-bod) – a>">haluelto setsin a>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertysor>ifsa>"> 3.7lattachera/oda>">edgtshasda sizebsassl"r ahans">">givensindex.e "verre class="xra class="reference internal" href="#tuli

SizeVectorP>operty.pushBackEdgtEltValuep>node">edgt/t/tr,daem>h a/t/tr>
SizeVectorP>operty.pushBackEdgtEltValuep/h3>
Insertsda haluelets">">endlofda>"> 3.7lattachera/oda pasticular edgt. T>">sizebofda>"> 3.7l by one.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/tliro lirastrong>h a/tatrong> ( " /> Parameters:Sizeclass="field-bod) – a>">haluelto agrain a>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertyfips="re class="xra class="reference internal" href="#tuli

SizeVectorP>operty.popBackEdgtEltValuep>node">edgt/t/tr>
SizeVectorP>operty.popBackEdgtEltValuep/h3>
ccmovesste">haluelets">">endlofda>"> 3.7l(if>not>empty)lattachera/oda pasticular edgt. T>">sizebofda>"> 3.7l by one.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/te class="xrmaintain the subevensph relation between graphs.) – if pranlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertyfii class="xra class="reference internal" href="#tuli

SizeVectorP>operty.resizeEdgtValuep>node">edgt/t/tr,daem>sizecl/tr>
SizeVectorP>operty.resizeEdgtValuep/h3>
ccsizesda>"> 3.7lattachera/oda pasticular edgt. A>d iault>haluelwill>bela> nceera/odnew elementsl(if>any).e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/tliro lirastrong>sizeclatrong> ( em>eld-ger/tem>) – a>">new sizebofda>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertyfips="re class="xra class="reference internal" href="#tuli

node">edgt/t/tr,daem>sizecl/tr,daem>h a/t/tr> ccsizesda>"> 3.7lattachera/oda pasticular edgt. T>">haluelgivensin pasama"filwill>bela> nceera/odnew elementsl(if>any).e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/tliro lirastrong>sizeclatrong> ( em>eld-ger/tem>) – a>">new sizebofda>"> 3.7/tliro lirastrong>h a/tatrong> ( " /> Parameters:Sizeclass="field-bod) – a>">haluelto a> ncesondnew elementslin a>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>operty"rps="re class="xra class="reference internal" h internal" h iiv ) §uli"class=lp-strungvectorg>operty to h3StrungVectorP>opertyctable>

operty /h3>
de">opertycield-table>
StrungVectorP>operty /h3>
Bases:d " /> opertyIld-bface /h3> opertyIld-bface < Parameters:P>opertyIld-bfaceclass="field-bod/tps="ref="#tuli
StrungVectorP>operty.copy >node">nodeDst/t/tr,daem>nodeSrc/t/tr,daem>g>op/t/tr>ame">Parametoptulield-[/tass=",daem>ifNotD iault=False/t/tr>ame">Parametoptulield-]/tass="f
StrungVectorP>operty.copy /h3>
noame">Parametve culimodi#82d >New> s ve culi 3.8.class="fi"verp>Copiesste">haluelholdsbysasg>operty on a>nodtsao anoVher>nodtsonia>issg>operty.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst le>t simple to lirastrong>nodeDst/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – a>">nodtsao copyste">haluelto./tliro lirastrong>nodeSrc/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – a>">nodtsao copyste">haluelpsom./tliro lirastrong>g>op/tatrong> ( " /> operty /h3> operty <.edge.isValid"> Parameters:StrungVectorP>opertyciass="field-bod) – a>">g>operty holdung te">haluelto copy./tliro lirastrong>ifNotD iault/tstrong> (aem>boolean/tem>) – whea>"r ao nceortsd iault-valuated>nodessor>not. D iaults ass.edge.isValid"> isValid(edgtDst/t/tr,daem>edgtSrc/t/tr,daem>g>op/t/tr>ame">Parametoptulield-[/tass=",daem>ifNotD iault=False/t/tr>ame">Parametoptulield-]/tass="f noame">Parametve culimodi#82d >New> s ve culi 3.8.class="fi"verp>Copiesste">haluelholdsbysasg>operty on ansedgt ao anoVher>edgt onia>issg>operty.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst le>t simple to lirastrong>edgtDst/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – a>">nodtsao copyste">haluelto./tliro lirastrong>edgtSrc/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – a>">nodtsao copyste">haluelpsom./tliro lirastrong>g>op/tatrong> ( " /> operty /h3> operty <.edge.isValid"> Parameters:StrungVectorP>opertyciass="field-bod) – a>">g>operty holdung te">haluelto copy./tliro lirastrong>ifNotD iault/tstrong> (aem>boolean/tem>) – whea>"r ao nceortsd iault-valuated>nodessor>not. D iaults ass.edge.isValid"> isValid(g>op/t/tr> noame">Parametve culimodi#82d >New> s ve culi 3.8.class="fi"verp>Copiesste">halueslholdsbysasg>operty on a>issg>operty.fi"versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>g>op/tatrong> (a" /> operty /h3> operty <.edge.isValid"> Parameters:StrungVectorP>opertyciass="field-bod) – a>">g>operty to copy"re class="xra class="reference internal" href="#tuli

StrungVectorP>operty.getEdgtD iaultValuep/h3>
ccaph.ad">">d iault> 3.7lofdhaluesla> ociated>/od/t">edgts.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if pr 3.7lofdstrung"re class="xra class="reference internal" href="#tuli

edgt/t/tr>
StrungVectorP>operty.getEdgtValuep/h3>
ccaph.ad">"> 3.7lofdhaluesla> ociated>/oda pasticular edgt.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/te class="xrmaintain the subevensph relation between graphs.) – if pr 3.7lofdstrung"re class="xrmaintain the sub-graph relation between graphs.) – if pranlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertyfii class="xra class="reference internal" href="#tuli

StrungVectorP>operty.getNodeD iaultValuep>node">
StrungVectorP>operty.getNodeD iaultValuep/h3>
ccaph.ad">">d iault> 3.7lofdhaluesla> ociated>/od/t">nodes.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if pr 3.7lofdstrung"re class="xra class="reference internal" href="#tuli

node/t/tr>
StrungVectorP>operty.getNodeValuep/h3>
ccaph.ad">"> 3.7lofdhaluesla> ociated>/oda pasticular node.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/te class="xrmaintain the subevensph relation between graphs.) – if pr 3.7lofdstrung"re class="xrmaintain the sub-graph relation between graphs.) – if pranlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>operty"re class="xra class="reference internal" href="#tuli

StrungVectorP>operty.setAllEdgtValuep>node">h a/t/tr>
StrungVectorP>operty.setAllEdgtValuep/h3>
Setad">">scla> 3.7lofdhalueslond">">wholebsetsofdedgts.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>h a/tatrong> ( /tr 3.7lofdstrung"rem>) – a>"> 3.7lofdhalueslto setsond/t">edgts"re class="xra class="reference internal" href="#tuli

StrungVectorP>operty.setAllNodeValuep>node">h a/t/tr>
StrungVectorP>operty.setAllNodeValuep/h3>
Setad">">scla> 3.7lofdhalueslond">">wholebsetsofdnodes.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>h a/tatrong> ( /tr 3.7lofdstrung"rem>) – a>"> 3.7lofdhalueslto setsond/t">nodes/te class="xra class="reference internal" href="#tuli

StrungVectorP>operty.setEdgtValuep>node">edgt/t/tr,daem>h a/t/tr>
StrungVectorP>operty.setEdgtValuep/h3>
Setad">"> 3.7lofdhalueslofda pasticular edgt.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/tliro lirastrong>h a/tatrong> ( /tr 3.7lofdstrung"rem>) – a>"> 3.7lofdhalueslto setsond/t">edgt/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertyfips="re class="xra class="reference internal" href="#tuli

StrungVectorP>operty.setNodeValuep>node">node/t/tr,daem>h a/t/tr>
StrungVectorP>operty.setNodeValuep/h3>
Setad">"> 3.7lofdhalueslofda pasticular node.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/tliro lirastrong>h a/tatrong> ( /tr 3.7lofdstrung"rem>) – a>"> 3.7lofdhalueslto setsond/t">node/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>operty"rps="re class="xra class="reference internal" href="#tuli

node/t/tr,daem>index/t/tr>
StrungVectorP>operty.getNodeEltValuep/h3>
ccaph.ad">">haluelin a>"> 3.7lattachera/oda pasticular nodelats">">givensindex.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/tliro lirastrong>index/tatrong> ( em>eld-ger/tem>) – a>">indexlin a>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst">strung"rps="re class="xrmaintain the sub-graph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>opertysor>ifsa>"> 3.7lattachera/oda>">nodtshasda sizebsassl"r ahans">">givensindex.e "verre class="xra class="reference internal" href="#tuli

node/t/tr,daem>index/t/tr,daem>h a/t/tr>
StrungVectorP>operty.setNodeEltValuep/h3>
Setad">">haluelin a>"> 3.7lattachera/oda pasticular nodelats">">givensindex.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/tliro lirastrong>index/tatrong> ( em>eld-ger/tem>) – a>">indexlin a>"> 3.7/tliro lirastrong>h a/tatrong> ( /trstrung"rem>) – a>">haluelto setsin a>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>opertysor>ifsa>"> 3.7lattachera/oda>">nodtshasda sizebsassl"r ahans">">givensindex.e "verre class="xra class="reference internal" href="#tuli

node/t/tr,daem>h a/t/tr>
StrungVectorP>operty.pushBackNodeEltValuep/h3>
Insertsda haluelets">">endlofda>"> 3.7lattachera/oda pasticular node. T>">sizebofda>"> 3.7l by one.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/tliro lirastrong>h a/tatrong> ( /trstrung"rem>) – a>">haluelto agrain a>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>operty"rps="re class="xra class="reference internal" href="#tuli

node/t/tr>
StrungVectorP>operty.popBackNodeEltValuep/h3>
ccmovesste">haluelets">">endlofda>"> 3.7l(if>not>empty)lattachera/oda pasticular node. T>">sizebofda>"> 3.7l by one.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/te class="xrmaintain the subevensph relation between graphs.) – if pranlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>operty"re class="xra class="reference internal" href="#tuli

StrungVectorP>operty.resizeNodeValuep>node">node/t/tr,daem>sizecl/tr>
StrungVectorP>operty.resizeNodeValuep/h3>
ccsizesda>"> 3.7lattachera/oda pasticular node. A>d iault>haluelwill>bela> nceera/odnew elementsl(if>any).e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/tliro lirastrong>sizeclatrong> ( em>eld-ger/tem>) – a>">new sizebofda>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>operty"rps="re class="xra class="reference internal" href="#tuli

node">node/t/tr,daem>sizecl/tr,daem>h a/t/tr> ccsizesda>"> 3.7lattachera/oda pasticular node. Te">haluelgivensin pasama"filwill>bela> nceera/odnew elementsl(if>any).e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>node/tatrong> (a" /> .edge.isValid"> Parameters:node/tass="field-bod) – anlex3.7ung node/tliro lirastrong>sizeclatrong> ( em>eld-ger/tem>) – a>">new sizebofda>"> 3.7/tliro lirastrong>h a/tatrong> ( /trstrung"rem>) – a>">haluelto a> ncesondnew elementslin a>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>operty"rps="re class="xra class="reference internal" href="#tuli

edgt/t/tr,daem>index/t/tr>
StrungVectorP>operty.getEdgtEltValuep/h3>
ccaph.ad">">haluelin a>"> 3.7lattachera/oda pasticular edgtsats">">givensindex.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/tliro lirastrong>index/tatrong> ( em>eld-ger/tem>) – a>">indexlin a>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst">strung"rps="re class="xrmaintain the sub-graph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertysor>ifsa>"> 3.7lattachera/oda>">edgtshasda sizebsassl"r ahans">">givensindex.e "verre class="xra class="reference internal" href="#tuli

StrungVectorP>operty.setEdgtEltValuep>node">edgt/t/tr,daem>index/t/tr,daem>h a/t/tr>
StrungVectorP>operty.setEdgtEltValuep/h3>
Setad">">haluelin a>"> 3.7lattachera/oda pasticular edgtsats">">givensindex.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/tliro lirastrong>index/tatrong> ( em>eld-ger/tem>) – a>">indexlin a>"> 3.7/tliro lirastrong>h a/tatrong> ( /trstrung"rem>) – a>">haluelto setsin a>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertysor>ifsa>"> 3.7lattachera/oda>">edgtshasda sizebsassl"r ahans">">givensindex.e "verre class="xra class="reference internal" href="#tuli

StrungVectorP>operty.pushBackEdgtEltValuep>node">edgt/t/tr,daem>h a/t/tr>
StrungVectorP>operty.pushBackEdgtEltValuep/h3>
Insertsda haluelets">">endlofda>"> 3.7lattachera/oda pasticular edgt. T>">sizebofda>"> 3.7l by one.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/tliro lirastrong>h a/tatrong> ( /trstrung"rem>) – a>">haluelto agrain a>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertyfips="re class="xra class="reference internal" href="#tuli

StrungVectorP>operty.popBackEdgtEltValuep>node">edgt/t/tr>
StrungVectorP>operty.popBackEdgtEltValuep/h3>
ccmovesste">haluelets">">endlofda>"> 3.7l(if>not>empty)lattachera/oda pasticular edgt. T>">sizebofda>"> 3.7l by one.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/te class="xrmaintain the subevensph relation between graphs.) – if pranlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertyfii class="xra class="reference internal" href="#tuli

StrungVectorP>operty.resizeEdgtValuep>node">edgt/t/tr,daem>sizecl/tr>
StrungVectorP>operty.resizeEdgtValuep/h3>
ccsizesda>"> 3.7lattachera/oda pasticular edgt. A>d iault>haluelwill>bela> nceera/odnew elementsl(if>any).e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/tliro lirastrong>sizeclatrong> ( em>eld-ger/tem>) – a>">new sizebofda>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">edgtstoes>not>belongs/os">">graph attachera/od/t">g>opertyfips="re class="xra class="reference internal" href="#tuli

node">edgt/t/tr,daem>sizecl/tr,daem>h a/t/tr> ccsizesda>"> 3.7lattachera/oda pasticular edgt. T>">haluelgivensin pasama"filwill>bela> nceera/odnew elementsl(if>any).e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst simple to lirastrong>edgt/tatrong> (a" /> .edge.isValid"> Parameters:edgt/tass="field-bod) – anlex3.7ung edgt/tliro lirastrong>sizeclatrong> ( em>eld-ger/tem>) – a>">new sizebofda>"> 3.7/tliro lirastrong>h a/tatrong> ( /trstrung"rem>) – a>">haluelto a> ncesondnew elementslin a>"> 3.7/tliro /uls="re class="xrmaintain the subevensph relation between graphs.) – if pr p>) rst le>t">anlexceptuli ifsa>">nodtsdoes>not>belongs/os">">graph attachera/od/t">g>operty"rps="re class="xra class="reference internal" h internal" h iiv ) §uli"class=y va-pluginsle.isVeu Ty va plugins e.isVeu/table>

) §uli"class=lp-withpaspan"fi WithPaspan"fictable>
Parameteroperty de">
WithPaspan"fi /h3>
T> ss=ribes>paspan"fi veorda plug-in. T>"se>paspan"fi vcanlbebofdmultipleaphbelshown when a>">plug-in in invoked>by a>">user./tps="ref="#tuli
WithPaspan"fi.addBooleanPaspan"fi npan/t/tr>ame">Parametoptulield-[/tass=",daem>help = ""cl/tr,daem>d iaultValue = ""cl/tr,daem>isMandatory = Trut/t/tr,daem>inPaspa = Trut/t/tr,daem>outPaspa = False/t/tr>ame">Parametoptulield-]/tass="f
WithPaspan"fi.addBooleanPaspan"fi /h3>
Addsda boolean>paspan"fia/od/t">glug-in.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst le>t simple to lirastrong>npan/tatrong> ( /trstrung"rem>) – a>">npanbofda>">boolean>paspan"fia/odadd/tliro lirastrong>help/tatrong> ( /trstrung"rem>) – a">ss=riptuli ofda>">paspan"fi, thetswill>beldisplayera/od/t">user/tliro lirastrong>d iaultValue/tatrong> ( /trstrung"rem>) – a>">d iault>haluel(“trut” ord“false”)da>">paspan"filshoulra/ake,a/odbela>">in"tual>haluelin a>">GUI/tliro lirastrong>isMandatory/tstrong> (aem>boolean/tem>) – specify whea>"r a>issgaspan"filrequiresda haluelor>not/tliro lirastrong>inPaspa/tstrong> (aem>boolean/tem>) – t id=esdifda>">paspan"fil <>by a>">plugin)/tliro lirastrong>outPaspa/tstrong> (aem>boolean/tem>) – t id=esdifda>">paspan"fil ">plugin and retrueved af"fil tslexeew ion)/tliro /uls="re class="xra class="reference internal" href="#tuli

WithPaspan"fi.addBooleanPropertyPaspan"fi npan/t/tr>ame">Parametoptulield-[/tass=",daem>help = ""cl/tr,daem>d iaultValue = ""cl/tr,daem>isMandatory = Trut/t/tr,daem>inPaspa = Trut/t/tr,daem>outPaspa = False/t/tr>ame">Parametoptulield-]/tass="f
WithPaspan"fi.addBooleanPropertyPaspan"fi /h3>
Addsda a" /> .edge.isValid"> Parameters:BooleanProperty/tass="field-bod>paspan"fia/od/t">glug-in.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst le>t simple to lirastrong>npan/tatrong> ( /trstrung"rem>) – a>">npanbofda>">a" /> .edge.isValid"> Parameters:BooleanProperty/tass="field-bod>paspan"fia/odadd/tliro lirastrong>help/tatrong> ( /trstrung"rem>) – a">ss=riptuli ofda>">paspan"fi, thetswill>beldisplayera/od/t">user/tliro lirastrong>d iaultValue/tatrong> ( /trstrung"rem>) – a>">d iault>haluel(in a>">eormd“<eroperty_npan>”)da>">paspan"filshoulra/ake,a/odbela>">in"tual>haluelin a>">GUI/tliro lirastrong>isMandatory/tstrong> (aem>boolean/tem>) – specify whea>"r a>issgaspan"filrequiresda haluelor>not/tliro lirastrong>inPaspa/tstrong> (aem>boolean/tem>) – t id=esdifda>">paspan"fil <>by a>">plugin)/tliro lirastrong>outPaspa/tstrong> (aem>boolean/tem>) – t id=esdifda>">paspan"fil ">plugin and retrueved af"fil tslexeew ion)/tliro /uls="re class="xra class="reference internal" href="#tuli

WithPaspan"fi.addBooleanVectorP>opertyPaspan"fi opertyPaspan"fi/tils add existingem>npan/t/tr>ame">Parametoptulield-[/tass=",daem>help = ""cl/tr,daem>d iaultValue = ""cl/tr,daem>isMandatory = Trut/t/tr,daem>inPaspa = Trut/t/tr,daem>outPaspa = False/t/tr>ame">Parametoptulield-]/tass="f
WithPaspan"fi.addBooleanVectorP>opertyPaspan"fi /h3>
noame">Parametve culimodi#82d >New> s ve culi 4.2.class="fi"verp>Addsda a" /> operty /h3> operty >.edge.isValid"> Parameters:BooleanVectorP>opertyciass="field-bod>paspan"fia/od/t">glug-in.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst le>t simple to lirastrong>npan/tatrong> ( /trstrung"rem>) – a>">npanbofda>">a" /> operty /h3> operty >.edge.isValid"> Parameters:BooleanVectorP>opertyciass="field-bod>paspan"fia/odadd/tliro lirastrong>help/tatrong> ( /trstrung"rem>) – a">ss=riptuli ofda>">paspan"fi, thetswill>beldisplayera/od/t">user/tliro lirastrong>d iaultValue/tatrong> ( /trstrung"rem>) – a>">d iault>haluel(in a>">eormd“<eroperty_npan>”)da>">paspan"filshoulra/ake,a/odbela>">in"tual>haluelin a>">GUI/tliro lirastrong>isMandatory/tstrong> (aem>boolean/tem>) – specify whea>"r a>issgaspan"filrequiresda haluelor>not/tliro lirastrong>inPaspa/tstrong> (aem>boolean/tem>) – t id=esdifda>">paspan"fil <>by a>">plugin)/tliro lirastrong>outPaspa/tstrong> (aem>boolean/tem>) – t id=esdifda>">paspan"fil ">plugin and retrueved af"fil tslexeew ion)/tliro /uls="re class="xra class="reference internal" href="#tuli

WithPaspan"fi.addColorPaspan"fi npan/t/tr>ame">Parametoptulield-[/tass=",daem>help = ""cl/tr,daem>d iaultValue = ""cl/tr,daem>isMandatory = Trut/t/tr,daem>inPaspa = Trut/t/tr,daem>outPaspa = False/t/tr>ame">Parametoptulield-]/tass="f
WithPaspan"fi.addColorPaspan"fi /h3>
Addsda a" /> .edge.isValid"> Parameters:Colorciass="field-bod>paspan"fia/od/t">glug-in.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst le>t simple to lirastrong>npan/tatrong> ( /trstrung"rem>) – a>">npanbofda>">a" /> .edge.isValid"> Parameters:Colorciass="field-bod>paspan"fia/odadd/tliro lirastrong>help/tatrong> ( /trstrung"rem>) – a">ss=riptuli ofda>">paspan"fi, thetswill>beldisplayera/od/t">user/tliro lirastrong>d iaultValue/tatrong> ( /trstrung"rem>) – a>">d iault>haluel(in a>">eormd“(R, G, B, A)”, e.g.veordrera:d“(255,0,0,255)”)da>">paspan"filshoulra/ake,a/odbela>">in"tual>haluelin a>">GUI/tliro lirastrong>isMandatory/tstrong> (aem>boolean/tem>) – specify whea>"r a>issgaspan"filrequiresda haluelor>not/tliro lirastrong>inPaspa/tstrong> (aem>boolean/tem>) – t id=esdifda>">paspan"fil <>by a>">plugin)/tliro lirastrong>outPaspa/tstrong> (aem>boolean/tem>) – t id=esdifda>">paspan"fil ">plugin and retrueved af"fil tslexeew ion)/tliro /uls="re class="xra class="reference internal" href="#tuli

WithPaspan"fi.addColorP>opertyPaspan"fi opertyPaspan"fi/tils add existingem>npan/t/tr>ame">Parametoptulield-[/tass=",daem>help = ""cl/tr,daem>d iaultValue = ""cl/tr,daem>isMandatory = Trut/t/tr,daem>inPaspa = Trut/t/tr,daem>outPaspa = False/t/tr>ame">Parametoptulield-]/tass="f
WithPaspan"fi.addColorPropertyPaspan"fi /h3>
Addsda a" /> operty >.edge.isValid"> Parameters:ColorP>opertyciass="field-bod>paspan"fia/od/t">glug-in.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst le>t simple to lirastrong>npan/tatrong> ( /trstrung"rem>) – a>">npanbofda>">a" /> operty >.edge.isValid"> Parameters:ColorP>opertyciass="field-bod>paspan"fia/odadd/tliro lirastrong>help/tatrong> ( /trstrung"rem>) – a">ss=riptuli ofda>">paspan"fi, thetswill>beldisplayera/od/t">user/tliro lirastrong>d iaultValue/tatrong> ( /trstrung"rem>) – a>">d iault>haluel(in a>">eormd“<eroperty_npan>”)da>">paspan"filshoulra/ake,a/odbela>">in"tual>haluelin a>">GUI/tliro lirastrong>isMandatory/tstrong> (aem>boolean/tem>) – specify whea>"r a>issgaspan"filrequiresda haluelor>not/tliro lirastrong>inPaspa/tstrong> (aem>boolean/tem>) – t id=esdifda>">paspan"fil <>by a>">plugin)/tliro lirastrong>outPaspa/tstrong> (aem>boolean/tem>) – t id=esdifda>">paspan"fil ">plugin and retrueved af"fil tslexeew ion)/tliro /uls="re class="xra class="reference internal" href="#tuli

WithPaspan"fi.addColorScalePaspan"fi npan/t/tr>ame">Parametoptulield-[/tass=",daem>help = ""cl/tr,daem>d iaultValue = ""cl/tr,daem>isMandatory = Trut/t/tr,daem>inPaspa = Trut/t/tr,daem>outPaspa = False/t/tr>ame">Parametoptulield-]/tass="f
WithPaspan"fi.addColorScalePaspan"fi /h3>
Addsda a" /> .edge.isValid"> Parameters:ColorScaleciass="field-bod>paspan"fia/od/t">glug-in.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst le>t simple to lirastrong>npan/tatrong> ( /trstrung"rem>) – a>">npanbofda>">a" /> .edge.isValid"> Parameters:ColorScaleciass="field-bod>paspan"fia/odadd/tliro lirastrong>help/tatrong> ( /trstrung"rem>) – a">ss=riptuli ofda>">paspan"fi, thetswill>beldisplayera/od/t">user/tliro lirastrong>d iaultValue/tatrong> ( /trstrung"rem>) – a>">d iault>haluel(in a>">eormd“((R, G, B, A), ..., (R, G, B, A))”, e.g.vgradientpaspan"filshoulra/ake,a/odbela>">in"tual>haluelin a>">GUI/tliro lirastrong>isMandatory/tstrong> (aem>boolean/tem>) – specify whea>"r a>issgaspan"filrequiresda haluelor>not/tliro lirastrong>inPaspa/tstrong> (aem>boolean/tem>) – t id=esdifda>">paspan"fil <>by a>">plugin)/tliro lirastrong>outPaspa/tstrong> (aem>boolean/tem>) – t id=esdifda>">paspan"fil ">plugin and retrueved af"fil tslexeew ion)/tliro /uls="re class="xra class="reference internal" href="#tuli

WithPaspan"fi.addColorVectorP>opertyPaspan"fi opertyPaspan"fi/tils add existingem>npan/t/tr>ame">Parametoptulield-[/tass=",daem>help = ""cl/tr,daem>d iaultValue = ""cl/tr,daem>isMandatory = Trut/t/tr,daem>inPaspa = Trut/t/tr,daem>outPaspa = False/t/tr>ame">Parametoptulield-]/tass="f
WithPaspan"fi.addColorVectorP>opertyPaspan"fi /h3>
noame">Parametve culimodi#82d >New> s ve culi 4.2.class="fi"verp>Addsda a" /> operty /h3> operty >.edge.isValid"> Parameters:ColorVectorP>opertyciass="field-bod>paspan"fia/od/t">glug-in.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst le>t simple to lirastrong>npan/tatrong> ( /trstrung"rem>) – a>">npanbofda>">a" /> operty /h3> operty >.edge.isValid"> Parameters:ColorVectorP>opertyciass="field-bod>paspan"fia/odadd/tliro lirastrong>help/tatrong> ( /trstrung"rem>) – a">ss=riptuli ofda>">paspan"fi, thetswill>beldisplayera/od/t">user/tliro lirastrong>d iaultValue/tatrong> ( /trstrung"rem>) – a>">d iault>haluel(in a>">eormd“<eroperty_npan>”)da>">paspan"filshoulra/ake,a/odbela>">in"tual>haluelin a>">GUI/tliro lirastrong>isMandatory/tstrong> (aem>boolean/tem>) – specify whea>"r a>issgaspan"filrequiresda haluelor>not/tliro lirastrong>inPaspa/tstrong> (aem>boolean/tem>) – t id=esdifda>">paspan"fil <>by a>">plugin)/tliro lirastrong>outPaspa/tstrong> (aem>boolean/tem>) – t id=esdifda>">paspan"fil ">plugin and retrueved af"fil tslexeew ion)/tliro /uls="re class="xra class="reference internal" href="#tuli

WithPaspan"fi.addCoordVectorP>opertyPaspan"fi opertyPaspan"fi/tils add existingem>npan/t/tr>ame">Parametoptulield-[/tass=",daem>help = ""cl/tr,daem>d iaultValue = ""cl/tr,daem>isMandatory = Trut/t/tr,daem>inPaspa = Trut/t/tr,daem>outPaspa = False/t/tr>ame">Parametoptulield-]/tass="f
WithPaspan"fi.addCoordVectorP>opertyPaspan"fi /h3>
noame">Parametve culimodi#82d >New> s ve culi 4.2.class="fi"verp>Addsda aedge.isValid"> Parameters:CoorVectorP>opertyciass="field>paspan"fia/od/t">glug-in.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst le>t simple to lirastrong>npan/tatrong> ( /trstrung"rem>) – a>">npanbofda>">a" /> operty /h3> operty >.edge.isValid"> Parameters:LayoutP>opertyciass="field-bod>paspan"fia/odadd/tliro lirastrong>help/tatrong> ( /trstrung"rem>) – a">ss=riptuli ofda>">paspan"fi, thetswill>beldisplayera/od/t">user/tliro lirastrong>d iaultValue/tatrong> ( /trstrung"rem>) – a>">d iault>haluel(in a>">eormd“<eroperty_npan>”)da>">paspan"filshoulra/ake,a/odbela>">in"tual>haluelin a>">GUI/tliro lirastrong>isMandatory/tstrong> (aem>boolean/tem>) – specify whea>"r a>issgaspan"filrequiresda haluelor>not/tliro lirastrong>inPaspa/tstrong> (aem>boolean/tem>) – t id=esdifda>">paspan"fil <>by a>">plugin)/tliro lirastrong>outPaspa/tstrong> (aem>boolean/tem>) – t id=esdifda>">paspan"fil ">plugin and retrueved af"fil tslexeew ion)/tliro /uls="re class="xra class="reference internal" href="#tuli

WithPaspan"fi.addDouereP>opertyPaspan"fi opertyPaspan"fi/tils add existingem>npan/t/tr>ame">Parametoptulield-[/tass=",daem>help = ""cl/tr,daem>d iaultValue = ""cl/tr,daem>isMandatory = Trut/t/tr,daem>inPaspa = Trut/t/tr,daem>outPaspa = False/t/tr>ame">Parametoptulield-]/tass="f
WithPaspan"fi.addDouereP>opertyPaspan"fi /h3>
Addsda a" /> operty /h3> operty >.edge.isValid"> Parameters:DouereP>opertyciass="field-bod>paspan"fia/od/t">glug-in.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst le>t simple to lirastrong>npan/tatrong> ( /trstrung"rem>) – a>">npanbofda>">a" /> operty /h3> operty >.edge.isValid"> Parameters:DouereP>opertyciass="field-bod>paspan"fia/odadd/tliro lirastrong>help/tatrong> ( /trstrung"rem>) – a">ss=riptuli ofda>">paspan"fi, thetswill>beldisplayera/od/t">user/tliro lirastrong>d iaultValue/tatrong> ( /trstrung"rem>) – a>">d iault>haluel(in a>">eormd“<eroperty_npan>”)da>">paspan"filshoulra/ake,a/odbela>">in"tual>haluelin a>">GUI/tliro lirastrong>isMandatory/tstrong> (aem>boolean/tem>) – specify whea>"r a>issgaspan"filrequiresda haluelor>not/tliro lirastrong>inPaspa/tstrong> (aem>boolean/tem>) – t id=esdifda>">paspan"fil <>by a>">plugin)/tliro lirastrong>outPaspa/tstrong> (aem>boolean/tem>) – t id=esdifda>">paspan"fil ">plugin and retrueved af"fil tslexeew ion)/tliro /uls="re class="xra class="reference internal" href="#tuli

WithPaspan"fi.addDouereVectorP>opertyPaspan"fi opertyPaspan"fi/tils add existingem>npan/t/tr>ame">Parametoptulield-[/tass=",daem>help = ""cl/tr,daem>d iaultValue = ""cl/tr,daem>isMandatory = Trut/t/tr,daem>inPaspa = Trut/t/tr,daem>outPaspa = False/t/tr>ame">Parametoptulield-]/tass="f
WithPaspan"fi.addDouereVectorP>opertyPaspan"fi /h3>
noame">Parametve culimodi#82d >New> s ve culi 4.2.class="fi"verp>Addsda a" /> operty /h3> operty >.edge.isValid"> Parameters:DouereVectorP>opertyciass="field-bod>paspan"fia/od/t">glug-in.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst le>t simple to lirastrong>npan/tatrong> ( /trstrung"rem>) – a>">npanbofda>">a" /> operty /h3> operty >.edge.isValid"> Parameters:DouereVectorP>opertyciass="field-bod>paspan"fia/odadd/tliro lirastrong>help/tatrong> ( /trstrung"rem>) – a">ss=riptuli ofda>">paspan"fi, thetswill>beldisplayera/od/t">user/tliro lirastrong>d iaultValue/tatrong> ( /trstrung"rem>) – a>">d iault>haluel(in a>">eormd“<eroperty_npan>”)da>">paspan"filshoulra/ake,a/odbela>">in"tual>haluelin a>">GUI/tliro lirastrong>isMandatory/tstrong> (aem>boolean/tem>) – specify whea>"r a>issgaspan"filrequiresda haluelor>not/tliro lirastrong>inPaspa/tstrong> (aem>boolean/tem>) – t id=esdifda>">paspan"fil <>by a>">plugin)/tliro lirastrong>outPaspa/tstrong> (aem>boolean/tem>) – t id=esdifda>">paspan"fil ">plugin and retrueved af"fil tslexeew ion)/tliro /uls="re class="xra class="reference internal" href="#tuli

WithPaspan"fi.addFloatPaspan"fi npan/t/tr>ame">Parametoptulield-[/tass=",daem>help = ""cl/tr,daem>d iaultValue = ""cl/tr,daem>isMandatory = Trut/t/tr,daem>inPaspa = Trut/t/tr,daem>outPaspa = False/t/tr>ame">Parametoptulield-]/tass="f
WithPaspan"fi.addFloatPaspan"fi /h3>
Addsda floatung poeld numbfilpaspan"fia/od/t">glug-in.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst le>t simple to lirastrong>npan/tatrong> ( /trstrung"rem>) – a>">npanbofda>">floatung poeld numbfilpaspan"fia/odadd/tliro lirastrong>help/tatrong> ( /trstrung"rem>) – a">ss=riptuli ofda>">paspan"fi, thetswill>beldisplayera/od/t">user/tliro lirastrong>d iaultValue/tatrong> ( /trstrung"rem>) – a>">d iault>haluel(in a>">eormd“[0-9]*[.][0-9]+”)da>">paspan"filshoulra/ake,a/odbela>">in"tual>haluelin a>">GUI/tliro lirastrong>isMandatory/tstrong> (aem>boolean/tem>) – specify whea>"r a>issgaspan"filrequiresda haluelor>not/tliro lirastrong>inPaspa/tstrong> (aem>boolean/tem>) – t id=esdifda>">paspan"fil <>by a>">plugin)/tliro lirastrong>outPaspa/tstrong> (aem>boolean/tem>) – t id=esdifda>">paspan"fil ">plugin and retrueved af"fil tslexeew ion)/tliro /uls="re class="xra class="reference internal" href="#tuli

WithPaspan"fi.addIld-gerPaspan"fi npan/t/tr>ame">Parametoptulield-[/tass=",daem>help = ""cl/tr,daem>d iaultValue = ""cl/tr,daem>isMandatory = Trut/t/tr,daem>inPaspa = Trut/t/tr,daem>outPaspa = False/t/tr>ame">Parametoptulield-]/tass="f
WithPaspan"fi.addIld-gerPaspan"fi /h3>
Addsdan eld-gerlpaspan"fia/od/t">glug-in.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst le>t simple to lirastrong>npan/tatrong> ( /trstrung"rem>) – a>">npanbofda>">eld-gerlpaspan"fia/odadd/tliro lirastrong>help/tatrong> ( /trstrung"rem>) – a">ss=riptuli ofda>">paspan"fi, thetswill>beldisplayera/od/t">user/tliro lirastrong>d iaultValue/tatrong> ( /trstrung"rem>) – a>">d iault>haluel(in a>">eormd“[0-9]+”)da>">paspan"filshoulra/ake,a/odbela>">in"tual>haluelin a>">GUI/tliro lirastrong>isMandatory/tstrong> (aem>boolean/tem>) – specify whea>"r a>issgaspan"filrequiresda haluelor>not/tliro lirastrong>inPaspa/tstrong> (aem>boolean/tem>) – t id=esdifda>">paspan"fil <>by a>">plugin)/tliro lirastrong>outPaspa/tstrong> (aem>boolean/tem>) – t id=esdifda>">paspan"fil ">plugin and retrueved af"fil tslexeew ion)/tliro /uls="re class="xra class="reference internal" href="#tuli

WithPaspan"fi.addIld-gerP>opertyPaspan"fi opertyPaspan"fi/tils add existingem>npan/t/tr>ame">Parametoptulield-[/tass=",daem>help = ""cl/tr,daem>d iaultValue = ""cl/tr,daem>isMandatory = Trut/t/tr,daem>inPaspa = Trut/t/tr,daem>outPaspa = False/t/tr>ame">Parametoptulield-]/tass="f
WithPaspan"fi.addIld-gerP>opertyPaspan"fi /h3>
Addsda a" /> operty /h3> operty >.edge.isValid"> Parameters:Ild-gerP>opertyciass="field-bod>paspan"fia/od/t">glug-in.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst le>t simple to lirastrong>npan/tatrong> ( /trstrung"rem>) – a>">npanbofda>">a" /> operty /h3> operty >.edge.isValid"> Parameters:Ild-gerP>opertyciass="field-bod>paspan"fia/odadd/tliro lirastrong>help/tatrong> ( /trstrung"rem>) – a">ss=riptuli ofda>">paspan"fi, thetswill>beldisplayera/od/t">user/tliro lirastrong>d iaultValue/tatrong> ( /trstrung"rem>) – a>">d iault>haluel(in a>">eormd“<eroperty_npan>”)da>">paspan"filshoulra/ake,a/odbela>">in"tual>haluelin a>">GUI/tliro lirastrong>isMandatory/tstrong> (aem>boolean/tem>) – specify whea>"r a>issgaspan"filrequiresda haluelor>not/tliro lirastrong>inPaspa/tstrong> (aem>boolean/tem>) – t id=esdifda>">paspan"fil <>by a>">plugin)/tliro lirastrong>outPaspa/tstrong> (aem>boolean/tem>) – t id=esdifda>">paspan"fil ">plugin and retrueved af"fil tslexeew ion)/tliro /uls="re class="xra class="reference internal" href="#tuli

WithPaspan"fi.addIld-gerVectorP>opertyPaspan"fi opertyPaspan"fi/tils add existingem>npan/t/tr>ame">Parametoptulield-[/tass=",daem>help = ""cl/tr,daem>d iaultValue = ""cl/tr,daem>isMandatory = Trut/t/tr,daem>inPaspa = Trut/t/tr,daem>outPaspa = False/t/tr>ame">Parametoptulield-]/tass="f
WithPaspan"fi.addIld-gerVectorP>opertyPaspan"fi /h3>
noame">Parametve culimodi#82d >New> s ve culi 4.2.class="fi"verp>Addsda a" /> operty /h3> operty >.edge.isValid"> Parameters:Ild-gerVectorP>opertyciass="field-bod>paspan"fia/od/t">glug-in.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst le>t simple to lirastrong>npan/tatrong> ( /trstrung"rem>) – a>">npanbofda>">a" /> operty /h3> operty >.edge.isValid"> Parameters:Ild-gerP>opertyciass="field-bod>paspan"fia/odadd/tliro lirastrong>help/tatrong> ( /trstrung"rem>) – a">ss=riptuli ofda>">paspan"fi, thetswill>beldisplayera/od/t">user/tliro lirastrong>d iaultValue/tatrong> ( /trstrung"rem>) – a>">d iault>haluel(in a>">eormd“<eroperty_npan>”)da>">paspan"filshoulra/ake,a/odbela>">in"tual>haluelin a>">GUI/tliro lirastrong>isMandatory/tstrong> (aem>boolean/tem>) – specify whea>"r a>issgaspan"filrequiresda haluelor>not/tliro lirastrong>inPaspa/tstrong> (aem>boolean/tem>) – t id=esdifda>">paspan"fil <>by a>">plugin)/tliro lirastrong>outPaspa/tstrong> (aem>boolean/tem>) – t id=esdifda>">paspan"fil ">plugin and retrueved af"fil tslexeew ion)/tliro /uls="re class="xra class="reference internal" href="#tuli

WithPaspan"fi.addLayoutP>opertyPaspan"fi opertyPaspan"fi/tils add existingem>npan/t/tr>ame">Parametoptulield-[/tass=",daem>help = ""cl/tr,daem>d iaultValue = ""cl/tr,daem>isMandatory = Trut/t/tr,daem>inPaspa = Trut/t/tr,daem>outPaspa = False/t/tr>ame">Parametoptulield-]/tass="f
WithPaspan"fi.addLayoutP>opertyPaspan"fi /h3>
Addsda a" /> operty /h3> operty >.edge.isValid"> Parameters:LayoutP>opertyciass="field-bod>paspan"fia/od/t">glug-in.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst le>t simple to lirastrong>npan/tatrong> ( /trstrung"rem>) – a>">npanbofda>">a" /> operty /h3> operty >.edge.isValid"> Parameters:LayoutP>opertyciass="field-bod>paspan"fia/odadd/tliro lirastrong>help/tatrong> ( /trstrung"rem>) – a">ss=riptuli ofda>">paspan"fi, thetswill>beldisplayera/od/t">user/tliro lirastrong>d iaultValue/tatrong> ( /trstrung"rem>) – a>">d iault>haluel(in a>">eormd“<eroperty_npan>”)da>">paspan"filshoulra/ake,a/odbela>">in"tual>haluelin a>">GUI/tliro lirastrong>isMandatory/tstrong> (aem>boolean/tem>) – specify whea>"r a>issgaspan"filrequiresda haluelor>not/tliro lirastrong>inPaspa/tstrong> (aem>boolean/tem>) – t id=esdifda>">paspan"fil <>by a>">plugin)/tliro lirastrong>outPaspa/tstrong> (aem>boolean/tem>) – t id=esdifda>">paspan"fil ">plugin and retrueved af"fil tslexeew ion)/tliro /uls="re class="xra class="reference internal" href="#tuli

WithPaspan"fi.addP>opertyPaspan"fi opertyPaspan"fi/tils add existingem>npan/t/tr>ame">Parametoptulield-[/tass=",daem>help = ""cl/tr,daem>d iaultValue = ""cl/tr,daem>isMandatory = Trut/t/tr,daem>inPaspa = Trut/t/tr,daem>outPaspa = False/t/tr>ame">Parametoptulield-]/tass="f
WithPaspan"fi.addP>opertyPaspan"fi /h3>
Addsda a" /> opertyIld-rface /h3> opertyIld-rface >.edge.isValid"> Parameters:P>opertyIld-rfaceciass="field-bod>paspan"fia/od/t">glug-in.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst le>t simple to lirastrong>npan/tatrong> ( /trstrung"rem>) – a>">npanbofda>">a" /> opertyIld-rface /h3> opertyIld-rface >.edge.isValid"> Parameters:P>opertyIld-rfaceciass="field-bod>paspan"fia/odadd/tliro lirastrong>help/tatrong> ( /trstrung"rem>) – a">ss=riptuli ofda>">paspan"fi, thetswill>beldisplayera/od/t">user/tliro lirastrong>d iaultValue/tatrong> ( /trstrung"rem>) – a>">d iault>haluel(in a>">eormd“<eroperty_npan>”)da>">paspan"filshoulra/ake,a/odbela>">in"tual>haluelin a>">GUI/tliro lirastrong>isMandatory/tstrong> (aem>boolean/tem>) – specify whea>"r a>issgaspan"filrequiresda haluelor>not/tliro lirastrong>inPaspa/tstrong> (aem>boolean/tem>) – t id=esdifda>">paspan"fil <>by a>">plugin)/tliro lirastrong>outPaspa/tstrong> (aem>boolean/tem>) – t id=esdifda>">paspan"fil ">plugin and retrueved af"fil tslexeew ion)/tliro /uls="re class="xra class="reference internal" href="#tuli

WithPaspan"fi.addSizeP>opertyPaspan"fi opertyPaspan"fi/tils add existingem>npan/t/tr>ame">Parametoptulield-[/tass=",daem>help = ""cl/tr,daem>d iaultValue = ""cl/tr,daem>isMandatory = Trut/t/tr,daem>inPaspa = Trut/t/tr,daem>outPaspa = False/t/tr>ame">Parametoptulield-]/tass="f
WithPaspan"fi.addSizeP>opertyPaspan"fi /h3>
Addsda a" /> operty /h3> operty >.edge.isValid"> Parameters:SizeP>opertyciass="field-bod>paspan"fia/od/t">glug-in.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst le>t simple to lirastrong>npan/tatrong> ( /trstrung"rem>) – a>">npanbofda>">a" /> operty /h3> operty >.edge.isValid"> Parameters:SizeP>opertyciass="field-bod>paspan"fia/odadd/tliro lirastrong>help/tatrong> ( /trstrung"rem>) – a">ss=riptuli ofda>">paspan"fi, thetswill>beldisplayera/od/t">user/tliro lirastrong>d iaultValue/tatrong> ( /trstrung"rem>) – a>">d iault>haluel(in a>">eormd“<eroperty_npan>”)da>">paspan"filshoulra/ake,a/odbela>">in"tual>haluelin a>">GUI/tliro lirastrong>isMandatory/tstrong> (aem>boolean/tem>) – specify whea>"r a>issgaspan"filrequiresda haluelor>not/tliro lirastrong>inPaspa/tstrong> (aem>boolean/tem>) – t id=esdifda>">paspan"fil <>by a>">plugin)/tliro lirastrong>outPaspa/tstrong> (aem>boolean/tem>) – t id=esdifda>">paspan"fil ">plugin and retrueved af"fil tslexeew ion)/tliro /uls="re class="xra class="reference internal" href="#tuli

WithPaspan"fi.addSizeVectorP>opertyPaspan"fi opertyPaspan"fi/tils add existingem>npan/t/tr>ame">Parametoptulield-[/tass=",daem>help = ""cl/tr,daem>d iaultValue = ""cl/tr,daem>isMandatory = Trut/t/tr,daem>inPaspa = Trut/t/tr,daem>outPaspa = False/t/tr>ame">Parametoptulield-]/tass="f
WithPaspan"fi.addSizeVectorP>opertyPaspan"fi /h3>
noame">Parametve culimodi#82d >New> s ve culi 4.2.class="fi"verp>Addsda a" /> operty /h3> operty >.edge.isValid"> Parameters:SizeVectorP>opertyciass="field-bod>paspan"fia/od/t">glug-in.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst le>t simple to lirastrong>npan/tatrong> ( /trstrung"rem>) – a>">npanbofda>">a" /> operty /h3> operty >.edge.isValid"> Parameters:SizeVectorP>opertyciass="field-bod>paspan"fia/odadd/tliro lirastrong>help/tatrong> ( /trstrung"rem>) – a">ss=riptuli ofda>">paspan"fi, thetswill>beldisplayera/od/t">user/tliro lirastrong>d iaultValue/tatrong> ( /trstrung"rem>) – a>">d iault>haluel(in a>">eormd“<eroperty_npan>”)da>">paspan"filshoulra/ake,a/odbela>">in"tual>haluelin a>">GUI/tliro lirastrong>isMandatory/tstrong> (aem>boolean/tem>) – specify whea>"r a>issgaspan"filrequiresda haluelor>not/tliro lirastrong>inPaspa/tstrong> (aem>boolean/tem>) – t id=esdifda>">paspan"fil <>by a>">plugin)/tliro lirastrong>outPaspa/tstrong> (aem>boolean/tem>) – t id=esdifda>">paspan"fil ">plugin and retrueved af"fil tslexeew ion)/tliro /uls="re class="xra class="reference internal" href="#tuli

WithPaspan"fi.addStrungCollectionPaspan"fi npan/t/tr>ame">Parametoptulield-[/tass=",daem>help = ""cl/tr,daem>d iaultValue = ""cl/tr,daem>isMandatory = Trut/t/tr,daem>inPaspa = Trut/t/tr,daem>outPaspa = False/t/tr>ame">Parametoptulield-]/tass="f
WithPaspan"fi.addStrungCollectionPaspan"fi /h3>
Addsda a" /> .edge.isValid"> Parameters:StrungCollectionciass="field-bod>paspan"fia/od/t">glug-in.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst le>t simple to lirastrong>npan/tatrong> ( /trstrung"rem>) – a>">npanbofda>">a" /> .edge.isValid"> Parameters:StrungCollectionciass="field-bod>paspan"fia/odadd/tliro lirastrong>help/tatrong> ( /trstrung"rem>) – a">ss=riptuli ofda>">paspan"fi, thetswill>beldisplayera/od/t">user/tliro lirastrong>d iaultValue/tatrong> ( /trstrung"rem>) – a>">d iault>haluel(in a>">eormd“entry1;entry2;...;entryN”)da>">paspan"filshoulra/ake,a/odbela>">in"tual>haluelin a>">GUI/tliro lirastrong>isMandatory/tstrong> (aem>boolean/tem>) – specify whea>"r a>issgaspan"filrequiresda haluelor>not/tliro lirastrong>inPaspa/tstrong> (aem>boolean/tem>) – t id=esdifda>">paspan"fil <>by a>">plugin)/tliro lirastrong>outPaspa/tstrong> (aem>boolean/tem>) – t id=esdifda>">paspan"fil ">plugin and retrueved af"fil tslexeew ion)/tliro /uls="re class="xra class="reference internal" href="#tuli

WithPaspan"fi.addStrungPaspan"fi npan/t/tr>ame">Parametoptulield-[/tass=",daem>help = ""cl/tr,daem>d iaultValue = ""cl/tr,daem>isMandatory = Trut/t/tr,daem>inPaspa = Trut/t/tr,daem>outPaspa = False/t/tr>ame">Parametoptulield-]/tass="f
WithPaspan"fi.addStrungPaspan"fi /h3>
Addsda strung>paspan"fia/od/t">glug-in.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst le>t simple to lirastrong>npan/tatrong> ( /trstrung"rem>) – a>">npanbofda>">strung>paspan"fia/odadd/tliro lirastrong>help/tatrong> ( /trstrung"rem>) – a">ss=riptuli ofda>">paspan"fi, thetswill>beldisplayera/od/t">user/tliro lirastrong>d iaultValue/tatrong> ( /trstrung"rem>) – a>">d iault>haluela>">paspan"filshoulra/ake,a/odbela>">in"tual>haluelin a>">GUI/tliro lirastrong>isMandatory/tstrong> (aem>boolean/tem>) – specify whea>"r a>issgaspan"filrequiresda haluelor>not/tliro lirastrong>inPaspa/tstrong> (aem>boolean/tem>) – t id=esdifda>">paspan"fil <>by a>">plugin)/tliro lirastrong>outPaspa/tstrong> (aem>boolean/tem>) – t id=esdifda>">paspan"fil ">plugin and retrueved af"fil tslexeew ion)/tliro /uls="re class="xra class="reference internal" href="#tuli

WithPaspan"fi.addStrungP>opertyPaspan"fi opertyPaspan"fi/tils add existingem>npan/t/tr>ame">Parametoptulield-[/tass=",daem>help = ""cl/tr,daem>d iaultValue = ""cl/tr,daem>isMandatory = Trut/t/tr,daem>inPaspa = Trut/t/tr,daem>outPaspa = False/t/tr>ame">Parametoptulield-]/tass="f
WithPaspan"fi.addStrungP>opertyPaspan"fi /h3>
Addsda a" /> operty /h3> operty >.edge.isValid"> Parameters:StrungP>opertyciass="field-bod>paspan"fia/od/t">glug-in.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst le>t simple to lirastrong>npan/tatrong> ( /trstrung"rem>) – a>">npanbofda>">a" /> operty /h3> operty >.edge.isValid"> Parameters:StrungP>opertyciass="field-bod>paspan"fia/odadd/tliro lirastrong>help/tatrong> ( /trstrung"rem>) – a">ss=riptuli ofda>">paspan"fi, thetswill>beldisplayera/od/t">user/tliro lirastrong>d iaultValue/tatrong> ( /trstrung"rem>) – a>">d iault>haluel(in a>">eormd“<eroperty_npan>”)da>">paspan"filshoulra/ake,a/odbela>">in"tual>haluelin a>">GUI/tliro lirastrong>isMandatory/tstrong> (aem>boolean/tem>) – specify whea>"r a>issgaspan"filrequiresda haluelor>not/tliro lirastrong>inPaspa/tstrong> (aem>boolean/tem>) – t id=esdifda>">paspan"fil <>by a>">plugin)/tliro lirastrong>outPaspa/tstrong> (aem>boolean/tem>) – t id=esdifda>">paspan"fil ">plugin and retrueved af"fil tslexeew ion)/tliro /uls="re class="xra class="reference internal" href="#tuli

WithPaspan"fi.addStrungVectorP>opertyPaspan"fi opertyPaspan"fi/tils add existingem>npan/t/tr>ame">Parametoptulield-[/tass=",daem>help = ""cl/tr,daem>d iaultValue = ""cl/tr,daem>isMandatory = Trut/t/tr,daem>inPaspa = Trut/t/tr,daem>outPaspa = False/t/tr>ame">Parametoptulield-]/tass="f
WithPaspan"fi.addStrungVectorP>opertyPaspan"fi /h3>
noame">Parametve culimodi#82d >New> s ve culi 4.2.class="fi"verp>Addsda a" /> operty /h3> operty >.edge.isValid"> Parameters:StrungVectorP>opertyciass="field-bod>paspan"fia/od/t">glug-in.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst le>t simple to lirastrong>npan/tatrong> ( /trstrung"rem>) – a>">npanbofda>">a" /> operty /h3> operty >.edge.isValid"> Parameters:StrungVectorP>opertyciass="field-bod>paspan"fia/odadd/tliro lirastrong>help/tatrong> ( /trstrung"rem>) – a">ss=riptuli ofda>">paspan"fi, thetswill>beldisplayera/od/t">user/tliro lirastrong>d iaultValue/tatrong> ( /trstrung"rem>) – a>">d iault>haluel(in a>">eormd“<eroperty_npan>”)da>">paspan"filshoulra/ake,a/odbela>">in"tual>haluelin a>">GUI/tliro lirastrong>isMandatory/tstrong> (aem>boolean/tem>) – specify whea>"r a>issgaspan"filrequiresda haluelor>not/tliro lirastrong>inPaspa/tstrong> (aem>boolean/tem>) – t id=esdifda>">paspan"fil <>by a>">plugin)/tliro lirastrong>outPaspa/tstrong> (aem>boolean/tem>) – t id=esdifda>">paspan"fil ">plugin and retrueved af"fil tslexeew ion)/tliro /uls="re class="xra class="reference internal" h internal" h iiv Parametsection /lass=lp-plugin to h3Plugin/table>

Plugin to em>Parameteroperty >e.isV"/t/tr>de">field-de">
Plugin /h3>
Bases:>a" /> .edge.isValid"> Parameters:WithPaspan"ficiass="field-bodfi"verp>T> ">base>Param>eor all>T"adm>plugins.e "verref="#tuli
Plugin.audivi
Plugin.audivi /h3>
Return">audivi ofda>">plugin.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prstrung"re class="xra class="reference internal" href="#tuli

Plugin.category
Plugin.category /h3>
Return">category ofda>">plugin.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prstrung"re class="xra class="reference internal" href="#tuli

Plugin.date
Plugin.date /h3>
Return">crd>tuli date ofda>">plugin.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prstrung"re class="xra class="reference internal" href="#tuli

Plugin.group
Plugin.group /h3>
Return">group ofda>">plugin.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prstrung"re class="xra class="reference internal" href="#tuli

Plugin.info
Plugin.info /h3>
Returntuli aboutda>">plugin.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prstrung"re class="xra class="reference internal" href="#tuli

Plugin.hs.
Plugin.h. Theh3>
Return">npanbofda>">plugin.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prstrung"re class="xra class="reference internal" href="#tuli

Plugin.releas
Plugin.releas
Return">releas< numbfilofda>">plugin.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prstrung"re class="xra class="reference internal" href="#tuli

Plugin.="aetReleas
Plugin.="aetReleas
Return">T"adm>releas< numbfi.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prstrung"re class="xra class="reference internal" h internal" h iiv Parametsection /lass=lp-algorithm to h3Algorithm/table>

Algorithm to em>Parameteroperty >e.isV"/t/tr>de">field-de">
Algorithm /h3>
Bases:>a" /> Plugin t.edge.isValid"> Parameters:Plugin/iass="field-bodfi"verp>T> ss=ribesda genfiel algorithm>plugin. Basic functulielity cons3.7slin checkung>a>">algorithm>canlrun on a>">curss=t Graph (e.g.d ">graph simple ?)da>"nlrunnung>a>">algorithm. T>">algorithm>canland shoulrareport erogressland which task itd if itd a>">graph, colorung>it, ...).e "veraable> e.isV"attrubutese "verref="#tuliattrubute
Algorithm.graph
Algorithm.graph /h3>
T>">a" /> Parameters:Graph/iass="field-bod>"> will>belrun on.e "ver internal" href="#tuliattrubute
Algorithm.dataSet
Algorithm.dataSet /h3>
A>a" /> .edge.isValid"> Parameters:DataSet/iass="field-bod>containung>paspan"fim>eor "> Algorithm.pluginProgress
Algorithm.pluginProgress /h3>
A>a" /> Parameters:PluginProgress/iass="field-bod>"o give feedbacka/od/t">user. It canlbeb.edge.isValid"> Parameters: e.isV"se "verref="#tuli
Algorithm.check
Algorithm.check /h3>
T>iV"d applyung>a>">algorithm>on a>">inputsgraph. You canlpereormdsomfierseond"tuli check es>canlreimplems=t it. Must"return a tuple whose arst membfilind"catesdifda>">algorithm>canlb">applied and a>">sseondsonelcanlb">usera/oderovidedan error messagee "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if pr(boolean,>strung)"re class="xra class="reference internal" href="#tuli

Algorithm.run/pdide">
Algorithm.run//h3>
T>iV"d ">entry poeld ofda>">algorithm>w>"nlitd es>must"implems=t it. It isda gov>dpracdi"fiassreport erogresslthroughda>">PluginProgress. T>">PluginProgress shoulraalsolb">usera/odreport errors,difdany. A boolean>must"alsolb">returned /odind"catedifda>">algorithm>was successful.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prboolean/te class="xra class="reference internal" h internal" h iiv Parametsection /lass=lp-booleanalgorithm to h3BooleanAlgorithm/table>

BooleanAlgorithm to em>Parameteroperty >e.isV"/t/tr>de">field-de">
BooleanAlgorithm /h3>
Bases:>a" /> Algorithm t.edge.isValid"> Parameters:Algorithm/iass="field-bodfi"verp>T> ">base>ild-rface>eor selection>plugins.e "veraable> e.isV"attrubutese "verref="#tuliattrubute
BooleanAlgorithm.result/pdide">
BooleanAlgorithm.result//h3>
T>">result ofda>">algorithm>must"b">stor"dlin a> operty /h3> operty t.edge.isValid"> Parameters:BooleanP>operty/iass="field-bod.e "ver internal" h internal" h iiv Parametsection /lass=lp-coloralgorithm to h3ColorAlgorithm/table>
ColorAlgorithm to em>Parameteroperty >e.isV"/t/tr>de">field-de">
ColorAlgorithm /h3>
Bases:>a" /> Algorithm t.edge.isValid"> Parameters:Algorithm/iass="field-bodfi"verp>T> ">base>ild-rface>eor color>plugins.e "veraable> e.isV"attrubutese "verref="#tuliattrubute
ColorAlgorithm.result/pdide">
ColorAlgorithm.result//h3>
T>">result ofda>">algorithm>must"b">stor"dlin a> operty /h3> operty t.edge.isValid"> Parameters:ColorP>operty/iass="field-bod.e "ver internal" h internal" h iiv Parametsection /lass=lp-douerealgorithm to h3DouereAlgorithm/table>
DouereAlgorithm to em>Parameteroperty >e.isV"/t/tr>de">field-de">
DouereAlgorithm /h3>
Bases:>a" /> Algorithm t.edge.isValid"> Parameters:Algorithm/iass="field-bodfi"verp>T> ">base>ild-rface>eor metruc>plugins.e "veraable> e.isV"attrubutese "verref="#tuliattrubute
DouereAlgorithm.result/pdide">
DouereAlgorithm.result//h3>
T>">result ofda>">algorithm>must"b">stor"dlin a> operty /h3> operty >.edge.isValid"> Parameters:DouereP>operty/iass="field-bod.e "ver internal" h internal" h iiv Parametsection /lass=lp-ild-geralgorithm to h3Ild-gerAlgorithm/table>
Ild-gerAlgorithm to em>Parameteroperty >e.isV"/t/tr>de">field-de">
Ild-gerAlgorithm /h3>
Bases:>a" /> Ild-gerAlgorithm t.edge.isValid"> Parameters:Ild-gerAlgorithm/iass="field-bodfi"verp>T> ">base>ild-rface>eor ild-ger>plugins.e "veraable> e.isV"attrubutese "verref="#tuliattrubute
Ild-gerAlgorithm.result/pdide">
Ild-gerAlgorithm.result//h3>
T>">result ofda>">algorithm>must"b">stor"dlin a> operty /h3> operty >.edge.isValid"> Parameters:Ild-gerP>opertyciass="field-bod.e "ver internal" h internal" h iiv Parametsection /lass=lp-layoutalgorithm to h3LayoutAlgorithm/table>
LayoutAlgorithm to em>Parameteroperty >e.isV"/t/tr>de">field-de">
LayoutAlgorithm /h3>
Bases:>a" /> Algorithm t.edge.isValid"> Parameters:Algorithm/iass="field-bodfi"verp>T> ">base>ild-rface>eor layout>plugins.e "veraable> e.isV"attrubutese "verref="#tuliattrubute
LayoutAlgorithm.result/pdide">
LayoutAlgorithm.result//h3>
T>">result ofda>">algorithm>must"b">stor"dlin a> operty /h3> operty >.edge.isValid"> Parameters:LayoutP>opertyciass="field-bod.e "ver internal" h internal" h iiv Parametsection /lass=lp-sizealgorithm to h3SizeAlgorithm/table>
SizeAlgorithm to em>Parameteroperty >e.isV"/t/tr>de">field-de">
SizeAlgorithm /h3>
Bases:>a" /> Algorithm t.edge.isValid"> Parameters:Algorithm/iass="field-bodfi"verp>T> ">base>ild-rface>eor size>plugins.e "veraable> e.isV"attrubutese "verref="#tuliattrubute
SizeAlgorithm.result/pdide">
SizeAlgorithm.result//h3>
T>">result ofda>">algorithm>must"b">stor"dlin a> operty /h3> operty >.edge.isValid"> Parameters:SizeP>opertyciass="field-bod.e "ver internal" h iiv Parametsection /lass=lp-importmodule to h3ImportModule/table>
ImportModule to em>Parameteroperty >e.isV"/t/tr>de">field-de">
ImportModule /h3>
Bases:>a" /> Plugin t.edge.isValid"> Parameters:Plugin/iass="field-bodfi"verp>T> ss=ribesdan import>plugin.e "veraable> e.isV"attrubutese "verref="#tuliattrubute
ImportModule.graph
ImportModule.graph /h3>
An empty>a" /> Parameters:Graph/iass="field-bod>"o populatedw>"nlrunnung>a>">import>process/i"ver internal" href="#tuliattrubute
ImportModule.dataSet
ImportModule.dataSet /h3>
A>a" /> .edge.isValid"> Parameters:DataSet/iass="field-bod>containung>paspan"fim>eors"> plugin,difdany/i"ver internal" href="#tuliattrubute
ImportModule.pluginProgress
ImportModule.pluginProgress /h3>
A>a" /> Parameters:PluginProgress/iass="field-bod>"o give feedbacka/od/t">user. It canlbeb.edge.isValid"> Parameters: e.isV"se "verref="#tuli
ImportModule.importGraph
ImportModule.importGraph /h3>
T>iV"d asgraph. Derived ble> es>must"implems=t it. A boolean>must"alsolb">returned /odind"catedifda>">import>was successful.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prboolean/te class="xra class="reference internal" h internal" h iiv Parametsection /lass=lp-exportmodule to h3ExportModule/table>

ExportModule to em>Parameteroperty >e.isV"/t/tr>de">field-de">
ExportModule /h3>
Bases:>a" /> .edge.isValid"> Parameters:WithPaspan"ficiass="field-bodfi"verp>T> ss=ribesdan export>plugin.e "veraable> e.isV"attrubutese "verref="#tuliattrubute
ExportModule.graph
ExportModule.graph /h3>
T>">a" /> Parameters:Graph/iass="field-bod>"o export/i"ver internal" href="#tuliattrubute
ExportModule.dataSet
ExportModule.dataSet /h3>
A>a" /> .edge.isValid"> Parameters:DataSet/iass="field-bod>containung>paspan"fim>eors"> plugin,difdany/i"ver internal" href="#tuliattrubute
ExportModule.pluginProgress
ExportModule.pluginProgress /h3>
A>a" /> Parameters:PluginProgress/iass="field-bod>"o give feedbacka/od/t">user. It canlbeb.edge.isValid"> Parameters: e.isV"se "verref="#tuli
ExportModule.exportGraph os/t/tr>
ExportModule.exportGraph /h3>
T>iV"d a>">graph /odaaphle. Derived ble> es>must"implems=t it.fi"verp>T>e os>paspan"fil streaml(in"tualize<>by a>">T"adm>GUI orsby a>">a" /> Parameters:exportGraph()/iass="field-bod>functuli.). Tobwrite dataa/od/t">phle, you havfiassuse>a>">eollowung>syntax:e "verriv>Paramethighancht-pydivn t.riv>Paramethighancht t.ers-name">Parametc >#bwrite a>">numbfilofdnodesland edgesl/od/t">phle/iass="noame">Parametn tos/iass=" >ame">Parameto"><</iass=" >ame">Parametbs tself/iass="fame">Parameto">./iass="fame">Parametnssgraph/iass="fame">Parameto">./iass="fame">ParametnssnumbfiOfNodes/iass="fame">Paramets t()/iass=" >ame">Parameto"><</iass=" >ame">Paramets t"class="fame">ParametsParamets t"class="noame">Parametn tos/iass=" >ame">Parameto"><</iass=" >ame">Parametbs tself/iass="fame">Parameto">./iass="fame">Parametnssgraph/iass="fame">Parameto">./iass="fame">ParametnssnumbfiOfEdges/iass="fame">Paramets t()/iass=" >ame">Parameto"><</iass=" >ame">Paramets t"class="fame">ParametsParamets t"class="no/ers-n iiv A>boolean>must"alsolb">returned /odind"catedifda>">export>was successful.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>os/tatrong> ( /trstd.ostream"rem>) – an outputsphle>stream/te class="xrmaintain the subevenaph relation between graphs.) – if prboolean/te class="xra class="reference internal" h internal" h iiv Parametsection /lassgraph-test-ble> es to h2>Graph test ble> es/table>

es /h3>
Parametsection /lass=lp-selfloops to h3SelfLoops/table>
SelfLoops to em>Parameteroperty >e.isV"/t/tr>de">field-de">
SelfLoops /h3>
T>">od">SelfLoopsge.asV"reersss=tsda self loop thetshas be"nlreplace<>by awodnodesland tl ce edges. T>">da" /> AcyclicTest.makeAcyclic t.edge.isValid"> Parameters:AcyclicTest.makeAcyclic()/iass="field-bod>return It contains>a>">eollowung>variferes :e "veru are alsosimple to lirold ( " /> Parameters:edge/iass="field-bod) : a>">sslf loop edge thetshas be"nlreplace Parameters:node/iass="field-bod) : a>"> arst node added/tliro lirn2 ( " /> Parameters:node/iass="field-bod) : a>">sseondsnode added/tliro lire1 ( " /> Parameters:edge/iass="field-bod) : a>">edge added betwe"nla>">node atda>">extremity ofda>">loop and n1/tliro lire2 ( " /> Parameters:edge/iass="field-bod) : a>">edge added betwe"nln1 and n2/tliro lire3 ( " /> Parameters:edge/iass="field-bod) : a>">edge added betwe"nla>">node atda>">extremity ofda>">loop and n2/tliro /uls="rinternal" h iiv Parametsection /lass=lp-acyclictest to h3AcyclicTest/table>
AcyclicTest to em>Parameteroperty >e.isV"/t/tr>de">field-de">
AcyclicTest /h3>
AcyclicTest.acyclicTest to de">graph/i/tr>
AcyclicTest.acyclicTest eh3>
Returnind"catung>if>a>">graph inot and sseondsmembfilitmodycle (w>"nla>">graph iNew in version 3.7.

AcyclicTest.isAcyclic tdide">graph/i/tr>

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>graph/iatrong> ( " /> Parameters:Graph/iass="field-bod) – a>">graph on which tolpereormda>">acyclicltest/ie class="xrmaintain the subevenaph relation between graphs.) – if pr(boolean,> 3.7 ofd " /> Parameters:edge/iass="field-bod)"re class="xra class="reference internal" href="#tuli

AcyclicTest.isAcyclic eh3>
Return Parameters:graph i Parameters:result ">nextdcall>wiiona>">spanbgraph iNew in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>graph/iatrong> ( " /> Parameters:Graph/iass="field-bod) – a>">graph on which tolpereormda>">acyclicltest/ie class="xrmaintain the subevenaph relation between graphs.) – if prboolean/te class="xra class="reference internal" href="#tuli

AcyclicTest.makeAcyclic tdide">graph/i/tr>
AcyclicTest.makeAcyclic /h3>
Make">graph acyclic,dby>reve cung>edge direction>(feedbackaarc sst>proerem). If>a>"re inode iwhose arst membfiliNew in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>graph/iatrong> ( " /> Parameters:Graph/iass="field-bod) – a>">graph /odmake acyclic/ie class="xrmaintain the subevenaph relation between graphs.) – if pr( 3.7 ofd " /> Parameters:edge/iass="field-bod,> 3.7 ofd " /> SelfLoops t.edge.isValid"> Parameters:SelfLoops/iass="field-bod)"re class="xra class="reference internal" h internal" h iiv Parametsection /lass=lp-bieonnectedtest to h3BieonnectedTest/table>

BieonnectedTest to em>Parameteroperty >e.isV"/t/tr>de">field-de">
BieonnectedTest /h3>
BieonnectedTest.isBieonnected tdide">graph/i/tr>
BieonnectedTest.isBieonnected eh3>
Return Parameters:graph ia>">graph),d.edge.isValid"> Parameters:New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>graph/iatrong> ( " /> Parameters:Graph/iass="field-bod) – a>">graph on which tolpereormda>">bieonnected test/ie class="xrmaintain the subevenaph relation between graphs.) – if prboolean/te class="xra class="reference internal" href="#tuli

BieonnectedTest.makeBieonnected tdide">graph/i/tr>
BieonnectedTest.makeBieonnected eh3>
Ifla>">graph i">graph bieonnected. ReturnNew in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>graph/iatrong> ( " /> Parameters:Graph/iass="field-bod) – a>">graph /odmake bieonnected./ie class="xrmaintain the subevenaph relation between graphs.) – if pr 3.7 ofd " /> Parameters:edge/iass="field-bod"re class="xra class="reference internal" h internal" h iiv Parametsection /lass=lp-eonnectedtest to h3ConnectedTest/table>

ConnectedTest to em>Parameteroperty >e.isV"/t/tr>de">field-de">
ConnectedTest /h3>
ConnectedTest.computeConnectedCompons=ts graph/i/tr>
ConnectedTest.computeConnectedCompons=ts eh3>
Computes a>">ssts ofdeonnected compons=ts. ReturnNew in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>graph/iatrong> ( " /> Parameters:Graph/iass="field-bod) – a>">graph on which tolcompute a>">ssts ofdeonnected compons=ts/ie class="xrmaintain the subevenaph relation between graphs.) – if pr 3.7 ofd 3.7 ofd " /> Parameters:node/iass="field-bod/te class="xra class="reference internal" href="#tuli

ConnectedTest.isConnected tdide">graph/i/tr>
ConnectedTest.isConnected eh3>
Return Parameters:graph iundirected paion betwe"nleach paiilofdnodes),d.edge.isValid"> Parameters:New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>graph/iatrong> ( " /> Parameters:Graph/iass="field-bod) – a>">graph on which tolpereormda>">eonnected test/ie class="xrmaintain the subevenaph relation between graphs.) – if prboolean/te class="xra class="reference internal" href="#tuli

ConnectedTest.makeConnected tdide">graph/i/tr>
ConnectedTest.makeConnected eh3>
Ifla>">graph i">graph eonnected. ReturnNew in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>graph/iatrong> ( " /> Parameters:Graph/iass="field-bod) – a>">graph /odmake eonnected/ie class="xrmaintain the subevenaph relation between graphs.) – if pr 3.7 ofd " /> Parameters:edge/iass="field-bod/te class="xra class="reference internal" href="#tuli

ConnectedTest.numbfiOfConnectedCompons=ts graph/i/tr>
ConnectedTest.numbfiOfConnectedCompons=ts eh3>
Return">numbfilofdeonnected compons=tslin a>">graph.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>graph/iatrong> ( " /> Parameters:Graph/iass="field-bod) – a>">graph on which tolcompute a>">numbfilofdeonnected compons=ts/ie class="xrmaintain the subevenaph relation between graphs.) – if prild-ger"re class="xra class="reference internal" h internal" h iiv Parametsection /lass=lp-outerplanartest to h3OuterPlanarTest/table>

OuterPlanarTest to em>Parameteroperty >e.isV"/t/tr>de">field-de">
OuterPlanarTest /h3>
OuterPlanarTest.isOuterPlanar tdide">graph/i/tr>
OuterPlanarTest.isOuterPlanar eh3>
Return Parameters:graph i">plane suchl/hetsall>vertices belong>aod/t">unbounded face>ofda>">embfdding), .edge.isValid"> Parameters:New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>graph/iatrong> ( " /> Parameters:Graph/iass="field-bod) – a>">graph on which tolpereormda>">outerplanarity test/ie class="xrmaintain the subevenaph relation between graphs.) – if prboolean/te class="xra class="reference internal" h internal" h iiv Parametsection /lass=lp-planaritytest to h3PlanarityTest/table>

PlanarityTest to em>Parameteroperty >e.isV"/t/tr>de">field-de">
PlanarityTest /h3>
PlanarityTest.getObstructionsEdges graph/i/tr>
PlanarityTest.getObstructionsEdges eh3>
Return">graph planar (ie.lpart>ofda>">minoilofdK3,3lor>K5).e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>graph/iatrong> ( " /> Parameters:Graph/iass="field-bod) – a>">graph on which tolcompute a>">obstructiondedges/ie class="xrmaintain the subevenaph relation between graphs.) – if pr 3.7 ofd " /> Parameters:edge/iass="field-bod/te class="xra class="reference internal" href="#tuli

PlanarityTest.isPlanar tdide">graph/i/tr>
PlanarityTest.isPlanar eh3>
Return Parameters:graph i">graph canlbebdrawn>in suchla wayl/hetsnodedgeslcrosV"each oa>"r), .edge.isValid"> Parameters:New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>graph/iatrong> ( " /> Parameters:Graph/iass="field-bod) – a>">graph on which tolpereormda>">planarity test/ie class="xrmaintain the subevenaph relation between graphs.) – if prboolean/te class="xra class="reference internal" href="#tuli

PlanarityTest.isPlanarEmbfdding tdide">graph/i/tr>
PlanarityTest.isPlanarEmbfdding eh3>
Return Parameters:currs=t embfdding>ofda>">graph i Parameters:New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>graph/iatrong> ( " /> Parameters:Graph/iass="field-bod) – a>">graph on which tolpereormda>">planar embfdding>test/ie class="xrmaintain the subevenaph relation between graphs.) – if prboolean/te class="xra class="reference internal" href="#tuli

PlanarityTest.planarEmbfdding tdide">graph/i/tr>
PlanarityTest.planarEmbfdding eh3>
Changes a>">or">nodeslin or" embfdding>planar (a>">graph must"b">planar eors">at). Return Parameters:graph i Parameters:New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>graph/iatrong> ( " /> Parameters:Graph/iass="field-bod) – a>">graph on which tolcompute a>planar embfdding/ie class="xrmaintain the subevenaph relation between graphs.) – if prboolean/te class="xra class="reference internal" h internal" h iiv Parametsection /lass=lp-simpletest to h3SimpleTest/table>

SimpleTest to em>Parameteroperty >e.isV"/t/tr>de">field-de">
SimpleTest /h3>
SimpleTest.isSimple to de">graph/i/tr>
SimpleTest.isSimple eh3>
Return Parameters:graph inodsslf loopslor>pasplleldedges), .edge.isValid"> Parameters:New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>graph/iatrong> ( " /> Parameters:Graph/iass="field-bod) – a>">graph on which tolpereormda>">simple test/ie class="xrmaintain the subevenaph relation between graphs.) – if prboolean/te class="xra class="reference internal" href="#tuli

SimpleTest.makeSimple to de">graph/i/tr>
SimpleTest.makeSimple /h3>
Make">graph >simple by>removung>sslf loopsland pasplleldedgesdifdany. ReturnNew in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>graph/iatrong> ( " /> Parameters:Graph/iass="field-bod) – a>">graph /odmake simple/ie class="xrmaintain the subevenaph relation between graphs.) – if pr 3.7 ofd " /> Parameters:edge/iass="field-bod/te class="xra class="reference internal" href="#tuli

SimpleTest.simpleTest to de">graph/i/tr>
SimpleTest.simpleTest /h3>
Pereormsda simple testland return"> arst elems=tliind"catung>a>" result ofda>">test. T>">sseondselems=tli">"> rdselems=tliNew in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>graph/iatrong> ( " /> Parameters:Graph/iass="field-bod) – a>">graph on which tolpereormda>">simple test/ie class="xrmaintain the subevenaph relation between graphs.) – if pr(boolean,> 3.7 ofd " /> Parameters:edge/iass="field-bod,> 3.7 ofd " /> Parameters:edge/iass="field-bod)"re class="xra class="reference internal" h internal" h iiv Parametsection /lass=lp-treetest to h3TreeTest/table>

TreeTest to em>Parameteroperty >e.isV"/t/tr>de">field-de">
TreeTest /h3>
TreeTest.cleanComputedTree graph/i/tr, gem>tree/i/tr>
TreeTest.cleanComputedTree eh3>
Clean">graph fromda t ce previouslylcomputed>wiiona>"> " /> Parameters:TreeTest.computeTree()/iass="field-bod>.e "versionmodified">New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst last simple to lirastrong>graph/iatrong> ( " /> Parameters:Graph/iass="field-bod) – a>">graph tolclean>fromda t ce/tliro lirastrong>t ce/tatrong> ( " /> Parameters:Graph/iass="field-bod) – a>">t ce tolremove fromda>">graph/tliro /uls="re class="xra class="reference internal" href="#tuli

TreeTest.computeTree tdide">graph/i/tr>
TreeTest.computeTree eh3>
Computes a rooted t ce fromda>">graph. T>">algoriiomli">eollowung>:e "veru are alsosimple to lirif>a>">graph i">graph/tliro lirif>a>">graph ia>">graph it ce ofda>etsclist/iliro lirif>a>">graph i">clone./tliro /uls="sionmodified">New in version 3.7.

TreeTest.isFreeTree tdide">graph/i/tr>

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>graph/iatrong> ( " /> Parameters:Graph/iass="field-bod) – a>">graph on which tolcompute a>rooted t ce/ie class="xrmaintain the subevenaph relation between graphs.) – if pr " /> Parameters:Graph/iass="field-bod"re class="xra class="reference internal" href="#tuli

TreeTest.isFreeTree eh3>
Return Parameters:graph ia>">graph was undirected,>a>"re would be>noddycle), .edge.isValid"> Parameters:New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>graph/iatrong> ( " /> Parameters:Graph/iass="field-bod) – a>">graph on which tolpereormda>">f ce t ce test/ie class="xrmaintain the subevenaph relation between graphs.) – if prboolean/te class="xra class="reference internal" href="#tuli

TreeTest.isTree tdide">graph/i/tr>
TreeTest.isTree eh3>
Return Parameters:graph i">root), .edge.isValid"> Parameters:New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>graph/iatrong> ( " /> Parameters:Graph/iass="field-bod) – a>">graph on which tolpereormda>">t ce test/ie class="xrmaintain the subevenaph relation between graphs.) – if prboolean/te class="xra class="reference internal" href="#tuli

TreeTest.makeRootedTree tdide">graph/i/tr, gem>root/i/tr>
TreeTest.makeRootedTree /h3>
TurnNew in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prau are also arst last simple to lirastrong>graph/iatrong> ( " /> Parameters:Graph/iass="field-bod) – a>">t ce tolmake rooted/tliro lirastrong>root/iatrong> ( " /> Parameters:node/iass="field-bod) – a>">node /oddssnceate a">root ofda>">t ce/tliro /uls="re class="xra class="reference internal" h internal" h iiv Parametsection /lass=lp-trieonnectedtest to h3TrieonnectedTest/table>

TrieonnectedTest to em>Parameteroperty >e.isV"/t/tr>de">field-de">
TrieonnectedTest /h3>
TrieonnectedTest.isTrieonnected tdide">graph/i/tr>
TrieonnectedTest.isTrieonnected eh3>
Return Parameters:graph iany awodnodesl(and incids=t edges) resultslin asgraph /hetsi Parameters:New in version 3.7.

Adds existing nodes in the graph. The nodes are also added in all the graph ancestors to maintain the sub-graph relation between graphs.) – if prastrong>graph/iatrong> ( " /> Parameters:Graph/iass="field-bod) – a>">graph on which tolpereormda>">t ieonnected test/ie class="xrmaintain the subevenaph relation between graphs.) – if prboolean/te class="xra class="reference internal" h internal" h iiv Parametsidsbar td eh3 Parameters: U clity functionsp.edguls="liare alsotoct ce-l3pr " /> Graph measuresiand functionsp.edgeliro liare alsotoct ce-l3pr " /> Graph elems=ts e.isVesp.edguls="liare alsotoct ce-l3pr " /> node/iedgeliro liare alsotoct ce-l3pr " /> edge/iedgeliro /uls="rliro liare alsotoct ce-l2pr " /> "-=lp-graph-="#tu ">"th>Graph /> "-graph-structurs:ofda>">graph structurs/iedgeliro liare alsotoct ce-l3pr " /> "-sub-graphs-hifierchyd-Creatuoniand Modif"catuon>ofda>">sub-graphs hifierchy/iedgeliro liare alsotoct ce-l3pr " /> "-graph-structurs:">graph structurs/iedgeliro liare alsotoct ce-l3pr " /> "-graph-stucturs:">graph stucturs/iedgeliro liare alsotoct ce-l3pr " /> Create/Access>graph properties/iedgeliro liare alsotoct ce-l3pr " /> Appl"catuon ofdalgoriioms/iedgeliro liare alsotoct ce-l3pr " /> Vec3f/iedgeliro liare alsotoct ce-l3pr " /> Vec4f/iedgeliro liare alsotoct ce-l3pr " /> Vec4i/iedgeliro liare alsotoct ce-l3pr " /> Coord/iedgeliro liare alsotoct ce-l3pr " /> BoundungBox/iedgeliro liare alsotoct ce-l3pr " /> Size/iedgeliro liare alsotoct ce-l3pr " /> Color/iedgeliro liare alsotoct ce-l3pr " /> ColorScale/iedgeliro liare alsotoct ce-l3pr " /> St ingCollection/iedgeliro liare alsotoct ce-l3pr " /> DataSetp.edgeliro liare alsotoct ce-l3pr " /> PluginProgressp.edgeliro /uls="rliro liare alsotoct ce-l2pr " /> Evs=tp.edgeliro liare alsotoct ce-l3pr " /> GraphEvs=tp.edgeliro liare alsotoct ce-l3pr " /> PropertyEvs=tp.edgeliro liare alsotoct ce-l3pr " /> Observablep.edgeliro /uls="rliro liare alsotoct ce-l2pr " /> Graph properties e.isVesp.edguls="liare alsotoct ce-l3pr " /> PropertyIld-bface/iedgeliro liare alsotoct ce-l3pr " /> /th>BooleanProperty/iedgeliro liare alsotoct ce-l3pr " /> /th>ColorProperty/iedgeliro liare alsotoct ce-l3pr " /> /th>DoubleProperty/iedgeliro liare alsotoct ce-l3pr " /> /th>Ild-gerProperty/iedgeliro liare alsotoct ce-l3pr " /> /th>LayoutProperty/iedgeliro liare alsotoct ce-l3pr " /> /th>SizeProperty/iedgeliro liare alsotoct ce-l3pr " /> /th>St ingProperty/iedgeliro liare alsotoct ce-l3pr " /> /th>BooleanVectorProperty/iedgeliro liare alsotoct ce-l3pr " /> /th>CoordVectorProperty/iedgeliro liare alsotoct ce-l3pr " /> /th>ColorVectorProperty/iedgeliro liare alsotoct ce-l3pr " /> /th>DoubleVectorProperty/iedgeliro liare alsotoct ce-l3pr " /> /th>Ild-gerVectorProperty/iedgeliro liare alsotoct ce-l3pr " /> /th>SizeVectorProperty/iedgeliro liare alsotoct ce-l3pr " /> /th>St ingVectorProperty/iedgeliro /uls="rliro liare alsotoct ce-l2pr " /> Ty va pluginsle.isVesp.edguls="liare alsotoct ce-l3pr " /> /th>WiioPaspan"fip.edgeliro liare alsotoct ce-l3pr " /> Pluginp.edgeliro liare alsotoct ce-l3pr " /> Algoriiom/iedgeliro liare alsotoct ce-l3pr " /> BooleanAlgoriiom/iedgeliro liare alsotoct ce-l3pr " /> ColorAlgoriiom/iedgeliro liare alsotoct ce-l3pr " /> DoubleAlgoriiom/iedgeliro liare alsotoct ce-l3pr " /> Ild-gerAlgoriiom/iedgeliro liare alsotoct ce-l3pr " /> LayoutAlgoriiom/iedgeliro liare alsotoct ce-l3pr " /> SizeAlgoriiom/iedgeliro liare alsotoct ce-l3pr " /> ImportModAdd/iedgeliro liare alsotoct ce-l3pr " /> ExportModAdd/iedgeliro /uls="rliro liare alsotoct ce-l2pr " /> Graph testle.isVesp.edguls="liare alsotoct ce-l3pr " /> SslfLoopsp.edgeliro liare alsotoct ce-l3pr " /> AdyclicTest/iedgeliro liare alsotoct ce-l3pr " /> BieonnectedTest/iedgeliro liare alsotoct ce-l3pr " /> ConnectedTest/iedgeliro liare alsotoct ce-l3pr " /> OuterPlanarTest/iedgeliro liare alsotoct ce-l3pr " /> PlanarityTest/iedgeliro liare alsotoct ce-l3pr " /> SimpleTest/iedgeliro liare alsotoct ce-l3pr " /> TreeTest/iedgeliro liare alsotoct ce-l3pr " /> TrieonnectedTest/iedgeliro /uls="rliro /uls="rliro liare alsotoct ce-l1pr " /> Parameters: Parameters: Parameters:Seerch/ih3< eeormdParametseerch" actionetseerch.htmld>tbget td einput aypmodAdd,dParamdor function npan.t

Parametclearfi >e iiv < e iiv < e iiv < emiv>Parametfooter-wrapper td emiv>Parametfooter" < emiv>Parametleft td " /> previous-bod>|d " /> next-bod>|d " /> index-bodt ebrl t e" /> Show Sour"f-bodt e iiv < emiv>Parametright td emiv>Parametfooter td © Copyright 2014, Ty va Team.t Created usung e" /> Sshinx-bod>1.1.3.< e iiv < e iiv < emiv>Parametclearfi >e iiv < e iiv < e iiv <