func (g *Graph8) Reverse() Graph {
	// "Hacker's Delight", Chapter 7-3
	t := g.g
	t = t&0xaa55aa55aa55aa55 |
		(t&0x00aa00aa00aa00aa)<<7 |
		(t>>7)&0x00aa00aa00aa00aa
	t = t&0xcccc3333cccc3333 |
		(t&0x0000cccc0000cccc)<<14 |
		(t>>14)&0x0000cccc0000cccc
	t = t&0xf0f0f0f00f0f0f0f |
		(t&0x00000000f0f0f0f0)<<28 |
		(t>>28)&0x00000000f0f0f0f0
	return &Graph8{t, g.rank}
}
// Reverse creates a graph with reversed edges.
Reverse creates a graph with reversed edges.
// Reverse creates a graph with reversed edges .
func (g *Graph8) Reverse() Graph {
	t := g.g
	t = t&0xaa55aa55aa55aa55 |
		(t&0x00aa00aa00aa00aa)<<7 |
		(t>>7)&0x00aa00aa00aa00aa
	t = t&0xcccc3333cccc3333 |
		(t&0x0000cccc0000cccc)<<14 |
		(t>>14)&0x0000cccc0000cccc
	t = t&0xf0f0f0f00f0f0f0f |
		(t&0x00000000f0f0f0f0)<<28 |
		(t>>28)&0x00000000f0f0f0f0
	return &Graph8{t, g.rank}
}
func ( g * Graph8 ) Reverse ( ) Graph { t := g . g t = t & 0xaa55aa55aa55aa55 | ( t & 0x00aa00aa00aa00aa ) << 7 | ( t >> 7 ) & 0x00aa00aa00aa00aa t = t & 0xcccc3333cccc3333 | ( t & 0x0000cccc0000cccc ) << 14 | ( t >> 14 ) & 0x0000cccc0000cccc t = t & 0xf0f0f0f00f0f0f0f | ( t & 0x00000000f0f0f0f0 ) << 28 | ( t >> 28 ) & 0x00000000f0f0f0f0 return & Graph8 { t , g . rank } }
Reverse creates a graph with reversed edges.
Reverse creates a graph with reversed edges .
// "Hacker's Delight", Chapter 7-3