Package datk :: Package core :: Module networks :: Class Complete_Graph

Class Complete_Graph

distalgs.Network --+
                   |
                  Complete_Graph

A Network of n Processes arranged at the vertices of a Complete undirected graph of size n.

Instance Methods

[hide private]

__init__(self, n, index_to_UID=None)
Creates a network of n disconnected Processes, with random distinct UIDs, or as specified by the index_to_UID function

source code

Inherited from distalgs.Network: __getitem__, __iter__, __len__, __repr__, add, clone, draw, index, run, state

Method Details

[hide private]

init(self, n, index_to_UID=None)
(Constructor)

source code

Creates a network of n disconnected Processes, with random distinct UIDs, or as specified by the index_to_UID function

Overrides: distalgs.Network.__init__: (inherited documentation)

Class Complete_Graph

__init__(self, n, index_to_UID=None) (Constructor)

init(self, n, index_to_UID=None)
(Constructor)