[Subject home], [FAQ], [progress],   Bib', Alg's,  C , Java - L.A., Sunday, 28-Nov-2021 04:20:00 AEDT
Instructions: Topics discussed in these lecture notes are examinable unless otherwise indicated. You need to follow instructions, take more notes & draw diagrams especially as [indicated] or as done in lectures, work through examples, and do extra reading. Hyper-links not in [square brackets] are mainly for revision, for further reading, and for lecturers of the subject.

Graphs:   Introduction

The bad news?


(also many other special types of graph)
-

Undirected Graph

-

Directed Graph

-

Weighted Undirected Graph

-

Weighted Directed Graph

Formally a Graph, G, is:

Undirected Graphs

(Edge-) Weighted Graphs

Graphs

[lecturer: derive a graph from some real example; class: take notes!]
©
L
.
A
l
l
i
s
o
n

A Graph G = < V, E >

Graph by Adjacency Matrix:

[fill in missing bits]
- directed, by adjacency matrix:
  1 2 3 4 5 6
1 ......
2 ......
3 ......
4 ......
5 ......
6 ......
[fill in the missing bits]
- -undirected, by adjacency matrix:
 123456
1 .
2 ..
3 ...
4 ....
5 .....
6 ......
Undirected graph - adjacency matrix is symmetric, or lower- (or upper-) triangular.

Adjacency Matrices of (Un)weighted graphs,   a tricky point:

[fill in missing bits]
- by adjacency lists:
1: ----> [__, -]-----> nil

2: ----> [__, -]-----> nil

3: ----> [__, -]-----> nil

4: ----> [__, -]-----> [__, -]-----> [__, -]-----> nil

5: ----> [__, -]-----> [__, -]-----> [__, -]-----> nil

6: ----> [__, -] ----> nil

Graph Summary

Read about: path problems in Graphs.
© L.Allison, Sunday, 28-Nov-2021 04:20:00 AEDT users.monash.edu.au/~lloyd/tilde/CSC2/CSE2304/Notes/14graphs.shtml
Computer Science, Software Engineering, Science (Computer Science).