Skip to content
Snippets Groups Projects
Commit b3e8631f authored by Philip Kaluđerčić's avatar Philip Kaluđerčić :u7121:
Browse files

Improve typesetting in the digraph example

parent c0e2d19e
Branches android-msm-hammerhead-3.4-lollipop-mr1
Tags android-5.1.1_r0.6
No related merge requests found
...@@ -118,8 +118,9 @@ ...@@ -118,8 +118,9 @@
\href{https://en.wikipedia.org/wiki/Strongly_connected_component}{strongly \href{https://en.wikipedia.org/wiki/Strongly_connected_component}{strongly
connected components}, i.e.\ connected components}, i.e.\
\[ \forall a, b \in V(X) \st a \sim_{E(\mathfrak{A})} b \implies f(a) \[ \forall a, b \in V(X) \st a \sim_{E(\mathfrak{A})} b \implies f(a)
\sim_{E(\mathfrak{B})} f(b),\] where \(x \sim_{E{\mathfrak{G}}} y\) says that \sim_{E(\mathfrak{B})} f(b),\] where \(x \sim_{E(\mathfrak{G})} y\) says that
there is a path from \(x\) to \(y\) in the digraph \(\mathfrak{G}\). there is a path from \(x\) to \(y\) in the digraph \(\mathfrak{G}\),
over the transitive-reflexive closure of edges.
The \defn{initial}{initial object} are therefore the empty graph The \defn{initial}{initial object} are therefore the empty graph
\(V = \{\}\), since there are no components to be preserved, and the \(V = \{\}\), since there are no components to be preserved, and the
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Please register or to comment