*This preview shows
pages
1–7. Sign up to
view the full content.*

This ** preview**
has intentionally

**sections.**

*blurred***to view the full version.**

*Sign up*This ** preview**
has intentionally

**sections.**

*blurred***to view the full version.**

*Sign up*This ** preview**
has intentionally

**sections.**

*blurred***to view the full version.**

*Sign up*
**Unformatted text preview: **Matrix Operations
A B C D Replace `add' by `OR' and `Multiply' by `AND' Paths of length 2 or less Matrix operations on graphs
A B C D Replace `add' by `OR' and `Multiply' by `AND' Existence of paths containing exactly two edges Matrix operations on graphs
A B C D Keep `add' replace `Multiply' by `AND' Number of paths containing exactly two edges Matrix operations on graphs
A B
Keep `add' replace `Multiply' by `AND' C D Number of paths containing exactly two edges Matrix operations
A A F 2 3 2 4 1 6 3 B A B 0 B 3 0 6 C D E 0 1 2 1 0 5 4 0 2 F 0 C D E 3 Edge connectivity
A A B 0 B 1 0 1 C D E 0 1 1 1 0 1 1 0 1 F 0 E 5 D 1 C F Distance Matrix C D E F 1 A F 2 3 2 4 1 6 3 B Matrix operations E 5 D 1 C (4,3,2), (5, 2,1), (6,4,5) (2, 43) (3,42) (4,32) (1,52) (5,12) (2, 51) (5,46) (6,45) (4,56) table ...

View Full
Document