# lecture25 - CSCI-255 Advanced Data Structures Lecture 25...

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

CSCI-255 Advanced Data Structures Lecture 25

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Graphs b How would you represent the following? s A chart of driving distances between cities in Canada s A network s The prerequisite relationship between CS classes b These problems have similar structure: s A collection of objects (cities, computers, classes) connected in some way (roads, cables, precedence relationship)
Graphs • G = (V, E) – V = nodes, E = edges between pairs of nodes – Captures pairwise relationship between objects – Graph size parameters : n = |V|, m = |E| – Undirected graphs : edges are sets of two nodes {u, v} – Directed graphs : edges are ordered pairs (u, v) V = { 1, 2, 3, 4, 5, 6, 7, 8 } E = { {1,2}, {1,3}, {2,3}, {2,4}, {2,5}, {3,5}, {3,7}, {3,8}, {4,5}, {5,6} } n = 8 m = 11

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Some Graph Applications transportation Graph street intersections Nodes Edges highways communication computers fiber optic cables World Wide Web web pages hyperlinks social people relationships food web species predator-prey software systems functions function calls scheduling tasks precedence constraints circuits gates wires
• Node

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 11/26/2009 for the course MATH AND C CSCI255 taught by Professor Dr.ikergondraluja during the Spring '09 term at St. Francis Xavier, Antigonish.

### Page1 / 16

lecture25 - CSCI-255 Advanced Data Structures Lecture 25...

This preview shows document pages 1 - 6. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online