Improved docs

Author: alexandrutomescu

docs/abstract-path-model.md

@@ -55,4 +55,4 @@ flowchart LR
 ::: flowpaths.abstractpathmodeldag
     options:
       filters: 
-        - "!^__"
+        - "!^_"

docs/k-flow-decomposition.md

@@ -15,4 +15,7 @@ The class [MinFlowDecomp](minimum-flow-decomposition.md) uses this class interna
 
     Suppose that the number of paths of a minimum flow decomposition is $k^*$. If we ask for a decomposition with $k > k^*$ paths, this class will always return a decomposition with $k$ paths, but some paths might have weight 0.
 
-::: flowpaths.kflowdecomp
+::: flowpaths.kflowdecomp
+    options:
+      filters: 
+        - "!^_"

docs/k-least-absolute-errors.md

@@ -39,4 +39,7 @@ This class implements a more general version, as follows:
     $$
 
 
-::: flowpaths.kleastabserrors
+::: flowpaths.kleastabserrors
+    options:
+      filters: 
+        - "!^_"

docs/k-min-path-error.md

@@ -56,4 +56,7 @@ This class implements a more general version, as follows:
 [**Accurate Flow Decomposition via Robust Integer Linear Programming**](https://doi.org/10.1109/TCBB.2024.3433523)
 IEEE/ACM Transactions on Computational Biology and Bioinformatics 21(6), 1955-1964, 2024 [(preprint)](https://researchportal.helsinki.fi/files/325850154/TCBB3433523.pdf)
 
-::: flowpaths.kminpatherror
+::: flowpaths.kminpatherror
+    options:
+      filters: 
+        - "!^_"

docs/minimum-flow-decomposition.md

@@ -117,4 +117,4 @@ There are several works on this problem, for example.
 ::: flowpaths.minflowdecomp
     options:
       filters: 
-        - "!^__"
+        - "!^_"

docs/minimum-path-cover.md

@@ -60,10 +60,10 @@ mpc_model_sc.solve()
 ::: flowpaths.minpathcover
     options:
       filters: 
-        - "!^__"
+        - "!^_"
         - "!^solve_time_elapsed"
 
 ::: flowpaths.kpathcover
     options:
       filters: 
-        - "!^__"
+        - "!^_"

docs/minimum-set-cover.md

@@ -1,4 +1,4 @@
 ::: flowpaths.minsetcover
     options:
       filters: 
-        - "!^__"
+        - "!^_"

docs/node-expanded-digraph.md

@@ -7,4 +7,4 @@ Internally, these are handled via the class `NodeExpandedDiGraph`. See [this exa
 ::: flowpaths.nodeexpandeddigraph
     options:
       filters: 
-        - "!^__"
+        - "!^_"