Pictures of graphs - PowerPoint PPT Presentation

1 / 16
About This Presentation
Title:

Pictures of graphs

Description:

This 'crazy' version of the classic graph was created to stress ... to the standard DBX debugger. Nodes are drawn with the 'record' shape. Labels of this shape ... – PowerPoint PPT presentation

Number of Views:32
Avg rating:3.0/5.0
Slides: 17
Provided by: Pat376
Category:

less

Transcript and Presenter's Notes

Title: Pictures of graphs


1
Pictures of graphs
2
A 5-regular graph
3
A (non-authoritative) diagram of heritage of the
Unix operating system. This "crazy" version of
the classic graph was created to stress test the
polygon shape generator and color map manager
with random values.
4
The graph file was generated automatically from a
session with the LDBX graphical interface to the
standard DBX debugger. Nodes are drawn with the
'record' shape. Labels of this shape are
interpreted specially as nested horizontal and
vertical box lists formatted as tables. In a
record label, curly braces enclose lists,
vertical bar separates list items, and creates
a port identifier for attaching edges. Edges are
also labeled with 'id' attributes. Though not
demonstrated in this particular file, these
attributes allow referencing multiple (parallel)
edges between the same node pair.
5
This a random subgraph of the Erdos' 2nd
neighborhood Collaboration graph. The size of
this subgraph is about 2500. It illustrates the
shape of the power l aw graph --- an 'octupus'
with a dense core and long legs. The structure
has been proved in a PNAS paper in 2002.
6
This image is a visualization of Jeffrey Heer's
personal friendster network to 3 hops out, an
online social network consisting of Jeffrey, his
"friends", his friends' friends, and his
friends' friends' friends. The resulting networks
consist of 47471 people connected by 432430
friendship relations.
7
2001 computer graphics This large graph shows
the router level connectivity of the Internet as
measured by Hal Burch and Bill Cheswick's
Internet Mapping Project.
8
The graph represents dependencies between
modifications to a large program. Because
testing such programs is difficult and expensive,
the graph was made to discover which subsets of
modifications might be tested separately by
understanding or even eliminating a few key
dependencies.
9
(No Transcript)
10
(No Transcript)
11
(No Transcript)
12
(No Transcript)
13
(No Transcript)
14
(No Transcript)
15
(No Transcript)
16
Thanks to Helen Purchase
Write a Comment
User Comments (0)
About PowerShow.com