dfsでcycle detectしようとしたやつのメモ書き

dfs.go

package undirected

type Graph struct {
	n, m       int
	head, next []int
	src, dst   []int
}

func NewGraph(n int) *Graph {
	h := make([]int, n)
	for i := range h {
		h[i] = -1
	}

	g := &Graph{
		n:    n,
		m:    0,
		head: h,
		next: make([]int, n),
		src:  []int{},
		dst:  []int{},
	}
	return g
}

func (g *Graph) AddEdge(u, v int) {
	g.next = append(g.next, g.head[u])
	g.head[u] = g.m
	g.src = append(g.src, u)
	g.dst = append(g.dst, v)
	g.m++
}

func (g *Graph) ExistsCycleByDFS() bool {

	return false
}