← Back to all work
FoundationsArchive

Sixdegrees

An earlier C++ graph project that finds the shortest chain of movie collaborations between two actors.

Make the path explainable

Sixdegrees represents actors and their shared films as a graph and returns a shortest connection for a requested actor pair. The output includes the movie/actor links, so the result can be followed rather than reduced to a distance alone. It remains in the archive as an example of data-structure and graph-algorithm work.

SCOPE & LIMITATIONS

Limitations

  • Archived project; no current performance benchmark or deployed interface is claimed.

Source code & evidence

Results reflect the linked evidence snapshots. Source artifacts retain their dates and experimental conditions.