netket.graph#
lorem ipsum
Abstract Classes#
Below you find a list of all public classes defined in this module.
Abstract class for NetKet graph objects. |
Concrete Classes#
Below you find a list of all concrete classes that you can use.
A simple implementation of Graph based on an external graph library. |
|
A lattice built by periodic arrangement of a given unit cell. |
|
Construct a set graph (collection of unconnected vertices). |
|
Constructs a hypercubic lattice with equal side length in all dimensions. |
|
Contains information about a single |
|
Constructs a hypercubic lattice given its extent in all dimensions. |
Pre-built Lattices#
Constructs a diamond lattice of a given spatial extent. |
|
Constructs a kagome lattice of a given spatial extent. |
|
Constructs a square lattice of side length Periodic boundary conditions can also be imposed |
|
Constructs a chain of length sites. |
|
Constructs a cubic lattice of side length Periodic boundary conditions can also be imposed |
|
Constructs a BCC lattice of a given spatial extent. |
|
Constructs an FCC lattice of a given spatial extent. |
|
Constructs a honeycomb lattice of a given spatial extent. |
|
Constructs a honeycomb lattice of a given spatial extent. |
|
Constructs a triangular lattice of a given spatial extent. |
|
Constructs a pyrochlore lattice of a given spatial extent. |
Additional functions#
|
Constructs a DoubledGraph representing the doubled hilbert space of a density operator. |
|
Returns the ordered disjoint union of the input graphs. |