vermillio Goto Github PK
Name: Anna Khodyreva
Type: User
Bio: Student at Taras Shevchenko National University of Kyiv
Location: Kyiv, Ukraine
Name: Anna Khodyreva
Type: User
Bio: Student at Taras Shevchenko National University of Kyiv
Location: Kyiv, Ukraine
Contains n log(n) stable constant memory sorting, o(n) stable sorting and o(n) constant memory sorting.
Tasks from Algorithms & Complexity course 2nd grade.
Find all hammocks in a graph given by adjacency list. A hammock is a graph subgraph for which there are two vertices belonging to it (input and output), such that: -All arcs from the entrance lead into a hammock -Any path leading to the hammock from the outside passes through the entrance. -All arcs from the exit come from the hammock. -Any way, going from the hammock from the outside passes through the exit. The hammock is interesting in that it can be pulled together into one vertex, without violating the connectivity relations between the remaining vertices of the graph. For this reason, the factorization of a complex harph (for example, a flow graph program) for the allocation of individual functions.
Implementation of two balanced tree types: AVL and RB.
In a circle, N coins are placed with coats of arms and M coins with coats of arms down. Going round in a clockwise direction, each S-th coin is inverted. For the first time the account begins with the coat of arms. In what order should the coins be placed, so that after the K moves there are L coins, which are to be put upwards.
Convolutional neural network implementation for NLP tasks such as sentiment analysis and more generally, labelled documents classification
This program implements approximation of cosinus with given precision using Taylor series.
Interpolation. The function f (x) is given by a table of its values. Construct a cubic spline and evaluate the value of the function at the specified point x0. (x : -0.5 1.5 2.0 3.5 6.0 9.0, f(x) : 2.5 6 -3.5 -7 -10 2) x0 = 2.5
Implementation of d-ary heap, including procedures Extraxt_Max, Insert, Increase_Key
We call the editing step a transformation of the word x into the word y, that the words x and y belong to the dictionary and the word x can be transformed into the word y by adding, deleting or changing one letter. Conversions "dig" to "dog" and "dog" to "do" are editing steps. A ladder of editing steps is a sequence of words w1, w2, ..., wn sorted in the lexicographic order such that the transformation wi into wi + 1 is the step of the transformation for any i from 1 to n - 1. For a given dictionary find the largest ladder of editing steps. Input consists of a dictionary : a set of words in the lower register in lexicographical order one word per line. Each word does not exceed 16 letters, and in the dictionary no more than 25 000 words.
Finds Euler cycle in given graph (adjacency list).
Given two lines a and b, output a string x of maximum length, consisting of, letters such that there exists a permutation x that is a substring permutation a and at the same time being a permutation substring b.
This program finds a set of fundamental cycles of a connected undirected graph given by an incidence table. (uses DFS)
This program finds the shortest distance between two vertices in the graph (Dijkstra algo), all possible paths between these two vertices in the graph not intersecting by a) edges b) vertices.
Admission project for data science school.
Solution for well-known Commivoyager problem using genetic algorithm.
Implementation of two Gomory's Cutting Plane methods for solving linear programming problems.
Sequence of different values can be sorted by ascending if there is defined the ratio of order (<) above these values. For example, the sequence A, B, C, D is sorted in ascending order means that A < B, B < C and C < D. Given a set of relations of the form A < B, it is required to find out whether it is possible to form an increasing sequence.
This program finds bicomponents of graph (adjacency list).
Using the BFS method, find the shortest path from the initial to any arbitrary vertex of the connected undirected graph specified by the incidence lists (weight of all edges is equal).
There are N people and a rectangular table A [1: N, 1: N], the element A [i, j] is 1 if the person i is familiar with the person j, A [i, j] = A [j, i]. Can people be divided into 2 groups, so that in each group there are only strangers?
This repository contains solved task from kaggle.com
This is an implementation of multithreaded huffman compressing algorithm.
Non-multithreaded version of Huffman algo (multithreaded version is published earlier).
This program interactively creates a table that, in turn (also in interactive mode) can: 1 Create, add, delete columns, rows and cells 2 Read and write to a file 3 Edit columns. Columns can have types: integer , short, char, string, double, bool. Types can be changed and transformed if possible, i.e. those that are possible. For example, short to integer.
Language is described in readme.txt
This is the program that searches the root tree of subtrees that are isomorphic to the specified target tree. Uses the algorithm for full traversal of the tree with backtracking.
L system contains of axiom, rules and interpretation. Given it, build the fractal of given degree.
A declarative, efficient, and flexible JavaScript library for building user interfaces.
🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
An Open Source Machine Learning Framework for Everyone
The Web framework for perfectionists with deadlines.
A PHP framework for web artisans
Bring data to life with SVG, Canvas and HTML. 📊📈🎉
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
Some thing interesting about web. New door for the world.
A server is a program made to process requests and deliver data to clients.
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
Some thing interesting about visualization, use data art
Some thing interesting about game, make everyone happy.
We are working to build community through open source technology. NB: members must have two-factor auth.
Open source projects and samples from Microsoft.
Google ❤️ Open Source for everyone.
Alibaba Open Source for everyone
Data-Driven Documents codes.
China tencent open source team.