c07_graph_soft_handout

c07_graph_soft_handout - 9/24/2009 Graphrepresentations V

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
9/24/2009 1 Graph representations V number of vertices (nodes), E number of edges Edge array size: E Adjacency matrix size: V * V Adjacency lists size: V + E “pure” representations Adjacency matrix a b c d e f g h a 0 1 0 0 1 0 1 0 b 1 0 1 0 0 0 0 1 c 0 1 0 1 0 1 1 0 d 0 0 1 0 1 0 0 0 e 1 0 0 1 0 0 0 0 f 0 0 1 0 0 0 1 0 g 1 0 1 0 0 0 0 0 h 0 1 0 0 0 0 0 0 Adjacency List a: b e g b: c h c: b g d: c e e: a d f: c g g: a c f h: b Representation properties umber of vertices E umber of edges V - number of vertices E - number of edges matrix list edge array space V 2 V+E E find edge 1 V E sert edge 1 1 insert edge 1 1 path v to w ? V 2 V+E E lgV
Background image of page 1

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

View Full DocumentRight Arrow Icon
9/24/2009 2 Graph processing software tools UI programs: ajek ED CINET GUI programs: Pajek, yED, UCINET Command line programs: graphviz, R, statnet Software Libraries: LEDA, networkx, igraph Input: user input (mouse clicks) or files Most file formats are text, graph formats , gp Output: images or data files
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 5

c07_graph_soft_handout - 9/24/2009 Graphrepresentations V

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online