mfocko/blog
1
0
Fork 0
mirror of https://github.com/mfocko/blog.git synced 2025-05-04 10:22:58 +02:00
Code Issues Projects Releases Packages Wiki Activity Actions

feat: don't reference FI MU subjects by their codes

Browse source 
Signed-off-by: Matej Focko <mfocko@redhat.com>
This commit is contained in:
Matej Focko 2023-11-24 16:00:45 +01:00
parent f81d3219e6
commit e1dea0cdbc
Signed by: mfocko
GPG key ID: 7C47D46246790496
232 changed files with 225 additions and 191 deletions

47
static/files/algorithms/rb-trees/rules/rb.dot Normal file
View file

@ -0,0 +1,47 @@
digraph {
"Node(value=3, rank=2)" [label="3"]; #done
"Node(value=1, rank=1)" [label="1"]; #done
"Node(value=4, rank=0)" [label="4"]; #done
"Node(value=7, rank=1)" [label="7", color="red"]; #done
"Node(value=0, rank=0)" [label="0"]; #done
"Node(value=2, rank=0)" [label="2"]; #done
"Node(value=5, rank=1)" [label="5"]; #done
"Node(value=6, rank=0)" [label="6"]; #done
"Node(value=8, rank=0)" [label="8"]; #done
"nil1" [label="nil"]
"nil2" [label="nil"]
"nil3" [label="nil"]
"nil4" [label="nil"]
"nil5" [label="nil"]
"nil6" [label="nil"]
"nil7" [label="nil"]
"nil8" [label="nil"]
"nil9" [label="nil"]
"nil10" [label="nil"]
"nil11" [label="nil"]
"Node(value=9, rank=0)" [label="9", color="red"]; #done
"Node(value=3, rank=2)" -> "Node(value=1, rank=1)" #done
"Node(value=1, rank=1)" -> "Node(value=0, rank=0)" #done
"Node(value=1, rank=1)" -> "Node(value=2, rank=0)" #done
"Node(value=3, rank=2)" -> "Node(value=5, rank=1)" #done
"Node(value=5, rank=1)" -> "Node(value=4, rank=0)" #done
"Node(value=5, rank=1)" -> "Node(value=7, rank=1)" [color="red"] #done
"Node(value=7, rank=1)" -> "Node(value=6, rank=0)" #done
"Node(value=7, rank=1)" -> "Node(value=8, rank=0)" #done
"Node(value=8, rank=0)" -> "nil1"
"Node(value=8, rank=0)" -> "Node(value=9, rank=0)" [color="red"] #done
"Node(value=0, rank=0)" -> "nil2"
"Node(value=0, rank=0)" -> "nil3"
"Node(value=2, rank=0)" -> "nil4"
"Node(value=2, rank=0)" -> "nil5"
"Node(value=4, rank=0)" -> "nil6"
"Node(value=4, rank=0)" -> "nil7"
"Node(value=6, rank=0)" -> "nil8"
"Node(value=6, rank=0)" -> "nil9"
"Node(value=9, rank=0)" -> "nil10"
"Node(value=9, rank=0)" -> "nil11"
}

47
static/files/algorithms/rb-trees/rules/rb_height.dot Normal file
View file

