func (g Graph16) Swap(i, j uint) {
	g[i], g[j] = g[j], g[i]
	for n, node := range g {
		// Swap individual bits
		// http://graphics.stanford.edu/~seander/bithacks.html#SwappingBitsXOR
		x := (node>>i ^ node>>j) & 0x1
		g[n] = node ^ (x<<i | x<<j)
	}
}
// Swap isomorphically swaps nodes i and j.
Swap isomorphically swaps nodes i and j.
// Swap isomorphically swaps nodes i and j .
func (g Graph16) Swap(i, j uint) {
	g[i], g[j] = g[j], g[i]
	for n, node := range g {
		x := (node>>i ^ node>>j) & 0x1
		g[n] = node ^ (x<<i | x<<j)
	}
}
func ( g Graph16 ) Swap ( i , j uint ) { g [ i ] , g [ j ] = g [ j ] , g [ i ] for n , node := range g { x := ( node >> i ^ node >> j ) & 0x1 g [ n ] = node ^ ( x << i | x << j ) } }
Swap isomorphically swaps nodes i and j.
Swap isomorphically swaps nodes i and j .
// Swap individual bits // http://graphics.stanford.edu/~seander/bithacks.html#SwappingBitsXOR