Skip to content

Latest commit

 

History

History
56 lines (42 loc) · 1.36 KB

README.md

File metadata and controls

56 lines (42 loc) · 1.36 KB
Raw

Closest Pair Problem

Tugas Kecil 2 IF2211 Strategi Algortima : Algoritma Divide and Conquer

General Information

This repository contains the implementation of Divide and Conquer Algorithm in Closest Pair Problem

Technology Used

  • Python
  • pip numpy library
  • pip matplotlib.pyplot library

Contributors

NIM Name
13521019 Ditra Rizqa Amadia
13521024 Ahmad Nadil

Project Structure

.
│   README.md
│
├───src                    # Source code
│    ├── ClosestPair.py
│    ├── Euclidean.py
│    ├── main.py
│    ├── Plot.py
│    ├── Sort.py
│    ├── Splash.py
│    └── System.py
│    
└───doc                    # Documentation

How To Run?

  1. To run the program, in this repository directory, use this command :

    python src/main.py

  2. Input the number of points (n) and the dimension of the points (d)

  3. Wait for the program to calculate the closest distance from the given randomized points

  4. If the points are in 2 or 3 dimension, it will plot out the points

Additional Notes

  1. This program is created and tested using Python version 3.9.9

  2. If you haven't installed the required library, please go ahead install it first using these command:

    • numpy

    pip install numpy

    • matplotlib

    pip install matplotlib