teldufalsari/kmath
2
0
Fork 0
forked from kscience/kmath
Code Pull Requests 1 Activity

search for shortest path algorithm

Browse Source
This commit is contained in:
Artyom Degtyarev 2023-03-24 10:39:51 +03:00
parent 24c39c97cd
commit 11dd4088d9
1 changed files with 3 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
kmath-trajectory/src/commonTest/kotlin/space/kscience/kmath/trajectory/DubinsTest.kt
View File

@ -9,6 +9,7 @@ import space.kscience.kmath.geometry.Circle2D
import space.kscience.kmath.geometry.Euclidean2DSpace.vector import space.kscience.kmath.geometry.Euclidean2DSpace.vector
import space.kscience.kmath.geometry.equalsFloat import space.kscience.kmath.geometry.equalsFloat
import kotlin.test.Test import kotlin.test.Test
import kotlin.test.assertEquals
import kotlin.test.assertTrue import kotlin.test.assertTrue
class DubinsTest { class DubinsTest {
@ -33,7 +34,7 @@ class DubinsTest {
finalRadius, finalRadius,
obstacles) obstacles)
val length = pathLength(shortestPath(outputTangents)) val length = pathLength(shortestPath(outputTangents))
assertTrue(length.equalsFloat(27.2113183)) assertEquals(length, 27.2113183, 1e-6)
} }
@Test @Test
@ -67,7 +68,7 @@ class DubinsTest {
finalRadius, finalRadius,
obstacles) obstacles)
val length = pathLength(shortestPath(paths)) val length = pathLength(shortestPath(paths))
assertTrue(length.equalsFloat(28.9678224)) assertEquals(length,28.9678224, 1e-6)
} }
@Test @Test
fun equalCircles() { fun equalCircles() {