Projeto-IF684-2022 JDaniloC · PARTIAL
Projeto com objetivo de desenvolver o algoritmo A* para encontrar o caminho menos custoso para estações de metrô.
github.com/JDaniloC/Projeto-IF684-2022 · ★ 1 · Forks 0 · Size 256 KB
SUMMARY
Technologies 11
Scored 10
Observed 10
Practices 6
Evidence 13
Skips 1
COVERAGE
Analyzed 24 files · 39 commits · 0 API calls
TECHNOLOGIES & DEPTH
JSON LANGUAGE Depth 70
1 files · PRODUCTION
Markdown LANGUAGE Depth 70
1 files · PRODUCTION
YAML LANGUAGE Depth 70
1 files · PRODUCTION
JavaScript LANGUAGE Depth 70
1 files · PRODUCTION
Python LANGUAGE Depth 70
6 files · PRODUCTION
pip BUILD_TOOL Depth 80
1 files · CONFIGURATION
npm BUILD_TOOL Depth 80
1 files · CONFIGURATION
Yarn BUILD_TOOL Depth 80
1 files · CONFIGURATION
Flask FRAMEWORK Depth 54
1 files · PRODUCTION
lxml LIBRARY Depth —
0 files · config only
pytest TESTING Depth 37
1 files · TEST
PRACTICES
documentation · observedautomated_tests · observedcontinuous_integration · observedcontainerization · absentlinting · absentformatting · absent
ACTIVITY & OWNERSHIP
First commit 2022-02-17
Last commit 2026-04-21
Active months 5
Commits 39