Petro Kolosov

Suggest to implement: 1) Kahn Topological Sort (Graph Algorithms) 2) Coin Change Dynamic (Problems) 3) Priority Queue, Based on Heapsort with maintaned Heap property via Floyd's Algorithm (Data Structures)

@siriak Hi, do you need a graph implementation in the Data Structures section? (Via 2D matrix)

Жду мержа этого пра, иначе не могу юзать либу

+1 to this feature request tho