We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 606e19d commit f5246f3Copy full SHA for f5246f3
examples/intro/checking_validity_of_a_pag.py
@@ -15,7 +15,7 @@
15
unique graph, a PAG, in essence, represents a class of graphs that encode
16
the same conditional independence constraints.
17
18
-PAGs model this relationship by displaying all common edge marks (tail and arrowhead) shared
+PAGs model this relationship by displaying all common edge marks (tail and arrowhead) shared
19
by all members in the equivalence class and displaying circle endpoints for those marks
20
that are not common. That is, a circular endpoint (``*-o``) can represent both a directed
21
(``*->``) and tail (``*—``) endpoint in causal graphs within the equivalence class.
0 commit comments