# netket.graph.Edgeless¶

class netket.graph.Edgeless

A set graph (collection of unconnected vertices).

__init__(self: netket._C_netket.graph.Edgeless, n_vertices: int) → None

Constructs a new set of given number of vertices.

Parameters

n_vertices – The number of vertices.

Examples

A 10-site set:

>>> import netket
>>> g=netket.graph.Edgeless(10)
>>> print(g.n_sites)
10


Methods

 __init__(self, n_vertices) Constructs a new set of given number of vertices.

Attributes

 adjacency_list The adjacency list of the graph where each node is represented by an integer in [0, n_sites). automorphisms The automorphisms of the graph, including translation symmetries only. distances The distances between the nodes. edges The graph edges. is_bipartite Whether the graph is bipartite. is_connected Whether the graph is connected. n_sites The number of vertices in the graph.
property adjacency_list

The adjacency list of the graph where each node is represented by an integer in [0, n_sites).

Type

list

property automorphisms

The automorphisms of the graph, including translation symmetries only.

Type

list[list]

property distances

The distances between the nodes. The fact that some node may not be reachable from another is represented by -1.

Type

list[list]

property edges

The graph edges.

Type

list

property is_bipartite

Whether the graph is bipartite.

Type

bool

property is_connected

Whether the graph is connected.

Type

bool

property n_sites

The number of vertices in the graph.

Type

int