Java program demonstrating Mario, Zelda, and Pokemon to be NP-hard. Also includes algorithms for planarity testing, planar embedding, and graph drawing.
-
Updated
May 30, 2020 - Java
Java program demonstrating Mario, Zelda, and Pokemon to be NP-hard. Also includes algorithms for planarity testing, planar embedding, and graph drawing.
Add a description, image, and links to the planar-embedding topic page so that developers can more easily learn about it.
To associate your repository with the planar-embedding topic, visit your repo's landing page and select "manage topics."