-
Notifications
You must be signed in to change notification settings - Fork 0
/
graph.ts
175 lines (156 loc) · 5.17 KB
/
graph.ts
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
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
import { Span, SpannedError } from "./spans.ts"
import { assert_array_eq } from "./utils.ts"
class RefGraph {
def: string
dict: Record<string, Set<string>>
defRelativePosition: Record<string, number>
spans: Record<string, Span>
unincludeables: Set<string>
constructor() {
this.def = ""
this.unincludeables = new Set()
this.spans = {}
this.defRelativePosition = {}
this.dict = {}
}
register(v: string, n: number) {
this.defRelativePosition[v] = n
}
withNoneOf<A, B>(defs: Set<string>, a: A, f: (_1: A, _2: RefGraph) => B): B {
for(const def of defs) this.unincludeables.add(def)
const res = f(a, this)
for(const def of defs) this.unincludeables.delete(def)
return res
}
addEdge(v: string, span: Span) {
this.spans[v] = span
if(this.unincludeables.has(v)) return
if(this.dict.hasOwnProperty(this.def)) this.dict[this.def].add(v)
else this.dict[this.def] = new Set([v])
}
makeEdge(k: string, v: string, span: Span) {
this.spans[v] = span
if(this.dict.hasOwnProperty(k)) this.dict[k].add(v)
else this.dict[k] = new Set([v])
}
runFromDef<A, B>(currentDef: string, span: Span, a: A, f: (_1: A, _2: RefGraph) => B): B {
this.spans[currentDef] = span
const oldDef = this.def
this.def = currentDef
const res = f(a, this)
this.def = oldDef
return res
}
ensureAcyclic() {
const self = this
const err = (cycle: Set<string>, currPoint: string) => {
const cyclePoints: string[] = []
let startAdding = false
for(const cyclePoint of cycle) {
if(cyclePoint == currPoint) startAdding = true
if(startAdding) cyclePoints.push(cyclePoint)
}
return `${cyclePoints.join(" -> ")} -> ${currPoint}`
}
function go(point: string, visiting: Set<string>) {
var points = self.dict[point]
if(points == null || points == undefined) return
for(const newPoint of points) {
if(visiting.has(newPoint)) {
throw SpannedError.newN(
[[`${err(visiting, newPoint)} is a cycle`, self.spans[newPoint]] as [string, Span]].concat(
[...visiting].map((str): [string, Span] => [``, self.spans[str]])
)
)
}
visiting.add(newPoint);
go(newPoint, visiting);
visiting.delete(newPoint);
}
}
for(const point in this.dict) {
go(point, new Set())
}
}
ensureDefinitions() {
for(const k in this.dict) {
const vs = this.dict[k]
const pos = this.defRelativePosition[k]
for(const v of vs) {
if (this.defRelativePosition[v] == null || this.defRelativePosition[v] == undefined) SpannedError.new1(
`Undefined variable '${v}'`,
this.spans[v]
)
if (this.defRelativePosition[v] > pos) throw SpannedError.new2(
`'${v}' is referenced in ${k} before definition`,
this.spans[k],
"\nwhich is found here",
this.spans[v]
)
}
}
}
topologicalSort() {
const self = this
function go(start: string, path: Set<string>, order: Set<string>): Set<string> {
path.add(start)
if(self.dict[start] != undefined) {
for(const edge of self.dict[start]) {
if(!(path.has(edge))) go(edge, path, order)
}
}
order.add(start)
return path
}
const order = new Set<string>()
for(const vertex in this.dict) {
const edges = this.dict[vertex]
if(!(order.has(vertex))) go(vertex, new Set(), order)
for(const edge of edges) {
go(edge, new Set(), order)
}
}
return order
}
}
const test1 = () => {
const graph = new RefGraph()
graph.dict = {
"a": new Set(["b", "c"]),
"b": new Set(["d", "c"]),
"d": new Set(["c"]),
"c": new Set([])
}
try {
graph.ensureAcyclic()
} catch {
throw "Failed Test: test1 graph should be acyclic"
}
}
const test2 = () => {
const graph = new RefGraph()
graph.dict = {
"a": new Set(["b", "c"]),
"b": new Set(["d", "c"]),
"d": new Set(["c"]),
"c": new Set(["a"])
}
try {
graph.ensureAcyclic()
} catch {return}
throw `Test Failed: test2 should contain cycles`
}
const test3 = () => {
const graph = new RefGraph()
graph.dict = {
"b": new Set(["d", "e"]),
"d": new Set([]),
"a": new Set(["b", "c", "d"]),
"c": new Set(["b", "d"]),
"e": new Set()
}
const order = graph.topologicalSort()
assert_array_eq([...order], ["d", "e", "b", "c", "a"])
}
const tests = [test1, test2, test3]
export { RefGraph, tests }