Basics Data Structure and Graph Theory
-
Updated
Apr 11, 2018 - C
Basics Data Structure and Graph Theory
A tool to read and operate OpenMX HKS (Kohn-Sham Hamiltonian) files
Calculating Random and Linear entanglement entropy in disordered interacting spin half chain
This directory is for the purposes of finding the shortest hamiltonian path given a set of vertices and edges connecting them. It will handle an error if not given the proper format of veritces, edges, and names.
Add a description, image, and links to the hamiltonian topic page so that developers can more easily learn about it.
To associate your repository with the hamiltonian topic, visit your repo's landing page and select "manage topics."