netket.graph.disjoint_union

Contents

netket.graph.disjoint_union#

class netket.graph.disjoint_union[source]#

Bases:

Returns the ordered disjoint union of the input graphs.

The ordering of the nodes is the same as the input order, so if the I-th input graph has \(n_i\) nodes, the first [0, n_1[ nodes will correspond to the first graph, the nodes between \([n_1, n_1+n2[\) will correspond to the second graph, and so on and so forth.

Parameters:

*graphs (tuple[Graph, ...]) – A variable number of NetKet graphs (or lattices).

Return type:

Graph

Output:

A NetKet Graph object.

Contents