-
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathgraph.go
77 lines (67 loc) · 2.42 KB
/
graph.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
package fixtures
import (
"errors"
"fmt"
"io"
"github.com/dominikbraun/graph"
"github.com/dominikbraun/graph/draw"
"github.com/go-rel/rel"
)
func (r Repository) importOrder() ([]string, error) {
g := graph.New(graph.StringHash, graph.Directed(), graph.PreventCycles())
// Register all tables
for name := range r.registry {
_ = g.AddVertex(name)
}
// Register all relations between tables
for name, v := range r.registry {
meta := rel.NewDocument(v).Meta()
for _, field := range meta.BelongsTo() {
fk := meta.Association(field)
if err := g.AddEdge(fk.DocumentMeta().Table(), name); errors.Is(err, graph.ErrEdgeCreatesCycle) {
r.log.Warn(fmt.Sprintf("foreign key cycle detected, skipping table %s and %s relation", name, fk.DocumentMeta().Table()))
}
}
for _, field := range meta.HasOne() {
fk := meta.Association(field)
if err := g.AddEdge(name, fk.DocumentMeta().Table()); errors.Is(err, graph.ErrEdgeCreatesCycle) {
r.log.Warn(fmt.Sprintf("foreign key cycle detected, skipping table %s and %s relation", fk.DocumentMeta().Table(), name))
}
}
for _, field := range meta.HasMany() {
fk := meta.Association(field)
if err := g.AddEdge(name, fk.DocumentMeta().Table()); errors.Is(err, graph.ErrEdgeCreatesCycle) {
r.log.Warn(fmt.Sprintf("foreign key cycle detected, skipping table %s and %s relation", fk.DocumentMeta().Table(), name))
}
}
}
return graph.TopologicalSort(g)
}
// DrawDependencies draws a graph of all tables and their relations in DOT format.
func (r Repository) DrawDependencies(w io.Writer) error {
g := graph.New(graph.StringHash, graph.Directed())
// Register all tables
for name := range r.registry {
_ = g.AddVertex(name)
}
// Register all relations between tables
for name, v := range r.registry {
meta := rel.NewDocument(v).Meta()
for _, field := range meta.BelongsTo() {
fk := meta.Association(field)
_ = g.AddEdge(name, fk.DocumentMeta().Table(), graph.EdgeAttribute("label", fk.ReferenceField()))
}
}
for name, v := range r.registry {
meta := rel.NewDocument(v).Meta()
for _, field := range meta.HasOne() {
fk := meta.Association(field)
_ = g.AddEdge(fk.DocumentMeta().Table(), name, graph.EdgeAttribute("label", fk.ForeignField()))
}
for _, field := range meta.HasMany() {
fk := meta.Association(field)
_ = g.AddEdge(fk.DocumentMeta().Table(), name, graph.EdgeAttribute("label", fk.ForeignField()))
}
}
return draw.DOT(g, w)
}