Interesting libraries I might use

[dlight]

Here will be some Rust libraries that I might want to use. Or perhaps C libraries that I can write some bindings to.

[dlight]

Input:

• gilrs, a gamepad library

[dlight]

Algorithms and data structures:

• spiral, for iterating 2D structures in spiral patterns (but I think that what I actually want is iterating on Morton code order, or other cache-friendly curve)

• image for storing the map. current ver is 0.22

• imageproc maybe? uses image ^0.22

• edge_detection?

Spatial data structures:

• spade (passively maintained). Also its spinoff, more maintained rstar for an R* tree

For a general purpose grid:

• ndarray?

• or grid_2d?

For path finding

• grid_search, uses grid_2d

[dlight]

Procedural generation:

• wfc-image, for WFC (the other crate available is collapse. Note, this uses image 0.21 (and grid_2d)
• texture-synthesis, uses image 0.22

Noise:

• noise

• ndarray-rand

[dlight]

Graphics

• coffee, uses image 0.21

[dlight]

For graphs:

• petgraph

• pathfinding works with petgraph for A etc (overlaps with grid_search; but pathfinding looks better) -- however, petgraph also has A..

An interesting algorithm that petgraph implements: Kosaraju's algorithm (and also Tarjan's algorithm which is supposedly more efficent), that finds the strongly connected components

--

One interesting approach to generate graphs is to distribute points and then do spanning trees, Delaunay triangulation, etc.

• startin does Delaunay triangulation, but I didn't find a way to hook it up to petgraph. It has a wasm demo

• spade (also linked above) does Delaunay triangulation too.

[dlight]

To convert between node/edge types in a graph, it's probably better to use frunk.

A nice crate for newtypes: phantom-newtype

[dlight]

program-induction might work for generating a compact graph that satisfy a number of constraints? not really

But z3 might be cool.