Geographic Information Systems (GIS)
GIS is one of the many fields that uses discrete math. Graph Theory is a popular topic that is used for the analysis of genetic codes, as well as sequencing and pattern matching. Many people rely on taking the shortest rout to reach their destination. Not only do people rely on using maps, but technology has allowed us to use Global Positioning Systems (GPS) in the car or on out smart phones. Graph theory helps us to determine what should be included or excluded from a map. These short routs make up a minimal spanning network. In Discrete mathematics we can use Prim's Algorithm to create a minimal spanning tree for a given graph. Here is an example below.
First edge: Milwaukee - Indianapolis (cost 274 miles)
Second edge: Indianapolis - Kansas City (cost 482 miles)
Third edge: Indianapolis - Columbus (cost 183 miles)
Fourth edge: Columbus - Detroit (cost 203 miles)
Fifth edge: Columbus - Richmond (cost 479 miles)
Sixth edge: Richmond - Nashville (cost 614 miles)
Total Cost: 274 + 482 + 183 + 203 + 479 + 614 miles
Search when 23/11/2018 10.52 PM
ไม่มีความคิดเห็น:
แสดงความคิดเห็น