@ -0,0 +1,47 @@
digraph {
"Node(value=3, rank=2)" [label="3⁽³⁾"]; #done
"Node(value=1, rank=1)" [label="1⁽²⁾"]; #done
"Node(value=4, rank=0)" [label="4⁽¹⁾"]; #done
"Node(value=7, rank=1)" [label="7⁽²⁾", color="red"]; #done
"Node(value=0, rank=0)" [label="0⁽¹⁾"]; #done
"Node(value=2, rank=0)" [label="2⁽¹⁾"]; #done
"Node(value=5, rank=1)" [label="5⁽²⁾"]; #done
"Node(value=6, rank=0)" [label="6⁽¹⁾"]; #done
"Node(value=8, rank=0)" [label="8⁽¹⁾"]; #done
"nil1" [label="nil"]
"nil2" [label="nil"]
"nil3" [label="nil"]
"nil4" [label="nil"]
"nil5" [label="nil"]
"nil6" [label="nil"]
"nil7" [label="nil"]
"nil8" [label="nil"]
"nil9" [label="nil"]
"nil10" [label="nil"]
"nil11" [label="nil"]
"Node(value=9, rank=0)" [label="9⁽¹⁾", color="red"]; #done
"Node(value=3, rank=2)" -> "Node(value=1, rank=1)" #done
"Node(value=1, rank=1)" -> "Node(value=0, rank=0)" #done
"Node(value=1, rank=1)" -> "Node(value=2, rank=0)" #done
"Node(value=3, rank=2)" -> "Node(value=5, rank=1)" #done
"Node(value=5, rank=1)" -> "Node(value=4, rank=0)" #done
"Node(value=5, rank=1)" -> "Node(value=7, rank=1)" [color="red"] #done
"Node(value=7, rank=1)" -> "Node(value=6, rank=0)" #done
"Node(value=7, rank=1)" -> "Node(value=8, rank=0)" #done
"Node(value=8, rank=0)" -> "nil1"
"Node(value=8, rank=0)" -> "Node(value=9, rank=0)" [color="red"] #done
"Node(value=0, rank=0)" -> "nil2"
"Node(value=0, rank=0)" -> "nil3"
"Node(value=2, rank=0)" -> "nil4"
"Node(value=2, rank=0)" -> "nil5"
"Node(value=4, rank=0)" -> "nil6"
"Node(value=4, rank=0)" -> "nil7"
"Node(value=6, rank=0)" -> "nil8"
"Node(value=6, rank=0)" -> "nil9"
"Node(value=9, rank=0)" -> "nil10"
"Node(value=9, rank=0)" -> "nil11"
}

34
static/files/algorithms/rb-trees/rules/red-node-black-children/correct.dot Normal file
View file

@ -0,0 +1,34 @@
digraph {
"Node(value=3, rank=2)" [label="3"]; #done
"Node(value=1, rank=1)" [label="1", color="red"]; #done
"Node(value=4, rank=0)" [label="4", color="red"]; #done
"Node(value=7, rank=0)" [label="7", color="red"]; #done
"Node(value=0, rank=0)" [label="0"]; #done
"Node(value=2, rank=0)" [label="2"]; #done
"Node(value=5, rank=1)" [label="5"]; #done
"nil2" [label="", color=none]
"nil3" [label="", color=none]
"nil4" [label="", color=none]
"nil5" [label="", color=none]
"nil6" [label="", color=none]
"nil7" [label="", color=none]
"nil8" [label="", color=none]
"nil9" [label="", color=none]
"Node(value=3, rank=2)" -> "Node(value=1, rank=1)" #done
"Node(value=1, rank=1)" -> "Node(value=0, rank=0)" #done
"Node(value=1, rank=1)" -> "Node(value=2, rank=0)" #done
"Node(value=3, rank=2)" -> "Node(value=5, rank=1)" #done
"Node(value=5, rank=1)" -> "Node(value=4, rank=0)" #done
"Node(value=5, rank=1)" -> "Node(value=7, rank=0)" [color="red"] #done
"Node(value=0, rank=0)" -> "nil2"
"Node(value=0, rank=0)" -> "nil3"
"Node(value=2, rank=0)" -> "nil4"
"Node(value=2, rank=0)" -> "nil5"
"Node(value=4, rank=0)" -> "nil6"
"Node(value=4, rank=0)" -> "nil7"
"Node(value=7, rank=0)" -> "nil8"
"Node(value=7, rank=0)" -> "nil9"
}

40
static/files/algorithms/rb-trees/rules/red-node-black-children/incorrect.dot Normal file
View file

