Movatterモバイル変換

[0]ホーム
URL:

Skip to content
Search Gists
Sign in Sign up

Instantly share code, notes, and snippets.

View DanilAndreev's full-sized avatar
🙃
nevertheless

Danil Andreev DanilAndreev

🙃
nevertheless
Senior 3D Engineer@ZibraAI
View GitHub Profile
@DanilAndreev
DanilAndreev /cli_parser.py
CreatedNovember 10, 2021 13:29
Simple CLI parser.
importsys
classProgramArguments:
def__init__(self):
self.args= []
self.flags=dict()
defis_set(self,flag:str)->bool:
returnstrinself.flags
@DanilAndreev
DanilAndreev /DockerCheatsheet.md
Last activeSeptember 22, 2021 14:55
Docker cheatsheet
linux-logodocker-logo

Remove all images at once

docker rmi$(docker images -q)
@DanilAndreev
DanilAndreev /maya2019install.sh
CreatedJune 4, 2021 12:20— forked fromegetun/maya2019install.sh
Autodesk Maya 2019 Installation Bash Script v1.0 for Ubuntu 18.04 / Tested on KDE Neon 5.14
#!/bin/bash
#Deniz Ege Tunçay, 2019
#nrtkbb, 2018
#Neal Burger, 2017
#Autodesk Maya Installation Bash Script v1.0 for Ubuntu 18.04 based Linux Distributions
#if you have any issues, feel free tweet me // @egetun
#Make sure we’re running with root permissions.

Introduction

Kruskal's algorithm - efficient algorithm for constructing the minimum spanning tree of a weighted connected undirectedgraph. The algorithm is also used to find some approximations for the Steiner problem.

Task

The algorithm solves the problem of finding the minimum spanning tree (MST).

@DanilAndreev
DanilAndreev /Linux docker install script.md
Last activeApril 28, 2021 12:43
Docker setup bash script

Overview

This script will automatically installdocker anddocker-compose and configure them for use withoutcommandsudo.

Usage

  1. Copysetup.sh to your OS in any available way.

Introduction

In this article, I want to talk about one of the easiest ways to find paths for a two-dimensional map. I do not takeinto account the greedy search algorithm because of its simplicity and not optimality. Today we will talk about thealgorithm for finding the shortest paths from one vertex of the graph to all the others, proposed by the DutchscientistEdsger Wybe Dijkstra. Also, I will show youA*algorithm, based onDijkstra.

@DanilAndreev
DanilAndreev /Rainbow tables (hash-chains).md
Last activeOctober 30, 2025 08:41
Rainbow tables (hash-chains)

Introduction

A lot of water has flowed under the bridge since then, when the theme of rainbow tables was at its peak, but,nevertheless, the idea is entertaining. It is about this kind of intricate tables that I want to tell you.

Theory

Brute force method

@DanilAndreev
DanilAndreev /Reverse Polish Notation (RPN).md
Last activeMay 25, 2021 18:58
Reverse Polish notation converting and calculating

There is an ancient tradition in mathematics to place an operator between the operands(x + y) rather than afterthe operandsxy+. Form with an operator between operands is calledinfix notation. The form with an operatorafter the operands is calledpostfix, orReverse Polish notation. It has a number of advantages over infixnotation when expressing algebraic formulas:

  1. Any formula can be expressed without parentheses.
  2. It is convenient for calculating formulas on stacked machines.
  3. Infix operators have precedence that is arbitrary and undesirable.
[8]ページ先頭
©2009-2025 Movatter.jp