Network Flow: Given a directed graph with edge capacities and vertex demands, is there a circulation of flow?

Greedy Algorithm to find a minimum spanning tree in an undirected graph by deleting heaviest edges unless it would disconnect the graph

Approximation Algorithm for the NP-Complete problem of finding a vertex cover of minimum weight in a graph with weighted vertices. Guarantees an answers at most 2 times the optimal minimum weighted vertex cover

Greedy Algorithm to minimize lateness when scheduling jobs on a processor

Finds how similar 2 lists of rating are using the Divide and Conquer approach. Extension of MergeSort that actually displays the specific inversions as well as just counting the total number.

A list of projects I've worked on. GitHub's organization is lacking in my opinion, so this serves as an index & root of all my work (I'm Noah Patullo, not Pattullo or Patulo. I have a unique name & this should help clarify who I am)

Command line implementation of the board game Mastermind for a Software Engineering class

Approximation Algorithm for the NP-Complete problem of balancing job loads on machines. Does not guarantee an optimal solution, but instead, a solution is within a factor of 1.5 of the optimal solution

Watch all videos from a channel in chronological order (oldest to newest)

Algorithm to find possible sets in the game Set using an iterative implementation of n choose 3 for combinations

Shortest Paths from every vertex to a goal vertex allowing negative-weight edges (when Dijkstra's fails)

Finds a Topological Ordering of vertices in a Directed Acyclic Graph

Greedy Algorithm to find the maximum number of mutually compatible jobs

Autofill NetID when logging into Blackboard & syncs across signed-in Chrome browsers

Reveal password fields with a keyboard shortcut or click of the Extension icon

Application of Breadth-First Search to see if a directed graph is Strongly Connected

A GPA calculator in JavaFX attempting to use the Model View Controller (MVC) pattern