@ -0,0 +1,40 @@
digraph {
"Node(value=3, rank=2)" [label="3"]; #done
"Node(value=1, rank=1)" [label="1", color="red"]; #done
"Node(value=4, rank=0)" [label="4", color="red"]; #done
"Node(value=7, rank=0)" [label="7", color="red"]; #done
"Node(value=0, rank=0)" [label="0"]; #done
"Node(value=2, rank=0)" [label="2"]; #done
"Node(value=5, rank=1)" [label="5"]; #done
"nil2" [label="", color=none]
"nil3" [label="", color=none]
"nil4" [label="", color=none]
"nil5" [label="", color=none]
"nil6" [label="", color=none]
"nil7" [label="", color=none]
"nil8" [label="", color=none]
"nil9" [label="", color=none]
"nil10" [label="", color=none]
"8" [label="8", color="red"]
"Node(value=3, rank=2)" -> "Node(value=1, rank=1)" #done
"Node(value=1, rank=1)" -> "Node(value=0, rank=0)" #done
"Node(value=1, rank=1)" -> "Node(value=2, rank=0)" #done
"Node(value=3, rank=2)" -> "Node(value=5, rank=1)" #done
"Node(value=5, rank=1)" -> "Node(value=4, rank=0)" #done
"Node(value=5, rank=1)" -> "Node(value=7, rank=0)" [color="red"] #done
"Node(value=0, rank=0)" -> "nil2"
"Node(value=0, rank=0)" -> "nil3"
"Node(value=2, rank=0)" -> "nil4"
"Node(value=2, rank=0)" -> "nil5"
"Node(value=4, rank=0)" -> "nil6"
"Node(value=4, rank=0)" -> "nil7"
"Node(value=7, rank=0)" -> "nil8"
"Node(value=7, rank=0)" -> "8" [color="red"]
"8" -> "nil9"
"8" -> "nil10"
}

7
static/files/algorithms/rb-trees/rules/red-root/br_0.dot Normal file
View file

@ -0,0 +1,7 @@
digraph RBTree {
"140399805603280" [label="12"]
L140399805603280 [label="",color=none]
140399805603280 -> L140399805603280
R140399805603280 [label="",color=none]
140399805603280 -> R140399805603280
}

11
static/files/algorithms/rb-trees/rules/red-root/br_1.dot Normal file
View file

@ -0,0 +1,11 @@
digraph RBTree {
"140399805603280" [label="12"]
"140399805603280" -> "140399804142928" [color="red"]
"140399804142928" [color=red,label="5"]
L140399804142928 [label="",color=none]
140399804142928 -> L140399804142928
R140399804142928 [label="",color=none]
140399804142928 -> R140399804142928
R140399805603280 [label="",color=none]
140399805603280 -> R140399805603280
}

15
static/files/algorithms/rb-trees/rules/red-root/br_2.dot Normal file
View file

@ -0,0 +1,15 @@
digraph RBTree {
"140399805910672" [label="9"]
"140399805910672" -> "140399804142928" [color="red"]
"140399804142928" [color=red,label="5"]
L140399804142928 [label="",color=none]
140399804142928 -> L140399804142928
R140399804142928 [label="",color=none]
140399804142928 -> R140399804142928
"140399805910672" -> "140399805603280" [color="red"]
"140399805603280" [color=red,label="12"]
L140399805603280 [label="",color=none]
140399805603280 -> L140399805603280
R140399805603280 [label="",color=none]
140399805603280 -> R140399805603280
}

19
static/files/algorithms/rb-trees/rules/red-root/br_3.dot Normal file
View file

@ -0,0 +1,19 @@
digraph RBTree {
"140399805910672" [label="9"]
"140399805910672" -> "140399804142928"
"140399804142928" [label="5"]
L140399804142928 [label="",color=none]
140399804142928 -> L140399804142928
R140399804142928 [label="",color=none]
140399804142928 -> R140399804142928
"140399805910672" -> "140399805603280"
"140399805603280" [label="12"]
L140399805603280 [label="",color=none]
140399805603280 -> L140399805603280
"140399805603280" -> "140399805700368" [color="red"]
"140399805700368" [color=red,label="18"]
L140399805700368 [label="",color=none]
140399805700368 -> L140399805700368
R140399805700368 [label="",color=none]
140399805700368 -> R140399805700368
}

23
static/files/algorithms/rb-trees/rules/red-root/br_4.dot Normal file
View file

