forked from openshift/origin
/
main.go
75 lines (62 loc) · 1.16 KB
/
main.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
package main
import (
"fmt"
"github.com/gonum/graph"
"github.com/gonum/graph/search"
)
func main() {
// graph G {
G := NewGraphNode(0)
// e
e := NewGraphNode(1)
// subgraph clusterA {
clusterA := NewGraphNode(2)
// a -- b
a := NewGraphNode(3)
b := NewGraphNode(4)
a.AddNeighbor(b)
b.AddNeighbor(a)
clusterA.AddRoot(a)
clusterA.AddRoot(b)
// subgraph clusterC {
clusterC := NewGraphNode(5)
// C -- D
C := NewGraphNode(6)
D := NewGraphNode(7)
C.AddNeighbor(D)
D.AddNeighbor(C)
clusterC.AddRoot(C)
clusterC.AddRoot(D)
// }
clusterA.AddRoot(clusterC)
// }
// subgraph clusterB {
clusterB := NewGraphNode(8)
// d -- f
d := NewGraphNode(9)
f := NewGraphNode(10)
d.AddNeighbor(f)
f.AddNeighbor(d)
clusterB.AddRoot(d)
clusterB.AddRoot(f)
// }
// d -- D
d.AddNeighbor(D)
D.AddNeighbor(d)
// e -- clusterB
e.AddNeighbor(clusterB)
clusterB.AddNeighbor(e)
// clusterC -- clusterB
clusterC.AddNeighbor(clusterB)
clusterB.AddNeighbor(clusterC)
G.AddRoot(e)
G.AddRoot(clusterA)
G.AddRoot(clusterB)
// }
path := []graph.Node{C, D, d, f}
if !search.IsPath(path, G) {
fmt.Println("Not working!")
} else {
fmt.Println("Working!")
}
}