#NEWLINE# @ classmethod #NEWLINE# def find_goal_nodes( cls , items ) : #NEWLINE# #INDENT# "return the set of all nodes that aren't depended on" #NEWLINE# graph = cls . graph_from_items ( dependencies ) #NEWLINE# ( start_nodes , dependencies ) = zip ( * list ( digraphtools . iter_edges ( graph ) ) ) #NEWLINE# return set ( start_nodes ) . difference ( dependencies )