func (g Graph16) Reverse() Graph {
	h := make(Graph16, len(g))
	for i, node := range g {
		for node != 0 {
			j := uint(bits.TrailingZeros16(node))
			h.Add(j, uint(i))
			node &^= 1 << j
		}
	}
	return h
}
// Reverse creates a graph with reversed edges.
Reverse creates a graph with reversed edges.
// Reverse creates a graph with reversed edges .
func (g Graph16) Reverse() Graph {
	h := make(Graph16, len(g))
	for i, node := range g {
		for node != 0 {
			j := uint(bits.TrailingZeros16(node))
			h.Add(j, uint(i))
			node &^= 1 << j
		}
	}
	return h
}
func ( g Graph16 ) Reverse ( ) Graph { h := make ( Graph16 , len ( g ) ) for i , node := range g { for node != 0 { j := uint ( bits . TrailingZeros16 ( node ) ) h . Add ( j , uint ( i ) ) node &^= 1 << j } } return h }
Reverse creates a graph with reversed edges.
Reverse creates a graph with reversed edges .