✏️ Fixed MathJax typos

include/fiction/algorithms/path_finding/a_star.hpp

@@ -405,7 +405,7 @@ template <typename Path, typename Lyt, typename Dist = uint64_t, typename Cost =
 }
 /**
  * A distance function that does not approximate but compute the actual minimum path length on the given layout via A*
- * traversal. Naturally, this function cannot be evaluated in \f$ \mathcal(O)(1) \f$, but has the polynomial complexity
+ * traversal. Naturally, this function cannot be evaluated in \f$ \mathcal{O}(1) \f$, but has the polynomial complexity
  * of A*.
  *
  * If no path between `source` and `target` exists in `layout`, the returned distance is

include/fiction/algorithms/physical_design/orthogonal.hpp

@@ -628,7 +628,7 @@ class orthogonal_impl
  * network directly used instead of relabeling the edges according to its DFS tree, ordering the vertices using
  * topological sorting instead of DFS, and adding an extra placement rule for nodes without predecessors.
  *
- * The algorithm works in polynomial time \f$ \mathcal(O)(3|N| + |L|) \f$ where \f$ |N| \f$ is the number of nodes in
+ * The algorithm works in polynomial time \f$ \mathcal{O}(3|N| + |L|) \f$ where \f$ |N| \f$ is the number of nodes in
  * the given network and \f$ |L| \f$ is the resulting layout size given by \f$ x \cdot y \f$, which approaches \f$
  * (\frac{|N|}{2})^2 \f$ asymptotically.
  *

include/fiction/algorithms/properties/critical_path_length_and_throughput.hpp

@@ -154,7 +154,7 @@ class critical_path_length_and_throughput_impl
  * Field-coupled Nanotechnologies\" by M. Walter, R. Wille, F. Sill Torres, and R. Drechsler published by Springer
  * Nature in 2022.
  *
- * The complexity of this function is \f$ \mathcal(O)(|T|) \f$ where \f$ T \f$ is the set of all occupied tiles in
+ * The complexity of this function is \f$ \mathcal{O}(|T|) \f$ where \f$ T \f$ is the set of all occupied tiles in
  * `lyt`.
  *
  * @tparam Lyt Gate-level layout type.