Thanks to visit codestin.com
Credit goes to github.com

Skip to content

Commit 0b3ff55

Browse files
committed
update test name/add point struct in snippet
1 parent e17acdd commit 0b3ff55

File tree

2 files changed

+4
-4
lines changed

2 files changed

+4
-4
lines changed

src/geometry/manhattan-distance.md

Lines changed: 4 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -134,6 +134,10 @@ In summary we:
134134
Below you can find a implementation, based on the one from [KACTL](https://github.com/kth-competitive-programming/kactl/blob/main/content/geometry/ManhattanMST.h).
135135

136136
```{.cpp file=manhattan_mst}
137+
struct point {
138+
long long x, y;
139+
};
140+
137141
// Returns a list of edges in the format (weight, u, v).
138142
// Passing this list to Kruskal algorithm will give the Manhattan MST.
139143
vector<tuple<long long,int,int> > manhattan_mst_edges(vector<point> ps){

test/manhattan_mst.cpp renamed to test/test_manhattan_mst.cpp

Lines changed: 0 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -2,10 +2,6 @@
22
using namespace std;
33
#include "manhattan_mst.h"
44

5-
struct point {
6-
int x, y;
7-
};
8-
95
struct DSU {
106
int n;
117
vector<int> p, ps;

0 commit comments

Comments
 (0)