{"id":1194,"date":"2017-01-24T01:51:23","date_gmt":"2017-01-24T01:51:23","guid":{"rendered":"https:\/\/courses.lumenlearning.com\/waymakermath4libarts\/?post_type=chapter&p=1194"},"modified":"2019-05-30T16:32:01","modified_gmt":"2019-05-30T16:32:01","slug":"why-it-matters-graph-theory","status":"publish","type":"chapter","link":"https:\/\/courses.lumenlearning.com\/waymakermath4libarts\/chapter\/why-it-matters-graph-theory\/","title":{"raw":"Why It Matters: Graph Theory","rendered":"Why It Matters: Graph Theory"},"content":{"raw":"

Why understand graph theory?<\/h2>\r\n\"Silhouette<\/a>You shined your shoes and packed your briefcase. \u00a0Now it\u2019s time to stop in at each of your clients now that you are the main sales representative for your company. \u00a0You have nine clients in the same region, and you have mapped them out by determining the time it will take you to get from one to the other in minutes. \u00a0You labeled the clients A through I, and your original plan was to visit them in alphabetical order. \u00a0Sounds easy enough. \u00a0The problem is that when you finish up with client G, you realize you left a very important sample back at Client C. \u00a0How can you determine the shortest path back? \u00a0And then once you get it, how can you decide the fastest route to your next client?\r\n\r\n \r\n\r\nYou can start by making a diagram showing the travel time\u00a0between each client. \u00a0However, there are multiple paths that are possible from any one client to another. Your diagram looks a bit overwhelming - it\u00a0isn\u2019t immediately\u00a0obvious which route would be the fastest.\r\n\r\n\"Graph<\/a>\r\n\r\n \r\n\r\nFortunately, you\u2019ll learn how to solve the problem as you complete this module. \u00a0You will figure out how to interpret diagrams such as this and use them to make logical decisions, such as which way to go to keep your clients happy and close the deal.\r\n","rendered":"

Why understand graph theory?<\/h2>\n

\"Silhouette<\/a>You shined your shoes and packed your briefcase. \u00a0Now it\u2019s time to stop in at each of your clients now that you are the main sales representative for your company. \u00a0You have nine clients in the same region, and you have mapped them out by determining the time it will take you to get from one to the other in minutes. \u00a0You labeled the clients A through I, and your original plan was to visit them in alphabetical order. \u00a0Sounds easy enough. \u00a0The problem is that when you finish up with client G, you realize you left a very important sample back at Client C. \u00a0How can you determine the shortest path back? \u00a0And then once you get it, how can you decide the fastest route to your next client?<\/p>\n

 <\/p>\n

You can start by making a diagram showing the travel time\u00a0between each client. \u00a0However, there are multiple paths that are possible from any one client to another. Your diagram looks a bit overwhelming – it\u00a0isn\u2019t immediately\u00a0obvious which route would be the fastest.<\/p>\n

\"Graph<\/a><\/p>\n

 <\/p>\n

Fortunately, you\u2019ll learn how to solve the problem as you complete this module. \u00a0You will figure out how to interpret diagrams such as this and use them to make logical decisions, such as which way to go to keep your clients happy and close the deal.<\/p>\n\n\t\t\t

\n\t\t\t

Candela Citations<\/h3>\n\t\t\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t\t\t\t
CC licensed content, Original<\/div>