func (g Graph16) InDegree(i uint) int {
	d := 0
	for j := 0; j < len(g); j++ {
		d += int((g[j] >> i) & 0x1)
	}
	return d
}
// InDegree returns the number of edges directed to the given node.
InDegree returns the number of edges directed to the given node.
// InDegree returns the number of edges directed to the given node .
func (g Graph16) InDegree(i uint) int {
	d := 0
	for j := 0; j < len(g); j++ {
		d += int((g[j] >> i) & 0x1)
	}
	return d
}
func ( g Graph16 ) InDegree ( i uint ) int { d := 0 for j := 0 ; j < len ( g ) ; j ++ { d += int ( ( g [ j ] >> i ) & 0x1 ) } return d }
InDegree returns the number of edges directed to the given node.
InDegree returns the number of edges directed to the given node .