harvard-cs50ai-six-degrees-problem viniciusfinger · COMPLETED
According to the Six Degrees of Kevin Bacon, anyone in the Hollywood can be connected to Kevin Bacon within six steps. In this problem, we’re interested in finding the shortest path between any two actors by choosing a sequence of movies that connects actors.
github.com/viniciusfinger/harvard-cs50ai-six-degrees-problem · ★ 3 · Forks 0 · Size 21.7 MB
SUMMARY
Technologies 2
Scored 2
Observed 2
Practices 6
Evidence 2
Skips 0
COVERAGE
Analyzed 10 files · 7 commits · 0 API calls
TECHNOLOGIES & DEPTH
Markdown LANGUAGE Depth 70
1 files · PRODUCTION
Python LANGUAGE Depth 70
2 files · PRODUCTION
PRACTICES
documentation · observedautomated_tests · absentcontinuous_integration · absentcontainerization · absentlinting · absentformatting · absent
ACTIVITY & OWNERSHIP
First commit 2024-07-08
Last commit 2024-07-08
Active months 1
Commits 7