About our Team

2019.11.05 :octocat: #L7

Index

• Members

• About project

• Tests

  • Use unittest
  • Use pytest

• Install

• Uninstall

• Activities

  • Code Contribution
  • Creating Documents
  • Creating Team Static Page

• New or Edited Files

  • New Algorithms
  • Another Files

• Wiki

• • *

Members

About Project

Our project based on algorithms.

Pythonic Data Structures and Algorithms

Minimal and clean example implementations of data structures and algorithms in Python 3.

Tests

Use unittest

For running all tests write down:

$ python3 -m unittest discover tests

For running some specific tests you can do this as following (Ex: sort):

$ python3 -m unittest tests.test_sort

Use pytest

For running all tests write down:

$ python3 -m pytest tests

Install

If you want to use the API algorithms in your code, it is as simple as:

$ pip3 install algorithms

You can test by creating a python file: (Ex: use merge_sort in sort)

from algorithms.sort import merge_sort

if __name__ == "__main__":
    my_list = [1, 8, 3, 5, 6]
    my_list = merge_sort(my_list)
    print(my_list)

Uninstall

If you want to uninstall algorithms, it is as simple as:

$ pip3 uninstall -y algorithms

Activities

Code Contribution

• Add Algorithms

  • Not on this project
  • To resolve issues

• Improve Algorithms

  • Increase algorithm speed
  • Use less memory space

Creating Documents

• How the algorithms work
• Association with the issue
• Compared to traditional algorithms

Creating Team Static Page

• Our static page summing-up our activities.
• This is our static page link

-> 가장 아름다운 파이썬 알고리즘 라이브러리

Screenshots

New or Edited Files

New Algorithm List

• maths

  • find_order_simple.py
  • find_primitive_root_simple.py
  • gcd.py
  • diffie_hellman_key_exchange.py

• network_flow

  • maximum_flow.py

• strings

  • knuth_morris_pratt.py

• bfs

  • count_islands.py

• dfs

  • maze_search.py

    Another Files

• maths

  • init.py(code)

• graph

  • init.py(add_network_flow)

• tests

  • test_maths.py(add_find_order)
  • test_maths.py(add_gcd_bits)
  • test_graph.py(add_network_flow)

• bit

  • init.py(code)
  • trailing_zero.py(code)
• • *

Wiki

Our wiki page is here.