. We define the neighbor graph of binary self-orthogonal codes, where two codes are connected by an edge if they can be reached by the neighbor construction. We show that this graph consists of two connected, regular ...