def _make_graph()

in gala/graph_manager.py [0:0]

• 12 lines of code
• 6 McCabe index (conditional complexity)

    def _make_graph(self):
        phone_book = [[] for _ in range(self.world_size)]
        for rank in range(self.world_size):
            group = phone_book[rank]
            for i in range(0, int(mlog(self.world_size - 1, 2)) + 1):
                f_peer = self._rotate_forward(rank, 2 ** i)
                if f_peer not in group:
                    group.append(f_peer)
                b_peer = self._rotate_backward(rank, 2 ** i)
                if b_peer not in group:
                    group.append(b_peer)
        return phone_book