Greedy Algorithm to find the maximum number of mutually compatible jobs
-
Updated
Aug 7, 2017 - Java
Greedy Algorithm to find the maximum number of mutually compatible jobs
Algorithm to find possible sets in the game Set using an iterative implementation of n choose 3 for combinations
Finds a Topological Ordering of vertices in a Directed Acyclic Graph
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
A C# Comparer to sort lists of data that could be either numeric of string replacing the default alphabetical sort which doesn't always work for numbers.
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
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)
C++ implementation of the board game Rush Hour (Windows exe download only)
Greedy Algorithm to minimize lateness when scheduling jobs on a processor
Command line implementation of the board game Mastermind for a Software Engineering class
Watch all videos from a channel in chronological order (oldest to newest)
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 find a minimum spanning tree in an undirected graph by deleting heaviest edges unless it would disconnect the graph
Network Flow: Given a directed graph with edge capacities and vertex demands, is there a circulation of flow?
Add a description, image, and links to the noahpatullo topic page so that developers can more easily learn about it.
To associate your repository with the noahpatullo topic, visit your repo's landing page and select "manage topics."