LeetCode-Go/leetcode/1579.Remove-Max-Number-of-Edges-to-Keep-Graph-Fully-Traversable/1579. Remove Max Number of Edges to Keep Graph Fully Traversable_test.go

package leetcode

import (
	"fmt"
	"testing"
)

type question1579 struct {
	para1579
	ans1579
}

// para 是参数
// one 代表第一个参数
type para1579 struct {
	n     int
	edges [][]int
}

// ans 是答案
// one 代表第一个答案
type ans1579 struct {
	one int
}

func Test_Problem1579(t *testing.T) {

	qs := []question1579{

		{
			para1579{4, [][]int{{3, 1, 2}, {3, 2, 3}, {1, 1, 3}, {1, 2, 4}, {1, 1, 2}, {2, 3, 4}}},
			ans1579{2},
		},

		{
			para1579{4, [][]int{{3, 1, 2}, {3, 2, 3}, {1, 1, 4}, {2, 1, 4}}},
			ans1579{0},
		},

		{
			para1579{4, [][]int{{3, 2, 3}, {1, 1, 2}, {2, 3, 4}}},
			ans1579{-1},
		},
	}

	fmt.Printf("------------------------Leetcode Problem 1579------------------------\n")

	for _, q := range qs {
		_, p := q.ans1579, q.para1579
		fmt.Printf("【input】:%v      【output】:%v      \n", p, maxNumEdgesToRemove(p.n, p.edges))
	}
	fmt.Printf("\n\n\n")
}