@ -0,0 +1,23 @@
digraph RBTree {
"140399805910672" [label="9"]
"140399805910672" -> "140399804142928"
"140399804142928" [label="5"]
"140399804142928" -> "140399805700304" [color="red"]
"140399805700304" [color=red,label="2"]
L140399805700304 [label="",color=none]
140399805700304 -> L140399805700304
R140399805700304 [label="",color=none]
140399805700304 -> R140399805700304
R140399804142928 [label="",color=none]
140399804142928 -> R140399804142928
"140399805910672" -> "140399805603280"
"140399805603280" [label="12"]
L140399805603280 [label="",color=none]
140399805603280 -> L140399805603280
"140399805603280" -> "140399805700368" [color="red"]
"140399805700368" [color=red,label="18"]
L140399805700368 [label="",color=none]
140399805700368 -> L140399805700368
R140399805700368 [label="",color=none]
140399805700368 -> R140399805700368
}

27
static/files/algorithms/rb-trees/rules/red-root/br_5.dot Normal file
View file

@ -0,0 +1,27 @@
digraph RBTree {
"140399805910672" [label="9"]
"140399805910672" -> "140399804142928"
"140399804142928" [label="5"]
"140399804142928" -> "140399805700304" [color="red"]
"140399805700304" [color=red,label="2"]
L140399805700304 [label="",color=none]
140399805700304 -> L140399805700304
R140399805700304 [label="",color=none]
140399805700304 -> R140399805700304
R140399804142928 [label="",color=none]
140399804142928 -> R140399804142928
"140399805910672" -> "140399805605392"
"140399805605392" [label="15"]
"140399805605392" -> "140399805603280" [color="red"]
"140399805603280" [color=red,label="12"]
L140399805603280 [label="",color=none]
140399805603280 -> L140399805603280
R140399805603280 [label="",color=none]
140399805603280 -> R140399805603280
"140399805605392" -> "140399805700368" [color="red"]
"140399805700368" [color=red,label="18"]
L140399805700368 [label="",color=none]
140399805700368 -> L140399805700368
R140399805700368 [label="",color=none]
140399805700368 -> R140399805700368
}

31
static/files/algorithms/rb-trees/rules/red-root/br_6.dot Normal file
View file

@ -0,0 +1,31 @@
digraph RBTree {
"140399805910672" [label="9"]
"140399805910672" -> "140399804142928"
"140399804142928" [label="5"]
"140399804142928" -> "140399805700304" [color="red"]
"140399805700304" [color=red,label="2"]
L140399805700304 [label="",color=none]
140399805700304 -> L140399805700304
R140399805700304 [label="",color=none]
140399805700304 -> R140399805700304
R140399804142928 [label="",color=none]
140399804142928 -> R140399804142928
"140399805910672" -> "140399805605392" [color="red"]
"140399805605392" [color=red,label="15"]
"140399805605392" -> "140399805603280"
"140399805603280" [label="12"]
L140399805603280 [label="",color=none]
140399805603280 -> L140399805603280
"140399805603280" -> "140399805605456" [color="red"]
"140399805605456" [color=red,label="13"]
L140399805605456 [label="",color=none]
140399805605456 -> L140399805605456
R140399805605456 [label="",color=none]
140399805605456 -> R140399805605456
"140399805605392" -> "140399805700368"
"140399805700368" [label="18"]
L140399805700368 [label="",color=none]
140399805700368 -> L140399805700368
R140399805700368 [label="",color=none]
140399805700368 -> R140399805700368
}

35
static/files/algorithms/rb-trees/rules/red-root/br_7.dot Normal file
View file

@ -0,0 +1,35 @@
digraph RBTree {
"140399805910672" [label="9"]
"140399805910672" -> "140399804142928"
"140399804142928" [label="5"]
"140399804142928" -> "140399805700304" [color="red"]
"140399805700304" [color=red,label="2"]
L140399805700304 [label="",color=none]
140399805700304 -> L140399805700304
R140399805700304 [label="",color=none]
140399805700304 -> R140399805700304
R140399804142928 [label="",color=none]
140399804142928 -> R140399804142928
"140399805910672" -> "140399805605392" [color="red"]
"140399805605392" [color=red,label="15"]
"140399805605392" -> "140399805603280"
"140399805603280" [label="12"]
L140399805603280 [label="",color=none]
140399805603280 -> L140399805603280
"140399805603280" -> "140399805605456" [color="red"]
"140399805605456" [color=red,label="13"]
L140399805605456 [label="",color=none]
140399805605456 -> L140399805605456
R140399805605456 [label="",color=none]
140399805605456 -> R140399805605456
"140399805605392" -> "140399805700368"
"140399805700368" [label="18"]
L140399805700368 [label="",color=none]
140399805700368 -> L140399805700368
"140399805700368" -> "140399805605584" [color="red"]
"140399805605584" [color=red,label="19"]
L140399805605584 [label="",color=none]
140399805605584 -> L140399805605584
R140399805605584 [label="",color=none]
140399805605584 -> R140399805605584
}

39
static/files/algorithms/rb-trees/rules/red-root/br_8.dot Normal file
View file

@ -0,0 +1,39 @@
digraph RBTree {
"140399805910672" [label="9"]
"140399805910672" -> "140399804142928"
"140399804142928" [label="5"]
"140399804142928" -> "140399805700304" [color="red"]
"140399805700304" [color=red,label="2"]
L140399805700304 [label="",color=none]
140399805700304 -> L140399805700304
R140399805700304 [label="",color=none]
140399805700304 -> R140399805700304
R140399804142928 [label="",color=none]
140399804142928 -> R140399804142928
"140399805910672" -> "140399805605392" [color="red"]
"140399805605392" [color=red,label="15"]
"140399805605392" -> "140399805603280"
"140399805603280" [label="12"]
L140399805603280 [label="",color=none]
140399805603280 -> L140399805603280
"140399805603280" -> "140399805605456" [color="red"]
"140399805605456" [color=red,label="13"]
L140399805605456 [label="",color=none]
140399805605456 -> L140399805605456
R140399805605456 [label="",color=none]
140399805605456 -> R140399805605456
"140399805605392" -> "140399805700368"
"140399805700368" [label="18"]
"140399805700368" -> "140399804318928" [color="red"]
"140399804318928" [color=red,label="17"]
L140399804318928 [label="",color=none]
140399804318928 -> L140399804318928
R140399804318928 [label="",color=none]
140399804318928 -> R140399804318928
"140399805700368" -> "140399805605584" [color="red"]
"140399805605584" [color=red,label="19"]
L140399805605584 [label="",color=none]
140399805605584 -> L140399805605584
R140399805605584 [label="",color=none]
140399805605584 -> R140399805605584
}

7
static/files/algorithms/rb-trees/rules/red-root/rr_0.dot Normal file
View file

@ -0,0 +1,7 @@
digraph RBTree {
"139660435791312" [color=red,label="12"]
L139660435791312 [label="",color=none]
139660435791312 -> L139660435791312
R139660435791312 [label="",color=none]
139660435791312 -> R139660435791312
}

11
static/files/algorithms/rb-trees/rules/red-root/rr_1.dot Normal file
View file

@ -0,0 +1,11 @@
digraph RBTree {
"139660435791312" [label="12"]
"139660435791312" -> "139660436098128" [color="red"]
"139660436098128" [color=red,label="5"]
L139660436098128 [label="",color=none]
139660436098128 -> L139660436098128
R139660436098128 [label="",color=none]
139660436098128 -> R139660436098128
R139660435791312 [label="",color=none]
139660435791312 -> R139660435791312
}

15
static/files/algorithms/rb-trees/rules/red-root/rr_2.dot Normal file
View file

