Scribd Logo
Upload

Welcome to Scribd!

  • Math 6

    Uploaded by

    Nesielin Allera
    6 views1 page
    The document describes a graph representing distances between 5 towns. It asks to use the Brute Force Algorithm to find the most efficient route that passes through all towns starting and ending at Town B. There are 4 possible routes with mirror routes listed in a table along with their total distances. The shortest route is BEDCAB with a total distance of 41.

    Original Description:

    MATH

    Original Title

    MATH 6

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes a graph representing distances between 5 towns. It asks to use the Brute Force Algorithm to find the most efficient route that passes through all towns starting and ending at Town B. There are 4 possible routes with mirror routes listed in a table along with their total distances. The shortest route is BEDCAB with a total distance of 41.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    6 views1 page

    Math 6

    Uploaded by

    Nesielin Allera
    The document describes a graph representing distances between 5 towns. It asks to use the Brute Force Algorithm to find the most efficient route that passes through all towns starting and ending at Town B. There are 4 possible routes with mirror routes listed in a table along with their total distances. The shortest route is BEDCAB with a total distance of 41.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    30 CHAPTER 3.

    GRAPH THEORY

    NAME:

    The graph below represents distances between towns. Use the Brute Force
    Algorithm to find the most efficient route that passes through all 5 towns, and starts
    and ends at Town B. For this problem, there are four routes, each with it’s own mirror
    route. List these routes in the table, and give the total distance.

    BD= 15

    AD= 6

    Route Mirror Route Distance


    BACEDB BDECAB 52
    BCADEB BEDACB 44
    BEDCAB BACDEB 41
    BADCEB BECDAB 45

    You might also like