- Крокодил
- Рукопоп
- Яблоко
- Наполнение бутылки
- Поребрик
- Паутинка
- Минное поле
- Поиск предметов
- 33 несчастья
- Муз. пауза
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# LinkComp - script that finds strongly connected components in a directed graph and visualizes them | |
# Requires `graph.txt` - adjacency matrix that defines the graph | |
import numpy as np | |
import matplotlib.pyplot as plt | |
import networkx as nx | |
import re | |
g = [] | |
ptn = re.compile('[01]') | |
with open('graph.txt') as f: |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
window.addEventListener('error', handleError, true); | |
function handleError(event) { | |
if (event.message) { | |
window.alert('error: ' + event.message + ' at linenumber: ' + event.lineno + ' of file: ' + event.filename); | |
} else { | |
window.alert('error: ' + event.type + ' from element: ' + (event.srcElement || event.target)); | |
} | |
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# ShortestWay - comparator for Dijkstra's and Ford-Bellman's pathfinding algorithms | |
# Requires `graph.txt` - start and end points and an adjacency matrix that defines the graph | |
# Put dashes (-) where there's no way | |
import matplotlib.pyplot as plt | |
import matplotlib.patches as mpatches | |
import networkx as nx | |
from queue import PriorityQueue | |
inf = float('inf') |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# MinSpanTree - Comparator of Kruskal's and Prim's MST searching algorithms | |
# Requires `graph.txt` - an adjacency matrix that defines the graph | |
# Put dashes (-) where there's no way | |
import matplotlib.pyplot as plt | |
import matplotlib.patches as mpatches | |
import networkx as nx | |
from queue import PriorityQueue | |
def matrix_to_graph(matrix): |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Будильник | |
Зарядка | |
Акварель | |
Травма | |
Оригами | |
Пульс | |
Спорт | |
Канатоходец | |
Магнитофон | |
Халат |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Информатика: | |
сипЛЮСПЛЮс | |
переДАЧАДАнных | |
оТРИЦАНие | |
жестКИЙДИск | |
основаНИЕСИСтемы | |
систЕМАСЧИсления | |
аЛГОРИТм | |
таблИЦАИСТинности | |
компьютерНАЯБЕЗопасность |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Овен: PHP | |
Лев: Scala | |
Стрелец: C# | |
Телец: JavaScript | |
Дева: ASM | |
Козерог: Python | |
Близнецы: алгоритмический | |
Весы: Java | |
Водолей: HTML | |
Рак: Pascal |