Skip to content

Commit e140502

Browse files
github-actions[bot]github-actions[bot]
committed
1 parent d2f056d commit e140502

7 files changed

+51
-15
lines changed

‎1365/contrib.html

Lines changed: 5 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -6811,11 +6811,11 @@ <h3 id="optional-plugins">Optional Plugins<a class="headerlink" href="#optional-
68116811
<h2 id="testing-code-snippets">Testing Code Snippets<a class="headerlink" href="#testing-code-snippets" title="Permanent link">&para;</a></h2>
68126812
<p>If your article includes code snippets, it’s helpful to include tests to ensure that they run correctly.</p>
68136813
<ol>
6814-
<li>Name the code snippet:</li>
6815-
</ol>
6816-
<p><code>{.cpp file=snippet-name}
6817-
// code here</code></p>
6818-
<ol>
6814+
<li>Name the code snippet:
6815+
<div class="highlight"><pre><span></span><code>```{.cpp file=snippet-name}
6816+
// code here
6817+
```
6818+
</code></pre></div></li>
68196819
<li>Run <code>extract_snippets.py</code> from the <code>test</code> directory to extract snippets into header files. Create a test file that includes these headers and checks their behavior.</li>
68206820
<li>You can run all tests with the <code>test.sh</code> script:
68216821
<div class="highlight"><pre><span></span><code><span class="go">cd test</span>

‎1365/feed_json_updated.json

Lines changed: 1 addition & 1 deletion
Large diffs are not rendered by default.

‎1365/feed_rss_created.xml

Lines changed: 1 addition & 1 deletion
Large diffs are not rendered by default.

‎1365/feed_rss_updated.xml

Lines changed: 1 addition & 1 deletion
Large diffs are not rendered by default.

‎1365/geometry/nearest_points.html

Lines changed: 21 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -6520,6 +6520,20 @@
65206520

65216521

65226522

6523+
6524+
6525+
6526+
6527+
6528+
6529+
6530+
6531+
6532+
6533+
6534+
6535+
6536+
65236537

65246538

65256539

@@ -6574,6 +6588,10 @@
65746588

65756589

65766590

6591+
6592+
6593+
6594+
65776595

65786596

65796597

@@ -6586,7 +6604,7 @@
65866604
<ul class="metadata page-metadata" data-bi-name="page info" lang="en-us" dir="ltr">
65876605

65886606
Last update:
6589-
<span class="git-revision-date-localized-plugin git-revision-date-localized-plugin-date">January 29, 2023</span>&emsp;
6607+
<span class="git-revision-date-localized-plugin git-revision-date-localized-plugin-date">October 22, 2024</span>&emsp;
65906608

65916609
<!-- Tags -->
65926610

@@ -6729,14 +6747,14 @@ <h2 id="practice-problems">Practice problems<a class="headerlink" href="#practic
67296747
<li><a href="https://uva.onlinejudge.org/index.php?option=onlinejudge&amp;page=show_problem&amp;problem=1186">UVA 10245 "The Closest Pair Problem" [difficulty: low]</a></li>
67306748
<li><a href="https://www.spoj.com/problems/CLOPPAIR/">SPOJ #8725 CLOPPAIR "Closest Point Pair" [difficulty: low]</a></li>
67316749
<li><a href="http://codeforces.com/contest/120/problem/J">CODEFORCES Team Olympiad Saratov - 2011 "Minimum amount" [difficulty: medium]</a></li>
6732-
<li><a href="https://code.google.com/codejam/contest/311101/dashboard#s=a&amp;a=1">Google CodeJam 2009 Final " Min Perimeter "[difficulty: medium]</a></li>
6750+
<li><a href="https://github.com/google/coding-competitions-archive/blob/main/codejam/2009/world_finals/min_perimeter/statement.pdf">Google CodeJam 2009 Final "Min Perimeter" [difficulty: medium]</a></li>
67336751
<li><a href="https://www.spoj.com/problems/CLOSEST/">SPOJ #7029 CLOSEST "Closest Triple" [difficulty: medium]</a></li>
67346752
<li><a href="https://acm.timus.ru/problem.aspx?space=1&amp;num=1514">TIMUS 1514 National Park [difficulty: medium]</a></li>
67356753
</ul>
67366754

67376755
<ul class="metadata page-metadata" data-bi-name="page info" lang="en-us" dir="ltr">
67386756
<span class="contributors-text">Contributors:</span>
6739-
<ul class="contributors" data-bi-name="contributors"><li><a href="https://github.com/singamandeep" title="singamandeep" data-bi-name="contributorprofile" target="_blank">singamandeep</a> (92.13%)</li><li><a href="https://github.com/adamant-pwn" title="adamant-pwn" data-bi-name="contributorprofile" target="_blank">adamant-pwn</a> (3.93%)</li><li><a href="https://github.com/jakobkogler" title="jakobkogler" data-bi-name="contributorprofile" target="_blank">jakobkogler</a> (2.81%)</li><li><a href="https://github.com/SYury" title="SYury" data-bi-name="contributorprofile" target="_blank">SYury</a> (0.56%)</li><li><a href="https://github.com/avishekp4" title="avishekp4" data-bi-name="contributorprofile" target="_blank">avishekp4</a> (0.56%)</li></ul>
6757+
<ul class="contributors" data-bi-name="contributors"><li><a href="https://github.com/singamandeep" title="singamandeep" data-bi-name="contributorprofile" target="_blank">singamandeep</a> (91.57%)</li><li><a href="https://github.com/adamant-pwn" title="adamant-pwn" data-bi-name="contributorprofile" target="_blank">adamant-pwn</a> (3.93%)</li><li><a href="https://github.com/jakobkogler" title="jakobkogler" data-bi-name="contributorprofile" target="_blank">jakobkogler</a> (2.81%)</li><li><a href="https://github.com/Kostero" title="Kostero" data-bi-name="contributorprofile" target="_blank">Kostero</a> (0.56%)</li><li><a href="https://github.com/SYury" title="SYury" data-bi-name="contributorprofile" target="_blank">SYury</a> (0.56%)</li><li><a href="https://github.com/avishekp4" title="avishekp4" data-bi-name="contributorprofile" target="_blank">avishekp4</a> (0.56%)</li></ul>
67406758
</ul>
67416759

