Python Graphlib Module add(node,*predecessors)














































Python Graphlib Module add(node,*predecessors)



      

add(node, *predecessors):

This method is used to add a new node and its   predecessors to the graph.(both the node and all elements  are hashable).
example:
 add(5,2) - adds a new node of value 5 and its   predecessors 2 to the graph.

 add(10,2,1) - adds a new node of value 10 and its   predecessors 2,1 to the graph.

->If add method is called multiple times with same node argument ,the

 set of dependencies will be the union of dependencies passed in .

example:


 add(5,1,2)


 add(5,6,7)


   the set of dependencies for a node 5 is {1,2,6,7}


->we can add a node with no dependencies(predecessors  are not     provided).


 example: add(10)-it simply adds a node of value 10 with no 

 predecessors.


->If we mention a new node (which is not included before in the 

  graph)among the predecessors, the new node will be added to the

 graph with no predecessors of its own.


 example : add(3,4)-here 4 is new node mentioned among the 

  predecessors, then it will added to the graph.


Note:if you call add(node, *predecessors) after prepare() ,it raises valueerror.







More Articles of Lokesh sai arjun Keerthi:

Name Views Likes
Python Graphlib Module done(*nodes) 240 1
Python Graphlib Module get_ready( ) 244 4
Python Graphlib module static_order( )-2 295 1
Python Graphlib module static_order( ) 300 1
Python Graphlib Module is_active( ) 249 4
Python Graphlib Module prepare() 253 2
Python Graphlib Module add(node,*predecessors) 260 1
Python Graphlib Module TopologicalSorter class 266 1
Python Graphlib Module Topological Sorting 321 0
Python Graphlib Module - Types of Graphs 233 1
Python Graplib Module Prerequisites 250 1
Python Graphlib Module Introduction 445 0
PRINTING HEART SHAPED SYMBOL USING ASTERIK IN C++ 505 4

Comments