Update intersecting_segments.md

juan-c-s · adamant-pwn · commit 642c00f0235f · 2024-02-22T19:55:12.000+01:00
The function does not count all intersections. It only returns a pair of intersecting segment Id's if exist
diff --git a/src/geometry/intersecting_segments.md b/src/geometry/intersecting_segments.md
@@ -162,7 +162,7 @@ pair<int, int> solve(const vector<seg>& a) {
 }
 ```
 
-The main function here is `solve()`, which returns the number of found intersecting segments, or $(-1, -1)$, if there are no intersections.
+The main function here is `solve()`, which returns the intersecting segments if exists, or $(-1, -1)$, if there are no intersections.
 
 Checking for the intersection of two segments is carried out by the `intersect ()` function, using an **algorithm based on the oriented area of the triangle**.
 

Original file line number	Diff line number	Diff line change
`@@ -162,7 +162,7 @@ pair<int, int> solve(const vector<seg>& a) {`
`162`	`162`	`}`
`163`	`163`	```
`164`	`164`
`165`		-The main function here is `solve()`, which returns the number of found intersecting segments, or $(-1, -1)$, if there are no intersections.
	`165`	+The main function here is `solve()`, which returns the intersecting segments if exists, or $(-1, -1)$, if there are no intersections.
`166`	`166`
`167`	`167`	Checking for the intersection of two segments is carried out by the `intersect ()` function, using an algorithm based on the oriented area of the triangle.
`168`	`168`