67426760
</article>

‎1365/geometry/planar.html

Lines changed: 21 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -6618,6 +6618,20 @@
66186618

66196619

66206620

6621+
6622+
6623+
6624+
6625+
6626+
6627+
6628+
6629+
6630+
6631+
6632+
6633+
6634+
66216635

66226636

66236637

@@ -6642,6 +6656,10 @@
66426656

66436657

66446658

6659+
6660+
6661+
6662+
66456663

66466664

66476665

@@ -6654,7 +6672,7 @@
66546672
<ul class="metadata page-metadata" data-bi-name="page info" lang="en-us" dir="ltr">
66556673

66566674
Last update:
6657-
<span class="git-revision-date-localized-plugin git-revision-date-localized-plugin-date">July 15, 2023</span>&emsp;
6675+
<span class="git-revision-date-localized-plugin git-revision-date-localized-plugin-date">October 22, 2024</span>&emsp;
66586676

66596677
<!-- Tags -->
66606678

@@ -6685,7 +6703,7 @@ <h1 id="finding-faces-of-a-planar-graph">Finding faces of a planar graph<a class
66856703
Such graphs are called <strong>planar</strong>. Now suppose that we are given a planar graph together with its straight-line embedding, which means that for each vertex <span class="arithmatex">$v$</span> we have a corresponding point <span class="arithmatex">$(x, y)$</span> and all edges are drawn as line segments between these points without intersection (such embedding always exists). These line segments split the plane into several regions, which are called faces. Exactly one of the faces is unbounded. This face is called <strong>outer</strong>, while the other faces are called <strong>inner</strong>.</p>
66866704
<p>In this article we will deal with finding both inner and outer faces of a planar graph. We will assume that the graph is connected.</p>
66876705
<h2 id="some-facts-about-planar-graphs">Some facts about planar graphs<a class="headerlink" href="#some-facts-about-planar-graphs" title="Permanent link">&para;</a></h2>
6688-
<p>In this section we present several facts about planar graphs without proof. Readers who are interested in proofs should refer to <a href="https://sites.math.washington.edu/~billey/classes/562.winter.2018/articles/GraphTheory.pdf">Graph Theory by R. Diestel</a> or some other book.</p>
6706+
<p>In this section we present several facts about planar graphs without proof. Readers who are interested in proofs should refer to <a href="https://diestel-graph-theory.com/">Graph Theory by R. Diestel</a> (see <a href="https://www.youtube.com/@DiestelGraphTheory">video lectures</a> based on this book) or some other book.</p>
66896707
<h3 id="eulers-theorem">Euler's theorem<a class="headerlink" href="#eulers-theorem" title="Permanent link">&para;</a></h3>
66906708
<p>Euler's theorem states that any correct embedding of a connected planar graph with <span class="arithmatex">$n$</span> vertices, <span class="arithmatex">$m$</span> edges and <span class="arithmatex">$f$</span> faces satisfies:</p>
66916709
<div class="arithmatex">$$n - m + f = 2$$</div>
@@ -7001,7 +7019,7 @@ <h2 id="problems">Problems<a class="headerlink" href="#problems" title="Permanen
70017019

70027020
<ul class="metadata page-metadata" data-bi-name="page info" lang="en-us" dir="ltr">
70037021
<span class="contributors-text">Contributors:</span>
7004-
<ul class="contributors" data-bi-name="contributors"><li><a href="https://github.com/SYury" title="SYury" data-bi-name="contributorprofile" target="_blank">SYury</a> (99.72%)</li><li><a href="https://github.com/adamant-pwn" title="adamant-pwn" data-bi-name="contributorprofile" target="_blank">adamant-pwn</a> (0.28%)</li></ul>
7022+
<ul class="contributors" data-bi-name="contributors"><li><a href="https://github.com/SYury" title="SYury" data-bi-name="contributorprofile" target="_blank">SYury</a> (99.43%)</li><li><a href="https://github.com/Kostero" title="Kostero" data-bi-name="contributorprofile" target="_blank">Kostero</a> (0.28%)</li><li><a href="https://github.com/adamant-pwn" title="adamant-pwn" data-bi-name="contributorprofile" target="_blank">adamant-pwn</a> (0.28%)</li></ul>
70057023
</ul>
70067024

70077025
</article>

‎1365/search/search_index.json

Lines changed: 1 addition & 1 deletion
Large diffs are not rendered by default.

0 commit comments

Comments
 (0)