Coffee and Graph Theory
dc.contributor.author | Lopez, Estuardo R. | |
dc.date.accessioned | 2023-08-14T16:07:37Z | |
dc.date.available | 2023-08-14T16:07:37Z | |
dc.date.issued | 2023 | |
dc.identifier.uri | http://hdl.handle.net/20.500.12648/11728 | |
dc.description.abstract | Abstract With the amount of revenue that coffee brings in, companies like Starbucks, or Dunkin can create multimillion dollar companies. Due to the fact that corporations like Starbucks and Dunkin, have set rules on how to run a company, people like myself wonder “How do they run and operate as a company?”. Specifically, how do companies deliver products to their retail stores, without losing revenue? The easy answer is delivery trucks, and the longer answer is Graph Theory. Specifically, Dijkstra’s Algorithm is a common algorithm that many use daily, the main algorithm used in the modern-day GPS. Is there a way where we can find the fastest route from a warehouse to a retail store using Dijkstra’s algorithm? Instead of using code to find it, the more interesting way is using math to calculate the routes. The Algorithm was originally used as a math-based algorithm, but now it is geared toward computer-related algorithms. | |
dc.subject | First Reader Irina R. Shablinsky | |
dc.subject | Senior Project | |
dc.subject | Semester Spring 2023 | |
dc.title | Coffee and Graph Theory | |
dc.type | Senior Project | |
refterms.dateFOA | 2023-08-14T16:07:37Z | |
dc.description.institution | Purchase College SUNY | |
dc.description.department | Mathematics & Computer Science | |
dc.description.degreelevel | Bachelor of Arts | |
dc.description.advisor | Shablinsky, Irina R. | |
dc.date.semester | Spring 2023 | |
dc.accessibility.statement | Purchase College - State University of New York (PC) is committed to ensuring that people with disabilities have an opportunity equal to that of their nondisabled peers to participate in the College’s programs, benefits, and services, including those delivered through electronic and information technology. If you encounter an access barrier with a specific item and have a remediation request, please contact lib.ir@purchase.edu. |