original_docstring:  Make node a neighbor if it is not alreadly.  This is a hack, we should be allowing self to be a neighbor of self in some graphs.  This should be enforced at the level of a graph, because that is where the type of the graph would disallow it.
          
docstring: Make node a neighbor if it is not alreadly.  This is a hack, we should be allowing self to be a neighbor of self in some graphs.  This should be enforced at the level of a graph, because that is where the type of the graph would disallow it.
docstring_tokens: Make node a neighbor if it is not alreadly . This is a hack we should be allowing self to be a neighbor of self in some graphs . This should be enforced at the level of a graph because that is where the type of the graph would disallow it .
code: def add_neighbor(self, node):
          """ Make node a neighbor if it is not alreadly.  This is a hack, we should be allowing self to be a neighbor of self in some graphs.  This should be enforced at the level of a graph, because that is where the type of the graph would disallow it.
          """
          if (not node in self.neighbors) and (not self == node):
              self.neighbors.add(node)
code_tokens: def add_neighbor ( self , node ) : if ( not node in self . neighbors ) and ( not self == node ) : self . neighbors . add ( node )
short_docstring: Make node a neighbor if it is not alreadly.
short_docstring_tokens: Make node a neighbor if it is not alreadly .
comment: """ Make node a neighbor if it is not alreadly.  This is a hack, we should be allowing self to be a neighbor of self in some graphs.  This should be enforced at the level of a graph, because that is where the type of the graph would disallow it.
          """