@ -0,0 +1,15 @@
digraph RBTree {
"139660434247376" [label="9"]
"139660434247376" -> "139660436098128" [color="red"]
"139660436098128" [color=red,label="5"]
L139660436098128 [label="",color=none]
139660436098128 -> L139660436098128
R139660436098128 [label="",color=none]
139660436098128 -> R139660436098128
"139660434247376" -> "139660435791312" [color="red"]
"139660435791312" [color=red,label="12"]
L139660435791312 [label="",color=none]
139660435791312 -> L139660435791312
R139660435791312 [label="",color=none]
139660435791312 -> R139660435791312
}

19
static/files/algorithms/rb-trees/rules/red-root/rr_3.dot Normal file
View file

@ -0,0 +1,19 @@
digraph RBTree {
"139660434247376" [color=red,label="9"]
"139660434247376" -> "139660436098128"
"139660436098128" [label="5"]
L139660436098128 [label="",color=none]
139660436098128 -> L139660436098128
R139660436098128 [label="",color=none]
139660436098128 -> R139660436098128
"139660434247376" -> "139660435791312"
"139660435791312" [label="12"]
L139660435791312 [label="",color=none]
139660435791312 -> L139660435791312
"139660435791312" -> "139660435887824" [color="red"]
"139660435887824" [color=red,label="18"]
L139660435887824 [label="",color=none]
139660435887824 -> L139660435887824
R139660435887824 [label="",color=none]
139660435887824 -> R139660435887824
}

23
static/files/algorithms/rb-trees/rules/red-root/rr_4.dot Normal file
View file

@ -0,0 +1,23 @@
digraph RBTree {
"139660434247376" [color=red,label="9"]
"139660434247376" -> "139660436098128"
"139660436098128" [label="5"]
"139660436098128" -> "139660435887760" [color="red"]
"139660435887760" [color=red,label="2"]
L139660435887760 [label="",color=none]
139660435887760 -> L139660435887760
R139660435887760 [label="",color=none]
139660435887760 -> R139660435887760
R139660436098128 [label="",color=none]
139660436098128 -> R139660436098128
"139660434247376" -> "139660435791312"
"139660435791312" [label="12"]
L139660435791312 [label="",color=none]
139660435791312 -> L139660435791312
"139660435791312" -> "139660435887824" [color="red"]
"139660435887824" [color=red,label="18"]
L139660435887824 [label="",color=none]
139660435887824 -> L139660435887824
R139660435887824 [label="",color=none]
139660435887824 -> R139660435887824
}

27
static/files/algorithms/rb-trees/rules/red-root/rr_5.dot Normal file
View file

@ -0,0 +1,27 @@
digraph RBTree {
"139660434247376" [color=red,label="9"]
"139660434247376" -> "139660436098128"
"139660436098128" [label="5"]
"139660436098128" -> "139660435887760" [color="red"]
"139660435887760" [color=red,label="2"]
L139660435887760 [label="",color=none]
139660435887760 -> L139660435887760
R139660435887760 [label="",color=none]
139660435887760 -> R139660435887760
R139660436098128 [label="",color=none]
139660436098128 -> R139660436098128
"139660434247376" -> "139660435793424"
"139660435793424" [label="15"]
"139660435793424" -> "139660435791312" [color="red"]
"139660435791312" [color=red,label="12"]
L139660435791312 [label="",color=none]
139660435791312 -> L139660435791312
R139660435791312 [label="",color=none]
139660435791312 -> R139660435791312
"139660435793424" -> "139660435887824" [color="red"]
"139660435887824" [color=red,label="18"]
L139660435887824 [label="",color=none]
139660435887824 -> L139660435887824
R139660435887824 [label="",color=none]
139660435887824 -> R139660435887824
}

31
static/files/algorithms/rb-trees/rules/red-root/rr_6.dot Normal file
View file

