@@ -560,7 +560,7 @@ def duplicateNodes(self, srcNodes):
560560
561561 # re-create edges taking into account what has been duplicated
562562 for attr , linkExpression in duplicateEdges .items ():
563- # logging.warning("attr={} linkExpression={}".format(attr.fullName , linkExpression))
563+ # logging.warning("attr={} linkExpression={}".format(attr.rootName , linkExpression))
564564 link = linkExpression [1 :- 1 ] # remove starting '{' and trailing '}'
565565 # get source node and attribute name
566566 edgeSrcNodeName , edgeSrcAttrName = link .split ("." , 1 )
@@ -594,12 +594,12 @@ def removeNode(self, nodeName):
594594 Remove the node identified by 'nodeName' from the graph.
595595 Returns:
596596 - a dictionary containing the incoming edges removed by this operation:
597- {dstAttr.getFullNameToNode() , srcAttr.getFullNameToNode() }
597+ {dstAttr.fullName , srcAttr.fullName }
598598 - a dictionary containing the outgoing edges removed by this operation:
599- {dstAttr.getFullNameToNode() , srcAttr.getFullNameToNode() }
599+ {dstAttr.fullName , srcAttr.fullName }
600600 - a dictionary containing the values, indices and keys of attributes that were connected to a ListAttribute
601601 prior to the removal of all edges:
602- {dstAttr.getFullNameToNode() , (dstAttr.root.getFullNameToNode() , dstAttr.index, dstAttr.value)}
602+ {dstAttr.fullName , (dstAttr.root.fullName , dstAttr.index, dstAttr.value)}
603603 """
604604 node = self .node (nodeName )
605605 inEdges = {}
@@ -614,13 +614,13 @@ def removeNode(self, nodeName):
614614 # - once we have collected all the information, the edges (and perhaps the entries in ListAttributes) can
615615 # actually be removed
616616 for edge in self .nodeOutEdges (node ):
617- outEdges [edge .dst .getFullNameToNode () ] = edge .src .getFullNameToNode ()
617+ outEdges [edge .dst .fullName ] = edge .src .fullName
618618
619619 if isinstance (edge .dst .root , ListAttribute ):
620620 index = edge .dst .root .index (edge .dst )
621- outListAttributes [edge .dst .getFullNameToNode () ] = (edge .dst .root .getFullNameToNode () ,
622- index , edge .dst .value
623- if edge .dst .value else None )
621+ outListAttributes [edge .dst .fullName ] = (edge .dst .root .fullName ,
622+ index , edge .dst .value
623+ if edge .dst .value else None )
624624
625625 for edge in self .nodeOutEdges (node ):
626626 self .removeEdge (edge .dst )
@@ -632,7 +632,7 @@ def removeNode(self, nodeName):
632632
633633 for edge in self .nodeInEdges (node ):
634634 self .removeEdge (edge .dst )
635- inEdges [edge .dst .getFullNameToNode () ] = edge .src .getFullNameToNode ()
635+ inEdges [edge .dst .fullName ] = edge .src .fullName
636636
637637 node .alive = False
638638 self ._nodes .remove (node )
@@ -698,12 +698,12 @@ def upgradeNode(self, nodeName) -> Node:
698698 Returns:
699699 - the upgraded (newly created) node
700700 - a dictionary containing the incoming edges removed by this operation:
701- {dstAttr.getFullNameToNode() , srcAttr.getFullNameToNode() }
701+ {dstAttr.fullName , srcAttr.fullName }
702702 - a dictionary containing the outgoing edges removed by this operation:
703- {dstAttr.getFullNameToNode() , srcAttr.getFullNameToNode() }
703+ {dstAttr.fullName , srcAttr.fullName }
704704 - a dictionary containing the values, indices and keys of attributes that were connected to a ListAttribute
705705 prior to the removal of all edges:
706- {dstAttr.getFullNameToNode() , (dstAttr.root.getFullNameToNode() , dstAttr.index, dstAttr.value)}
706+ {dstAttr.fullName , (dstAttr.root.fullName , dstAttr.index, dstAttr.value)}
707707 """
708708 node = self .node (nodeName )
709709 if not isinstance (node , CompatibilityNode ):
@@ -730,10 +730,10 @@ def _restoreOutEdges(self, outEdges: dict[str, str], outListAttributes):
730730
731731 Args:
732732 outEdges: a dictionary containing the outgoing edges removed by a call to "removeNode".
733- {dstAttr.getFullNameToNode() , srcAttr.getFullNameToNode() }
733+ {dstAttr.fullName , srcAttr.fullName }
734734 outListAttributes: a dictionary containing the values, indices and keys of attributes that were connected
735735 to a ListAttribute prior to the removal of all edges.
736- {dstAttr.getFullNameToNode() , (dstAttr.root.getFullNameToNode() , dstAttr.index, dstAttr.value)}
736+ {dstAttr.fullName , (dstAttr.root.fullName , dstAttr.index, dstAttr.value)}
737737 """
738738 def _recreateTargetListAttributeChildren (listAttrName : str , index : int , value : Any ):
739739 listAttr = self .attribute (listAttrName )
@@ -899,13 +899,13 @@ def addEdge(self, srcAttr, dstAttr):
899899 if srcAttr .node .graph != self or dstAttr .node .graph != self :
900900 raise RuntimeError ('The attributes of the edge should be part of a common graph.' )
901901 if dstAttr in self .edges .keys ():
902- raise RuntimeError (f'Destination attribute "{ dstAttr .getFullNameToNode () } " is already connected.' )
902+ raise RuntimeError (f'Destination attribute "{ dstAttr .fullName } " is already connected.' )
903903 edge = Edge (srcAttr , dstAttr )
904904 self .edges .add (edge )
905905 self .markNodesDirty (dstAttr .node )
906906 dstAttr .valueChanged .emit ()
907- dstAttr .isLinkChanged .emit ()
908- srcAttr .hasOutputConnectionsChanged .emit ()
907+ dstAttr .inputLinksChanged .emit ()
908+ srcAttr .outputLinksChanged .emit ()
909909 return edge
910910
911911 def addEdges (self , * edges ):
@@ -916,12 +916,12 @@ def addEdges(self, *edges):
916916 @changeTopology
917917 def removeEdge (self , dstAttr ):
918918 if dstAttr not in self .edges .keys ():
919- raise RuntimeError (f'Attribute "{ dstAttr .getFullNameToNode () } " is not connected' )
919+ raise RuntimeError (f'Attribute "{ dstAttr .fullName } " is not connected' )
920920 edge = self .edges .pop (dstAttr )
921921 self .markNodesDirty (dstAttr .node )
922922 dstAttr .valueChanged .emit ()
923- dstAttr .isLinkChanged .emit ()
924- edge .src .hasOutputConnectionsChanged .emit ()
923+ dstAttr .inputLinksChanged .emit ()
924+ edge .src .outputLinksChanged .emit ()
925925
926926 def getDepth (self , node , minimal = False ):
927927 """ Return node's depth in this Graph.
@@ -1242,7 +1242,7 @@ def getEdges(self, dependenciesOnly=False):
12421242 attr = e .src
12431243 if dependenciesOnly :
12441244 if attr .isLink :
1245- attr = attr .getLinkParam ( recursive = True )
1245+ attr = attr .inputRootLink
12461246 if not attr .isOutput :
12471247 continue
12481248 newE = Edge (attr , e .dst )
0 commit comments