python code

def children (self, node): Returns a list of all nodes attached to the node provided # FIXME: What happens if the node is n t in the graph? return self.edges [node] def dettachedNodes (self) Returns a list of nodes have no edges # TODO : Implement this t search the graph t find nodes with n return t edges # CHALLENGE: Can you make i t for a directional graph to return nodes that have no edges CoMING IN and leaving def st (self) finalstring"" for n in self.nodes finalstring - str (n) + "-+str (self.edges [n]) + "In" return finalString def children (self, node): Returns a list of all nodes attached to the node provided # FIXME: What happens if the node is n t in the graph? return self.edges [node] def dettachedNodes (self) Returns a list of nodes have no edges # TODO : Implement this t search the graph t find nodes with n return t edges # CHALLENGE: Can you make i t for a directional graph to return nodes that have no edges CoMING IN and leaving def st (self) finalstring"" for n in self.nodes finalstring - str (n) + "-+str (self.edges [n]) + "In" return finalString