-
Notifications
You must be signed in to change notification settings - Fork 0
/
8.go
84 lines (74 loc) · 1.51 KB
/
8.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
package dfs
import (
"fmt"
"log"
)
type ComponentConnectivity struct {
N, M int
graph [][]int
}
func (cc *ComponentConnectivity) inputFunc() {
inputNumber := func() int {
var number int
_, err := fmt.Scan(&number)
if err != nil {
log.Fatal(err)
}
return number
}
inputArr := func(lenArr int) []int {
var arr = make([]int, lenArr)
for i := 0; i < len(arr); i++ {
_, err := fmt.Scan(&arr[i])
if err != nil {
log.Fatal(err)
}
}
return arr
}
cc.N, cc.M = inputNumber(), inputNumber()
cc.graph = make([][]int, cc.N+1)
for i := 0; i < cc.M; i++ {
arr := inputArr(2)
i, j := arr[0], arr[1]
cc.graph[i] = append(cc.graph[i], j)
cc.graph[j] = append(cc.graph[j], i)
}
}
func (cc *ComponentConnectivity) process() {
var level []int
connectivity := make([][]int, 0)
visited := make([]interface{}, cc.N+1)
var dfs func(int)
dfs = func(node int) {
visited[node] = struct{}{}
level = append(level, node)
for _, next := range cc.graph[node] {
if visited[next] == nil {
dfs(next)
}
}
}
for start := 1; start <= cc.N; start++ {
if visited[start] == nil {
level = make([]int, 0)
dfs(start)
if len(level) != 0 {
connectivity = append(connectivity, level)
}
}
}
fmt.Println(len(connectivity))
for _, con := range connectivity {
fmt.Println(len(con))
for _, node := range con {
fmt.Print(node, " ")
}
fmt.Println()
}
}
func ComponentConnectivitySolution() {
solution := &ComponentConnectivity{}
solution.inputFunc()
solution.process()
}