func (g GraphN) Reverse() Graph {
	h := &GraphN{make([]uint64, len(g.g)), g.rank}
	for i := uint(0); i < g.rank; i++ {
		for j := uint(0); j < g.rank; j++ {
			if g.Has(i, j) {
				h.Add(j, i)
			}
		}
	}
	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 GraphN) Reverse() Graph {
	h := &GraphN{make([]uint64, len(g.g)), g.rank}
	for i := uint(0); i < g.rank; i++ {
		for j := uint(0); j < g.rank; j++ {
			if g.Has(i, j) {
				h.Add(j, i)
			}
		}
	}
	return h
}
func ( g GraphN ) Reverse ( ) Graph { h := & GraphN { make ( [ ] uint64 , len ( g . g ) ) , g . rank } for i := uint ( 0 ) ; i < g . rank ; i ++ { for j := uint ( 0 ) ; j < g . rank ; j ++ { if g . Has ( i , j ) { h . Add ( j , i ) } } } return h }
Reverse creates a graph with reversed edges.
Reverse creates a graph with reversed edges .