From 2cecd51434208bf7b7c25920e3bdc7cbf1e8300e Mon Sep 17 00:00:00 2001
From: Hofer-Julian <julianhofer@gnome.org>
Date: Wed, 1 Nov 2023 08:14:57 +0100
Subject: [PATCH] Use actions-gh-pages

Since we already render the page this simpler action should be enough.

Just checking if the CI works is not enough for this PR. After it is merged, we need to check if it also works on main and if my small doc changes pop up.
---
 .github/workflows/docs.yml | 9 +++------
 docs/core/allocation.qmd   | 4 ++--
 2 files changed, 5 insertions(+), 8 deletions(-)

diff --git a/.github/workflows/docs.yml b/.github/workflows/docs.yml
index 10eece3c8..257a9fdea 100644
--- a/.github/workflows/docs.yml
+++ b/.github/workflows/docs.yml
@@ -53,14 +53,11 @@ jobs:
       - name: Render Quarto Project
         run: pixi run quarto-render
 
-      - name: Set up Quarto for publish
-        uses: quarto-dev/quarto-actions/setup@v2
       - name: Publish Quarto Project
         if: github.ref == 'refs/heads/main'
-        uses: quarto-dev/quarto-actions/publish@v2
+        uses: peaceiris/actions-gh-pages@v3
         with:
-          path: docs
-          render: false
-          target: gh-pages
+          github_token: ${{ secrets.GITHUB_TOKEN }}
+          publish_dir: ./docs
         env:
           GITHUB_TOKEN: ${{ secrets.GITHUB_TOKEN }}
diff --git a/docs/core/allocation.qmd b/docs/core/allocation.qmd
index a8706f8d6..9db6110a5 100644
--- a/docs/core/allocation.qmd
+++ b/docs/core/allocation.qmd
@@ -140,12 +140,12 @@ $$
      \hat{V}^{\text{out}}_S(\hat{k}) = \{\hat{j}\}.
 \end{align}
 $$ {#eq-returnflowconstraint}
-Here we use that each user node in the allocation graph has an unique in-edge and out-edge.
+Here we use that each user node in the allocation graph has a unique in-edge and out-edge.
 - User allocation: The flow over the edge to the user is equal to the sum of the allocations to the user:
 $$
     F_{\hat{i}\hat{k}} = \sum_{p=1}^{p_\max} A^\text{user}_{\hat{k},p}, \quad \forall \hat{k} \in \hat{U}_S, \hat{V}^{\text{out}}_s(\hat{k}) = \{\hat{i}\}.
 $$ {#eq-userallocationconstraint}
-Here we use that each user has an unique out-edge.
+Here we use that each user has a unique out-edge.
 - User demand: what is allocated to the user is bounded above by the user demand:
 $$
     A_{\hat{i},p}^\text{user} \leq d_i^p(t) \quad \forall\hat{i} \in \hat{U}_S, \; p = 1,\ldots,p_\max.