[알고리즘] Breath-first-search(너비 우선 탐색)

소개글

알고리즘 시간에 과제로 제출하였던 너비 우선 탐색입니다.
10점 만점에 10점 받았습니다.

The Breath-First Search

Problem: Let n items be given, where each item has a weight and a profit. The
weights and profits are positive integers. Furthermore, let a positive integer W
be given. Determine a set of items with maximum total profit, under the constraint
that the sum of their weights cannot exceed W.

Inputs: positive integers n and W, arrays of positive integers w and p, each indexed
from 1 to n, and each of which is sorted in nonincreasing order according to the
values of p[i]/w[i].

Outputs: an integer maxprofit that is the sum of the profits in an optimal set.

컴파일 실행환경

Microsoft Visual Studio 2008

압축파일 내 파일목록

breath-first-search/breath-first-search/breath-first-search.cpp
breath-first-search/breath-first-search/breath-first-search.vcproj
breath-first-search/breath-first-search/breath-first-search.vcproj.Jun-PC.Administrator.user
breath-first-search/breath-first-search/Debug/breath-first-search.exe.embed.manifest
breath-first-search/breath-first-search/Debug/breath-first-search.exe.embed.manifest.res
breath-first-search/breath-first-search/Debug/breath-first-search.exe.intermediate.manifest
breath-first-search/breath-first-search/Debug/breath-first-search.obj
breath-first-search/breath-first-search/Debug/BuildLog.htm
breath-first-search/breath-first-search/Debug/mt.dep
breath-first-search/breath-first-search/Debug/vc90.idb
breath-first-search/breath-first-search/Debug/vc90.pdb
breath-first-search/breath-first-search.ncb
breath-first-search/breath-first-search.sln
breath-first-search/breath-first-search.suo
breath-first-search.hwp

참고 자료

FOUNDATIONS OF ALGORITHMS(Fourth Edition, Jones and Bartlett)