czgdp1807

Add flake8 quality checks to .travis.yml

6

#### Description of the problem #### Example of the problem #### References/Other comments

Implicit Graph

2

#### Description of the problem Currently, we have Graphs with all the edges and vertices stored in memory. This is good for small finite graphs. But for use cases like...

Add Edmond's algorithm

20

#### Description of the problem > In graph theory, Edmonds' algorithm or Chu–Liu/Edmonds' algorithm is an algorithm for finding a spanning arborescence of minimum weight (sometimes called an optimum branching)....

Add Pairing Heap

11

#### Description of the problem #### Example of the problem #### References/Other comments .. [1] https://en.wikipedia.org/wiki/Pairing_heap .. [2] https://github.com/codezonediitj/pydatastructs/wiki/Plan-of-Action-for-the-Projects

Add m-ary trees

28

#### Description of the problem Adding m-ary trees will be a nice idea. May be a array based(allows printing the trees) or pointer(better space utilisation) or both would be better....

Add Fibonacci Heap

13

#### Description of the problem #### Example of the problem #### References/Other comments Can be done only after #36 https://en.wikipedia.org/wiki/Fibonacci_heap

Add KD Trees

5

#### Description of the problem K dimensional trees is a quite important data structure for storing high dimensional data. This issue aims at adding the same. The task is planned...

Modifying code to use, `typing` module.

6

#### Description of the problem From now onwards, the new code should use `typing` module and the existing code in `master` should be modified to use `typing` module. #### Example...

Allow dynamic graphs with Adjacency Matrix

3

#### Description of the problem With the merging of #225 Adjacency matrix will allow dynamic graphs. So, the following methods should be defined, 1. `add_edge` 2. `remove_edge` Along with defining...

Allow using array for constructing binary trees

9

#### Description of the problem Idea of using arrays for constructing binary trees originated from https://github.com/codezonediitj/pydatastructs/issues/38#issuecomment-562864441 which uses arrays for constructing binary heaps. The challenge is to make the change...