Graph Types
1.Graph Terminology
2.Intuition Behind Graphs
3.Data Structures for Graphs
an Adjacency Matrix
4.Data Structures for Graphs
An Adjacency List
5.Graph Connectivity
Graph Traversal Techniques
6.Graph Searching
Minimum Spanning Tree
Prim’s Algorithm
Kruskal’s algorithm
Algorithm Merge Sort
.
Example: Find 9
Divide: Check middle element.
Conquer: Recursively search 1subarray.
Problem: Compute an, where n ∈N.
Naive algorithm: Θ(
n).
Divide and Conquer algorithm
The straightforward method to perform a matrix multiplication
requires O(n
3) time.
8 mults
4 adds
e real shortest path is
Given a sequence of matrices
A1
A2…An , and dimensions
p0
p1…pn
where
Ai is of dimension
pi-1 x
pi , determine multiplication sequence
that minimizes the number of operations.
Given a knapsack with maximum capacity
W, and a set
S consisting
of
n item