Built something? We create video reels & spotlights for GitHub projects.Promote your project →
Home / Developers / coryplusplus
Developer Profile

coryplusplus

Discovered public repositories for coryplusplus in the GitHub catalog.

↗

coryplusplus/Johnsons-Algorithm

Python - Johnson's algorithm is a way to find the shortest paths between all pairs of vertices in a sparse directed graph. It allows some of the edge weights to be negative numbers, but no negative-weight cycles may exist. It works by using the Bellman–Ford algorithm to compute a transformation of the input graph that removes all negative weights, allowing Dijkstra's algorithm to be used on the transformed graph. It is named after Donald B. Johnson, who first published the technique in 1977.

↗

coryplusplus/TourBoard

C++ - How many possible paths - starting in top left of board - ending on bottom left of board -must go through every square - can move up, down, left, right

FOR MAINTAINERS

Built something? Put it in front of millions of developers.

We make a short reel about your project and post it across YouTube, Instagram, Threads, and X. Send a link, we do the rest.