Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
E
Exhaustive Search In Class
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Package registry
Container registry
Model registry
Operate
Environments
Terraform modules
Monitor
Incidents
Service Desk
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
SOFT Core
SOFT 260
Exhaustive Search In Class
Commits
84f194d4
Commit
84f194d4
authored
2 years ago
by
Brady James Garvin
Browse files
Options
Downloads
Patches
Plain Diff
Fixed line wrapping mistakes.
parent
c69b1068
No related branches found
No related tags found
No related merge requests found
Changes
1
Show whitespace changes
Inline
Side-by-side
Showing
1 changed file
exhaustive-search.md
+6
-5
6 additions, 5 deletions
exhaustive-search.md
with
6 additions
and
5 deletions
exhaustive-search.md
+
6
−
5
View file @
84f194d4
...
@@ -67,8 +67,9 @@ function color(graph) {
...
@@ -67,8 +67,9 @@ function color(graph) {
### Subproblem
### Subproblem
Subproblem: Given an undirected graph and a coloring of its vertices, determine
Subproblem: Given an undirected graph and a coloring of its vertices,
whether the coloring is proper (no adjacent vertices share a color).
determine whether the coloring is proper (no adjacent vertices share a
color).
#### Contract
#### Contract
...
@@ -125,9 +126,9 @@ function knapsack(items, getWeight, weightLimit, getValue) {
...
@@ -125,9 +126,9 @@ function knapsack(items, getWeight, weightLimit, getValue) {
### Subproblem
### Subproblem
Subproblem: Given a universe of items, a function to compute the
weights of sets
Subproblem: Given a universe of items, a function to compute the
of items, and a weight limit, find the set of all sets
of items not exceeding
weights of sets
of items, and a weight limit, find the set of all sets
the weight limit.
of items not exceeding
the weight limit.
#### Contract
#### Contract
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment