netket.graph

lorem ipsum

Abstract Classes

Below you find a list of all public classes defined in this module.

AbstractGraph

Abstract class for NetKet graph objects.

Concrete Classes

Below you find a list of all concrete classes that you can use.

Graph	A simple implementation of Graph based on an external graph library.
Lattice	A lattice built by periodic arrangement of a given unit cell.
Edgeless	Construct a set graph (collection of unconnected vertices).
Hypercube	Constructs a hypercubic lattice with equal side length in all dimensions.
lattice.LatticeSite	Contains information about a single Lattice site.
Grid	Constructs a hypercubic lattice given its extent in all dimensions.

Pre-built Lattices

Diamond	Constructs a diamond lattice of a given spatial extent.
Kagome	Constructs a kagome lattice of a given spatial extent.
Square	Constructs a square lattice of side length Periodic boundary conditions can also be imposed
Chain	Constructs a chain of length sites.
Cube	Constructs a cubic lattice of side length Periodic boundary conditions can also be imposed
BCC	Constructs a BCC lattice of a given spatial extent.
FCC	Constructs an FCC lattice of a given spatial extent.
Honeycomb	Constructs a honeycomb lattice of a given spatial extent.
KitaevHoneycomb	Constructs a honeycomb lattice of a given spatial extent.
Triangular	Constructs a triangular lattice of a given spatial extent.
Pyrochlore	Constructs a pyrochlore lattice of a given spatial extent.

Additional functions

DoubledGraph(graph)	Constructs a DoubledGraph representing the doubled hilbert space of a density operator.
disjoint_union(graph_1, graph_2)	Returns the disjoint union of two graphs.