gala/graph_manager.py [138:161]:
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
                if not self.is_passive(rank) and (
                   self.is_passive(f_peer) and self.is_passive(b_peer)):
                    if f_peer not in group:
                        group.append(f_peer)  # forward peer...
                    if b_peer not in group:
                        group.append(b_peer)  # then backward peer
                # create directory for passive peers
                elif self.is_passive(rank) and (
                   not (self.is_passive(f_peer) or self.is_passive(b_peer))):
                    if b_peer not in group:
                        group.append(b_peer)  # backward peer...
                    if f_peer not in group:
                        group.append(f_peer)  # then forward peer
        return phone_book

    def is_regular_graph(self): return True

    def is_bipartite_graph(self): return True

    def is_passive(self, rank=None):
        rank = self.rank if rank is None else rank
        return (rank % 2) == 0

    def is_dynamic_graph(self, graph_type=None): return True
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -



gala/graph_manager.py [200:223]:
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
                if not self.is_passive(rank) and (
                   self.is_passive(f_peer) and self.is_passive(b_peer)):
                    if f_peer not in group:
                        group.append(f_peer)  # forward peer...
                    if b_peer not in group:
                        group.append(b_peer)  # then backward peer
                # create directory for passive peers
                elif self.is_passive(rank) and (
                   not (self.is_passive(f_peer) or self.is_passive(b_peer))):
                    if b_peer not in group:
                        group.append(b_peer)  # backward peer...
                    if f_peer not in group:
                        group.append(f_peer)  # then forward peer
        return phone_book

    def is_regular_graph(self): return True

    def is_bipartite_graph(self): return True

    def is_passive(self, rank=None):
        rank = self.rank if rank is None else rank
        return (rank % 2) == 0

    def is_dynamic_graph(self, graph_type=None): return True
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -