Add tags to combinatorics and data structures

Oleksandr Kulkov · Oleksandr Kulkov · commit 08cbb5b1522d · 2022-06-08T12:46:05.000+02:00
diff --git a/.github/workflows/test.yml b/.github/workflows/test.yml
@@ -7,7 +7,9 @@ jobs:
 
     steps:
       - name: Checkout repository
-        uses: actions/checkout@v2
+        uses: actions/checkout@v3
+        with:
+          fetch-depth: 0
       - name: Set up Python
         uses: actions/setup-python@v2
         with:
diff --git a/src/combinatorics/binomial-coefficients.md b/src/combinatorics/binomial-coefficients.md
@@ -1,3 +1,9 @@
+---
+tags:
+  - Translated
+e_maxx_link: binomial_coeff
+---
+
 # Binomial Coefficients
 
 Binomial coefficients $\binom n k$ are the number of ways to select a set of $k$ elements from $n$ different elements without taking into account the order of arrangement of these elements (i.e., the number of unordered sets).
diff --git a/src/combinatorics/bishops-on-chessboard.md b/src/combinatorics/bishops-on-chessboard.md
@@ -1,3 +1,9 @@
+---
+tags:
+  - Translated
+e_maxx_link: bishops_arrangement
+---
+
 # Placing Bishops on a Chessboard
 
 Find the number of ways to place $K$ bishops on an $N \times N$ chessboard so that no two bishops attack each other.
diff --git a/src/combinatorics/bracket_sequences.md b/src/combinatorics/bracket_sequences.md
@@ -1,3 +1,9 @@
+---
+tags:
+  - Translated
+e_maxx_link: bracket_sequences
+---
+
 # Balanced bracket sequences
 
 A **balanced bracket sequence** is a string consisting of only brackets, such that this sequence, when inserted certain numbers and mathematical operations, gives a valid mathematical expression.
diff --git a/src/combinatorics/burnside.md b/src/combinatorics/burnside.md
@@ -1,3 +1,9 @@
+---
+tags:
+  - Translated
+e_maxx_link: burnside_polya
+---
+
 # Burnside's lemma / Pólya enumeration theorem
 
 ## Burnside's lemma
diff --git a/src/combinatorics/catalan-numbers.md b/src/combinatorics/catalan-numbers.md
@@ -1,3 +1,9 @@
+---
+tags:
+  - Translated
+e_maxx_link: catalan_numbers
+---
+
 # Catalan Numbers
 Catalan numbers is a number sequence, which is found useful in a number of combinatorial problems, often involving recursively-defined objects.
 
diff --git a/src/combinatorics/counting_labeled_graphs.md b/src/combinatorics/counting_labeled_graphs.md
@@ -1,3 +1,9 @@
+---
+tags:
+  - Translated
+e_maxx_link: counting_connected_graphs
+---
+
 # Counting labeled graphs
 
 ## Labeled graphs
diff --git a/src/combinatorics/generating_combinations.md b/src/combinatorics/generating_combinations.md
@@ -1,5 +1,8 @@
 ---
 title: Generating all K-combinations
+tags:
+  - Translated
+e_maxx_link: generating_combinations
 ---
 # Generating all $K$-combinations
 
diff --git a/src/combinatorics/inclusion-exclusion.md b/src/combinatorics/inclusion-exclusion.md
@@ -1,3 +1,9 @@
+---
+tags:
+  - Translated
+e_maxx_link: inclusion_exclusion_principle
+---
+
 # The Inclusion-Exclusion Principle
 
 The inclusion-exclusion principle is an important combinatorial way to compute the size of a set or the probability of complex events. It relates the sizes of individual sets with their union.
diff --git a/src/combinatorics/stars_and_bars.md b/src/combinatorics/stars_and_bars.md
@@ -1,3 +1,8 @@
+---
+tags:
+  - Original
+---
+
 # Stars and bars
 
 Stars and bars is a mathematical technique for solving certain combinatorial problems.
diff --git a/src/data_structures/deleting_in_log_n.md b/src/data_structures/deleting_in_log_n.md
@@ -1,5 +1,7 @@
 ---
-title: Deleting from a data structure in O(T(n)log n)
+title: Deleting from a data structure in O(T(n) log n)
+tags:
+  - Original
 ---
 # Deleting from a data structure in $O(T(n)\log n)$
 
diff --git a/src/data_structures/disjoint_set_union.md b/src/data_structures/disjoint_set_union.md
@@ -1,3 +1,9 @@
+---
+tags:
+  - Translated
+e_maxx_link: dsu
+---
+
 # Disjoint Set Union
 
 This article discusses the data structure **Disjoint Set Union** or **DSU**.
diff --git a/src/data_structures/fenwick.md b/src/data_structures/fenwick.md
@@ -1,3 +1,9 @@
+---
+tags:
+  - Translated
+e_maxx_link: fenwick_tree
+---
+
 # Fenwick Tree
 
 Let, $f$ be some _reversible_ function and $A$ be an array of integers of length $N$.
diff --git a/src/data_structures/randomized_heap.md b/src/data_structures/randomized_heap.md
@@ -1,3 +1,9 @@
+---
+tags:
+  - Translated
+e_maxx_link: randomized_heap
+---
+
 # Randomized Heap
 
 A randomized heap is a heap that, through using randomization, allows to perform all operations in expected logarithmic time.
diff --git a/src/data_structures/segment_tree.md b/src/data_structures/segment_tree.md
@@ -1,3 +1,9 @@
+---
+tags:
+  - Translated
+e_maxx_link: segment_tree
+---
+
 # Segment Tree
 
 A Segment Tree is a data structure that allows answering range queries over an array effectively, while still being flexible enough to allow modifying the array. 
diff --git a/src/data_structures/sparse-table.md b/src/data_structures/sparse-table.md
@@ -1,3 +1,8 @@
+---
+tags:
+  - Original
+---
+
 # Sparse Table
 
 Sparse Table is a data structure, that allows answering range queries.
diff --git a/src/data_structures/sqrt-tree.md b/src/data_structures/sqrt-tree.md
@@ -1,3 +1,8 @@
+---
+tags:
+  - Original
+---
+
 # Sqrt Tree
 
 Given an array $a$ that contains $n$ elements and the operation $\circ$ that satisfies associative property: $(x \circ y) \circ z = x \circ (y \circ z)$ is true for any $x$, $y$, $z$.
diff --git a/src/data_structures/sqrt_decomposition.md b/src/data_structures/sqrt_decomposition.md
@@ -1,3 +1,9 @@
+---
+tags:
+  - Translated
+e_maxx_link: sqrt_decomposition
+---
+
 # Sqrt Decomposition
 
 Sqrt Decomposition is a method (or a data structure) that allows you to perform some common operations (finding sum of the elements of the sub-array, finding the minimal/maximal element, etc.) in $O(\sqrt n)$ operations, which is much faster than $O(n)$ for the trivial algorithm.
diff --git a/src/data_structures/stack_queue_modification.md b/src/data_structures/stack_queue_modification.md
@@ -1,3 +1,9 @@
+---
+tags:
+  - Translated
+e_maxx_link: stacks_for_minima
+---
+
 # Minimum stack / Minimum queue
 
 In this article we will consider three problems: 
diff --git a/src/data_structures/treap.md b/src/data_structures/treap.md
@@ -1,3 +1,9 @@
+---
+tags:
+  - Translated
+e_maxx_link: treap
+---
+
 # Treap (Cartesian tree)
 
 A treap is a data structure which combines binary tree and binary heap (hence the name: tree + heap $\Rightarrow$ Treap).
diff --git a/src/navigation.md b/src/navigation.md
@@ -51,7 +51,7 @@
         - [Sqrt Tree](data_structures/sqrt-tree.md)
         - [Randomized Heap](data_structures/randomized_heap.md)
     - Advanced
-        - [Deleting from a data structure in O(T(n)log n)](data_structures/deleting_in_log_n.md)
+        - [Deleting from a data structure in O(T(n) log n)](data_structures/deleting_in_log_n.md)
 - Dynamic Programming
     - DP optimizations
         - [Divide and Conquer DP](dynamic_programming/divide-and-conquer-dp.md)
@@ -90,7 +90,7 @@
         - [The Inclusion-Exclusion Principle](combinatorics/inclusion-exclusion.md)
         - [Burnside's lemma / Pólya enumeration theorem](combinatorics/burnside.md)
         - [Stars and bars](combinatorics/stars_and_bars.md)
-        - [Generating all $K$-combinations](combinatorics/generating_combinations.md)
+        - [Generating all K-combinations](combinatorics/generating_combinations.md)
     - Tasks
         - [Placing Bishops on a Chessboard](combinatorics/bishops-on-chessboard.md)
         - [Balanced bracket sequences](combinatorics/bracket_sequences.md)
@@ -129,7 +129,7 @@
         - [Finding the nearest pair of points](geometry/nearest_points.md)
         - [Delaunay triangulation and Voronoi diagram](geometry/delaunay.md)
         - [Vertical decomposition](geometry/vertical_decomposition.md)
-        - [Half-plane intersection - S&I Algorithm in O(Nlog N)](geometry/halfplane-intersection.md)
+        - [Half-plane intersection - S&I Algorithm in O(N log N)](geometry/halfplane-intersection.md)
 - Graphs
     - Graph traversal
         - [Breadth First Search](graph/breadth-first-search.md)
diff --git a/src/overrides/partials/content.html b/src/overrides/partials/content.html
@@ -54,22 +54,20 @@
 <!-- Date of last commit -->
 <ul class="metadata page-metadata" data-bi-name="page info" lang="en-us" dir="ltr">
   {{ lang.t("source.file.date.updated") }}:
-  {{ page.meta.git_revision_date_localized }}
+  {{ page.meta.git_revision_date_localized }}&emsp;
 <!-- Tags -->
 {% if page and page.meta and page.meta.e_maxx_link %}
 {{ tags.append({'name':'From: e-maxx.ru', 'url': 'https://e-maxx.ru/algo/' + page.meta.e_maxx_link}) or '' }}
 {% endif %}
-{% if "tags" in config.plugins %}
-    {% for tag in tags %}
-      {% if tag.url %}
-        <a href="{{ tag.url | url }}" class="md-tag">
-          {{ tag.name }}
-        </a>
-      {% else %}
-        <span class="md-tag">{{ tag.name }}</span>
-      {% endif %}
-    {% endfor %}
-{% endif %}
+{% for tag in tags %}
+  {% if tag.url %}
+    <a href="{{ tag.url | url }}" class="md-tag">
+      {{ tag.name }}
+    </a>
+  {% else %}
+    <span class="md-tag">{{ tag.name }}</span>
+  {% endif %}
+{% endfor %}
 </ul>
 
 {% if not "\x3ch1" in page.content %}
