Scribd Logo
Upload

Welcome to Scribd!

  • Dijkstra'S Shortest Path Lease Give Its Sptset and Distset For Each Step

    Uploaded by

    Bondhon Huda
    13 views2 pages
    This document contains three exercises: 1) Find the shortest path on a graph with 9 vertices and labeled edges using Dijkstra's algorithm, 2) Create a binary tree from the numbers 61, 87, 59, 46, 34, 72, 50, 98, 38, 92, and 3) Research different distance measures in artificial intelligence - Manhattan, Euclidean, Chebyshev, Minkowski, Mahalanobis distances and cosine similarity - to discuss their formulas, advantages, and disadvantages in the next class.

    Original Description:

    Original Title

    execrise 1

    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
    This document contains three exercises: 1) Find the shortest path on a graph with 9 vertices and labeled edges using Dijkstra's algorithm, 2) Create a binary tree from the numbers 61, 87, 59, 46, 34, 72, 50, 98, 38, 92, and 3) Research different distance measures in artificial intelligence - Manhattan, Euclidean, Chebyshev, Minkowski, Mahalanobis distances and cosine similarity - to discuss their formulas, advantages, and disadvantages in the next class.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    13 views2 pages

    Dijkstra'S Shortest Path Lease Give Its Sptset and Distset For Each Step

    Uploaded by

    Bondhon Huda
    This document contains three exercises: 1) Find the shortest path on a graph with 9 vertices and labeled edges using Dijkstra's algorithm, 2) Create a binary tree from the numbers 61, 87, 59, 46, 34, 72, 50, 98, 38, 92, and 3) Research different distance measures in artificial intelligence - Manhattan, Euclidean, Chebyshev, Minkowski, Mahalanobis distances and cosine similarity - to discuss their formulas, advantages, and disadvantages in the next class.

    Copyright:

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

    Exercise 1

    1. Dijkstra’s shortest path


    The following is a graph with 9 vertices, each side identifying the distance. lease give its

    sptSet and distSet for each step.

    • 2. Using the numbers below to create a binary tree

    61,87,59,46,34,72,50,98,38,92

    3. In the next class, we will discuss several distance


    measures in artificial intelligence. Please find relevant
    information for discussion in class, such as the following
    distances:
    1.Manhattan distance
    2.Euclidean distance
    3. Chebyshev distance
    4. Minkowski distance
    5. Mahalanobis distance
    6 .Distance between Han and Ming Dynasties
    7. Cosine similarity
    We will discuss their distance formulas and their
    advantages and disadvantages in class.

    You might also like