Commit45f3b8c

authored

Merge pull request#1378 from cp-algorithms/missing-links

Fix a few more missing links#1137

2 parentsf3c64e8 +7216ec2 commit45f3b8cCopy full SHA for 45f3b8c

File tree

-2

lines changed

-2

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -173,6 +173,6 @@ In fact, to solve this problem, the algorithm remains the same: we divide the fi`
`173`	`173`	`*[UVA 10245 "The Closest Pair Problem"[difficulty: low]](https://uva.onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=1186)`
`174`	`174`	`*[SPOJ#8725 CLOPPAIR "Closest Point Pair"[difficulty: low]](https://www.spoj.com/problems/CLOPPAIR/)`
`175`	`175`	`*[CODEFORCES Team Olympiad Saratov - 2011 "Minimum amount"[difficulty: medium]](http://codeforces.com/contest/120/problem/J)`
`176`		`-*[Google CodeJam 2009 Final "Min Perimeter "[difficulty: medium]](https://code.google.com/codejam/contest/311101/dashboard#s=a&a=1)`
	`176`	`+*[Google CodeJam 2009 Final "Min Perimeter"[difficulty: medium]](https://github.com/google/coding-competitions-archive/blob/main/codejam/2009/world_finals/min_perimeter/statement.pdf)`
`177`	`177`	`*[SPOJ#7029 CLOSEST "Closest Triple"[difficulty: medium]](https://www.spoj.com/problems/CLOSEST/)`
`178`	`178`	`*[TIMUS 1514 National Park[difficulty: medium]](https://acm.timus.ru/problem.aspx?space=1&num=1514)`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -13,7 +13,7 @@ In this article we will deal with finding both inner and outer faces of a planar`
`13`	`13`
`14`	`14`	`##Some facts about planar graphs`
`15`	`15`
`16`		`-In this section we present several facts about planar graphs without proof. Readers who are interested in proofs should refer to[Graph Theory by R. Diestel](https://sites.math.washington.edu/~billey/classes/562.winter.2018/articles/GraphTheory.pdf) or some other book.`
	`16`	`+In this section we present several facts about planar graphs without proof. Readers who are interested in proofs should refer to[Graph Theory by R. Diestel](https://diestel-graph-theory.com/) (see[video lectures](https://www.youtube.com/@DiestelGraphTheory) based on this book) or some other book.`
`17`	`17`
`18`	`18`	`###Euler's theorem`
`19`	`19`	`Euler's theorem states that any correct embedding of a connected planar graph with $n$ vertices, $m$ edges and $f$ faces satisfies:`

Comments

(0)