RudSmo / Hard-Spheres-Cluster Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

Graph-theoretical cluster algorithm for clusters of directly connected hard spheres. Sampling based on a Markov-Chain-Monte-Carlo method.

0 stars 0 forks Branches Tags Activity

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 37 Commits
data/v3		data/v3
plotting		plotting
source		source
README.md		README.md
scrpt.sh		scrpt.sh

Repository files navigation

Hard-Spheres-Cluster

Simple graph-theoretical cluster algorithm for clusters of directly connected hard spheres. Sampling based on a Markov-Chain-Monte-Carlo method.

About

Graph-theoretical cluster algorithm for clusters of directly connected hard spheres. Sampling based on a Markov-Chain-Monte-Carlo method.

monte-carlo monte-carlo-simulation markov-chain-monte-carlo hard-spheres

Report repository

Releases

No releases published

Packages

No packages published

Languages