@ -0,0 +1,31 @@
digraph RBTree {
"139660434247376" [label="9"]
"139660434247376" -> "139660436098128"
"139660436098128" [label="5"]
"139660436098128" -> "139660435887760" [color="red"]
"139660435887760" [color=red,label="2"]
L139660435887760 [label="",color=none]
139660435887760 -> L139660435887760
R139660435887760 [label="",color=none]
139660435887760 -> R139660435887760
R139660436098128 [label="",color=none]
139660436098128 -> R139660436098128
"139660434247376" -> "139660435793424" [color="red"]
"139660435793424" [color=red,label="15"]
"139660435793424" -> "139660435791312"
"139660435791312" [label="12"]
L139660435791312 [label="",color=none]
139660435791312 -> L139660435791312
"139660435791312" -> "139660435793488" [color="red"]
"139660435793488" [color=red,label="13"]
L139660435793488 [label="",color=none]
139660435793488 -> L139660435793488
R139660435793488 [label="",color=none]
139660435793488 -> R139660435793488
"139660435793424" -> "139660435887824"
"139660435887824" [label="18"]
L139660435887824 [label="",color=none]
139660435887824 -> L139660435887824
R139660435887824 [label="",color=none]
139660435887824 -> R139660435887824
}

35
static/files/algorithms/rb-trees/rules/red-root/rr_7.dot Normal file
View file

@ -0,0 +1,35 @@
digraph RBTree {
"139660434247376" [label="9"]
"139660434247376" -> "139660436098128"
"139660436098128" [label="5"]
"139660436098128" -> "139660435887760" [color="red"]
"139660435887760" [color=red,label="2"]
L139660435887760 [label="",color=none]
139660435887760 -> L139660435887760
R139660435887760 [label="",color=none]
139660435887760 -> R139660435887760
R139660436098128 [label="",color=none]
139660436098128 -> R139660436098128
"139660434247376" -> "139660435793424" [color="red"]
"139660435793424" [color=red,label="15"]
"139660435793424" -> "139660435791312"
"139660435791312" [label="12"]
L139660435791312 [label="",color=none]
139660435791312 -> L139660435791312
"139660435791312" -> "139660435793488" [color="red"]
"139660435793488" [color=red,label="13"]
L139660435793488 [label="",color=none]
139660435793488 -> L139660435793488
R139660435793488 [label="",color=none]
139660435793488 -> R139660435793488
"139660435793424" -> "139660435887824"
"139660435887824" [label="18"]
L139660435887824 [label="",color=none]
139660435887824 -> L139660435887824
"139660435887824" -> "139660435793616" [color="red"]
"139660435793616" [color=red,label="19"]
L139660435793616 [label="",color=none]
139660435793616 -> L139660435793616
R139660435793616 [label="",color=none]
139660435793616 -> R139660435793616
}

39
static/files/algorithms/rb-trees/rules/red-root/rr_8.dot Normal file
View file

@ -0,0 +1,39 @@
digraph RBTree {
"139660434247376" [label="9"]
"139660434247376" -> "139660436098128"
"139660436098128" [label="5"]
"139660436098128" -> "139660435887760" [color="red"]
"139660435887760" [color=red,label="2"]
L139660435887760 [label="",color=none]
139660435887760 -> L139660435887760
R139660435887760 [label="",color=none]
139660435887760 -> R139660435887760
R139660436098128 [label="",color=none]
139660436098128 -> R139660436098128
"139660434247376" -> "139660435793424" [color="red"]
"139660435793424" [color=red,label="15"]
"139660435793424" -> "139660435791312"
"139660435791312" [label="12"]
L139660435791312 [label="",color=none]
139660435791312 -> L139660435791312
"139660435791312" -> "139660435793488" [color="red"]
"139660435793488" [color=red,label="13"]
L139660435793488 [label="",color=none]
139660435793488 -> L139660435793488
R139660435793488 [label="",color=none]
139660435793488 -> R139660435793488
"139660435793424" -> "139660435887824"
"139660435887824" [label="18"]
"139660435887824" -> "139660434506512" [color="red"]
"139660434506512" [color=red,label="17"]
L139660434506512 [label="",color=none]
139660434506512 -> L139660434506512
R139660434506512 [label="",color=none]
139660434506512 -> R139660434506512
"139660435887824" -> "139660435793616" [color="red"]
"139660435793616" [color=red,label="19"]
L139660435793616 [label="",color=none]
139660435793616 -> L139660435793616
R139660435793616 [label="",color=none]
139660435793616 -> R139660435793616
}