You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
|
|
|
|
package technology.zim
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
Adjacency matrix for graph representation. 5k x 5k or 10k x 10k are safe goals, for memory
|
|
|
|
|
Working with a gigantic grid that's mostly full: better to have a up/right/down/left data in each one or a huge adjacency matrix?
|
|
|
|
|
Minimum int size is probably 32 or 64 bit, so huge memory waste if that's used
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Abandon fancy stretch goals, just get pathfinding done and scale it up to demonstrate large scale
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
fun main() {
|
|
|
|
|
println("Hello World!")
|
|
|
|
|
}
|
