COMP6049 – Algorithm Design
and Analysis
Topic 6 – Analysis of Data Structures: Graph (Basic Search &
Traversal), Priority Queue, and Heap
, Outline Materials
• Types of graph
• Implementation of graph using cost adjacency matrix
• Implementation of graph using cost adjacency list
Bina Nusantara University ISYS6197 2
, Outline Materials
• Tree traversal
• Depth First Search
• Breadth First Search
• DFS and BFS in Tree
• DFS and BFS in Graph
Bina Nusantara University ISYS6197 3
, Outline Materials
• Concept of priority queue
• Example of priority queue in our life
• Concept of heap
• Operations in heap
• Heapsort
Bina Nusantara University ISYS6197 4
and Analysis
Topic 6 – Analysis of Data Structures: Graph (Basic Search &
Traversal), Priority Queue, and Heap
, Outline Materials
• Types of graph
• Implementation of graph using cost adjacency matrix
• Implementation of graph using cost adjacency list
Bina Nusantara University ISYS6197 2
, Outline Materials
• Tree traversal
• Depth First Search
• Breadth First Search
• DFS and BFS in Tree
• DFS and BFS in Graph
Bina Nusantara University ISYS6197 3
, Outline Materials
• Concept of priority queue
• Example of priority queue in our life
• Concept of heap
• Operations in heap
• Heapsort
Bina Nusantara University ISYS6197 4