Insert {@link Mark} object into table @param mark {@link Mark} instance

Create {@link Mark} object in storage @param mark {@link Mark} instance

Create {@link Mark}s table @see sqlDriver#createTable(String, String) @see Options#DB_NAME

Create {@link Mark}s table @see dbDriver#createTable(String, String) @see Options#DB_NAME

Insert {@link Student} object into table @param student {@link Student} instance

Create and save {@link Student} object in storage @param student {@link Student} instance

Insert {@link Student} object into table @param student {@link Student} instance

Create {@link Student}s table @see sqlDriver#createTable(String, String) @see Options#DB_NAME

Create {@link Student}s table @see Driver#createTable(String, String) @see Options#DB_NAME

Create {@link Student}s table @see dbDriver#createTable(String, String) @see Options#DB_NAME

Create table @see Options#DB_NAME

find min distance for all nodes from s :param graph: adjacency list of Edge objects :param start: start node :return: prev -

Render graph to png and save to filesystem :param m: flag to open image in new window :param path: Hamilton cycle for TSP

Drop database if exist, and create new @see Options#DB_NAME

Drop database if exist, and create new @see Options#DB_NAME

Drop database if exist, and create new @see Options#DB_NAME

Gauss–Jordan elimination

parse '155.79.209.96/23' to ip and mask :param ip_with_mask: string address with mask after slash :return: dict result string ip,

find min distance for all nodes :param d: matrix adjacency with distance :return: dist - matrix adjacency with shortest distance

Method for init dummy students data @return {@link ArrayList} of {@link Student}s

Method for init dummy students data @return {@link ArrayList} of {@link Student}s

Select all {@link Student}'s objects from test.db @return <pre>{@code ArrayList<Student>}</pre> {@link Student}'s objects

extract net and host parts of ip with mask info :param ip: string :param mask: string :return: string net, string host, int net_count

Count number of cols and rows for topology :param rows: number of rows :param size: number of process :return: number of rows and col

* generate random number in [-100, 100] */

Return incoming edges for v :param v: node :return: list of Edge object's

Generate list of round keys :param key: algorithm key, string of KEY_LENGTH size :return: array of [ROWS_NUMxCOLS_NUM] size