class_docstr: Returns the adjacency matrix for a cluster network via .create().
  
  The graph can be made fully connected using chaining assumption when
  chain_blocks=True (default).
  
  Parameters
  -----------
  low : float (0, 1) (default=0.3)
      Lower bound for np.random.RandomState.uniform cluster values.
  
  high : float (0, 1) > low (default=0.7)
      Upper bound for np.random.RandomState.uniform vluster values.
  
  n_blocks : int (default=2)
      Number of blocks.  Returned matrix will be square with
      shape n_block_features * n_blocks.
  
  chain_blocks : bool (default=True)
      Apply random lattice structure to chain blocks together.
  
  seed : int
      Seed for np.random.RandomState seed. (default=1)
code: def __init__(self, low=0.7, high=0.7, **kwargs):
      self.low = low
      self.high = high
      super(ClusterGraph, self).__init__(**kwargs)
  
imports: from __future__ import absolute_import
  import numpy
  from .graphs import Graph
label_desc: Use image node_id 1 to create a new ClusterGraph object from inherited base classes: Graph with example: obj = ClusterGraph(low, high)