# Struct GraphMask

Holds a bitmask of graphs.

This bitmask can hold up to 32 graphs.

The bitmask can be converted to and from integers implicitly.

`GraphMask mask1 = GraphMask.FromGraphName("My Grid Graph");`

GraphMask mask2 = GraphMask.FromGraphName("My Other Grid Graph");

NNConstraint nn = NNConstraint.Walkable;

nn.graphMask = mask1 | mask2;

// Find the node closest to somePoint which is either in 'My Grid Graph' OR in 'My Other Grid Graph'

var info = AstarPath.active.GetNearest(somePoint, nn);

## Public Methods

True if this mask contains the graph with the given graph index.

## Public Static Methods

A bitmask containing the given graph.

A bitmask containing the first graph with the given name.

Combines two masks to form the intersection between them.

Combines two masks to form the union of them.

Inverts the mask.

## Public Variables

Bitmask representing the mask.

## Public Static Variables

A mask containing every graph.