func (g *Graph) IsNeighbour(n, me int64) bool {
	if n == me {
		return false
	}
	for k, exists := range g.from[me] {
		if n == k && exists {
			return true
		}
	}
	for k, exists := range g.to[me] {
		if n == k && exists {
			return true
		}
	}
	return false
}
IsNeighbour checks if node n is a neighbour of node me
package graph
import (
	"github.com/L-F-Z/cee/utils"
)
func (g *Graph) GetNeighbours(n int64) []int64 {
	connected := make([]int64, 0)
	for k, exists := range g.from[n] {
		if exists {
			connected = append(connected, k)
		}
	}
	for k, exists := range g.to[n] {
		if exists {
			connected = append(connected, k)
		}
	}
	return connected
}