Please enable JavaScript.

Coggle requires JavaScript to display documents.

Graph Search (Lecture 3) - Coggle Diagram

- - - - N is set of nodes
      - A is ordered pair called arc
        
        N1 -> N2 (they are neighbours)
      - Solution - sequence of nodes from start node to end node
      - Path - sequence of nodes <n1,n2,..., nk> where n1->n2 is arc
    - - Any search problem can be mapped into directed graph
        
        Neighbours are the successor of the state
        
        successor function result
        
        Optional: Each arc can have their own actions available
        
        Nodes are the state
        
        Search problem with Cost
        
        Add cost to each arc (n1, n2)
        
        The cost of the path is total sum cost of arc
        
        Optimal solution is one with lowest cost
        
        The cost modelling depends on you and the problem