Graph Visualization CSC4170 Web Intelligence and Social Computing Tutorial 2 Tutor: Tom Chao Zhou

Slides:

Advertisements

Similar presentations

Graphs: basic definitions and notation Definition A (undirected, unweighted) graph is a pair G = (V, E), where V = {v 1, v 2,..., v n } is a set of vertices,

Advertisements

Cpt S 223 – Advanced Data Structures Graph Algorithms: Introduction

Graphs CSCI 2720 Spring 2005.

8.3 Representing Relations Connection Matrices Let R be a relation from A = {a 1, a 2,..., a m } to B = {b 1, b 2,..., b n }. Definition: A n m  n connection.

CS 206 Introduction to Computer Science II 03 / 27 / 2009 Instructor: Michael Eckmann.

Data Structure and Algorithms (BCS 1223) GRAPH. Introduction of Graph A graph G consists of two things: 1.A set V of elements called nodes(or points or.

 Graph Graph  Types of Graphs Types of Graphs  Data Structures to Store Graphs Data Structures to Store Graphs  Graph Definitions Graph Definitions.

CS 206 Introduction to Computer Science II 11 / 11 / Veterans Day Instructor: Michael Eckmann.

Introduction to PageRank Algorithm and Programming Assignment 1 CSC4170 Web Intelligence and Social Computing Tutorial 4 Tutor: Tom Chao Zhou

CS447/ECE453/SE465 Prof. Alencar University of Waterloo 1 CS447/ECE453/SE465 Software Testing Tutorial Winter 2008 Based on the tutorials by Prof. Kontogiannis,

Introduction to Graphs

1 Representing Relations Part 2: directed graphs.

Introduction to Graphs What is a Graph? Some Example applications of Graphs. Graph Terminologies. Representation of Graphs. –Adjacency Matrix. –Adjacency.

CS 206 Introduction to Computer Science II 11 / 03 / 2008 Instructor: Michael Eckmann.

CS 206 Introduction to Computer Science II 03 / 25 / 2009 Instructor: Michael Eckmann.

Graphs G = (V,E) V is the vertex set. Vertices are also called nodes and points. E is the edge set. Each edge connects two different vertices. Edges are.

Selected Topics in Data Networking Graph Representation.

Graph: Relations There are many kinds of social relations. For example: Role-based : brother of, father of, sister of, etc. : friend of, acquaintance of,

Balanced Binary Search Trees height is O(log n), where n is the number of elements in the tree AVL (Adelson-Velsky and Landis) trees red-black trees get,

XP New Perspectives on Microsoft Access 2002 Tutorial 71 Microsoft Access 2002 Tutorial 7 – Integrating Access With the Web and With Other Programs.

GRAPH Learning Outcomes Students should be able to:

Graph. Data Structures Linear data structures: –Array, linked list, stack, queue Non linear data structures: –Tree, binary tree, graph and digraph.

Directed graphs Definition. A directed graph (or digraph) is a pair (V, E), where V is a finite non-empty set of vertices, and E is a set of ordered pairs.

1 Chapter 9 Graph Algorithms Real-life graph problems Algorithms for some graph problems Choice of data structures for graph problems.

Pascal Visualization Challenge Blaž Fortuna, IJS Marko Grobelnik, IJS Steve Gunn, US.

Graph Theoretic Concepts. What is a graph? A set of vertices (or nodes) linked by edges Mathematically, we often write G = (V,E)  V: set of vertices,

GRAPHS CSE, POSTECH. Chapter 16 covers the following topics Graph terminology: vertex, edge, adjacent, incident, degree, cycle, path, connected component,

Lecture 14 Relations CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.

 What is a graph? What is a graph?  Directed vs. undirected graphs Directed vs. undirected graphs  Trees vs graphs Trees vs graphs  Terminology: Degree.

It's a world-wide webby wonderland.. Graphs are often used to represent real-world information and real-world structures. Graph Theory was even invented.

Nyhoff, ADTs, Data Structures and Problem Solving with C++, Second Edition, © 2005 Pearson Education, Inc. All rights reserved Graphs.

Advanced Computer Networks: Part 1 Complex Networks, P2P Networks and Swarm Intelligence on Graphs.

Nyhoff, ADTs, Data Structures and Problem Solving with C++, Second Edition, © 2005 Pearson Education, Inc. All rights reserved Graphs.

Relation. Combining Relations Because relations from A to B are subsets of A x B, two relations from A to B can be combined in any way two sets can be.

Representing Relations Using Matrices A relation between finite sets can be represented using a zero-one matrix Suppose R is a relation from A = {a 1,

1 Directed Graphs Chapter 8. 2 Objectives You will be able to: Say what a directed graph is. Describe two ways to represent a directed graph: Adjacency.

Data Structures & Algorithms Graphs Richard Newman based on book by R. Sedgewick and slides by S. Sahni.

Graphs G = (V,E) V is the vertex set. Vertices are also called nodes and points. E is the edge set. Each edge connects two different vertices. Edges are.

Graphs 황승원 Fall 2010 CSE, POSTECH. 2 2 Graphs G = (V,E) V is the vertex set. Vertices are also called nodes and points. E is the edge set. Each edge connects.

GRAPHS. Graph Graph terminology: vertex, edge, adjacent, incident, degree, cycle, path, connected component, spanning tree Types of graphs: undirected,

Graphs Basic properties.

Graphs Upon completion you will be able to:

“Pajek”: Large Network Analysis. 2 Agenda Introduction Network Definitions Network Data Files Network Analysis 2.

Copyright © Curt Hill Graphs Definitions and Implementations.

Graphs Definition: a graph is an abstract representation of a set of objects where some pairs of the objects are connected by links. The interconnected.

Tutorial 3: Pajek basics Qi YU.  Getting started  Data format in Pajek  Window tools in Pajek  Resources.

Section 9.3. Section Summary Representing Relations using Matrices Representing Relations using Digraphs.

1 GRAPH Learning Outcomes Students should be able to: Explain basic terminology of a graph Identify Euler and Hamiltonian cycle Represent graphs using.

Programming Abstractions Cynthia Lee CS106B. Upcoming Topics Graphs! 1.Basics  What are they? How do we represent them? 2.Theorems  What are some things.

From digital to craft: How to make a data matrix with SNS data There are many applications that allow its users to visualize different networks directly.

Subject Four Graphs Data Structures. What is a graph? A data structure that consists of a set of nodes (vertices) and a set of edges that relate the nodes.

Introduction to Graphs

15. Directed graphs and networks

Basic Concepts Graphs For more notes and topics visit:

Copyright © Zeph Grunschlag,

Introduction to Graphs

Network Visualization

Balanced Binary Search Trees

CS200: Algorithm Analysis

10.1 Graphs and Graph Models

Representing Relations

CSCI2100 Data Structures Tutorial

Graphs Chapter 7 Visit for more Learning Resources.

Graphs G = (V, E) V are the vertices; E are the edges.

GRAPHS G=<V,E> Adjacent vertices Undirected graph

Graph Vocabulary.

Graphs: An Introduction

Graphs G = (V,E) V is the vertex set.

Introduction to Graphs

Presentation transcript:

Graph Visualization CSC4170 Web Intelligence and Social Computing Tutorial 2 Tutor: Tom Chao Zhou

Outline Background Graph Visualization Tools Case Study: Pajek Q & A

Background Visualization is a technique to graphically represent sets of data. When data is large or abstract, visualization can help make the data easier to read or understand.

Visualization Tools  Pajek:  UCINET:  Netdraw:  Stocnet:  Manyeyes:  …

Case Study: Pajek  Pajek:  Program for Large Network Analysis.  Download page:   Manual: 

Case Study: Pajek Draw “Network” with Pajek:  List of neighbours (Arcslist/Edgeslist) (unweighted graph)  Pairs of lines (Arcs/Eges) (weighted graph)  Matrix

Case Study: Pajek List of neighbours (Arcslist/Edgeslist) *Vertices 5 1 “a” 2 “b” 3 “c” 4 “d” 5 “e” *Arcslist *Edgeslist 1 5  Words, starting with *, must be written in first column of the line.  Definition of vertices followed after that – to each vertex we give a label.  using *Arcslist, a list of directed lines from selected vertices are declared.  *Edgeslist, declares a list of undirected lines.  No empty lines are allowed.

Case Study: Pajek 1, read the.net file 1, draw the network

Case Study: Pajek Pairs of lines (Arcs/Edges) *Vertices 5 1 "a" 2 "b" 3 "c" 4 "d" 5 "e" *Arcs *Edges  Every arc/edge is defined separately in new line – initial and terminal vertex are given.  Directed lines are defined using *Arcs, undirected lines are defined using *Edges, the third number in rows defining the weight.

Case Study: Pajek Matrix *Vertices 5 1 "a" 2 "b" 3 "c" 4 "d" 5 "e" *Matrix In this format directed lines are given in the matrix form (*Matrix). We can transform bidirected arcs to edges.

Case Study: Pajek Export to bmp, eps…

Case Study: Pajek Computing indegree and outdegree using Pajek: double click Partitions

Case Study: Pajek Graph and Digraph Glossary example:  Derived from Bill Cherowitzo's Graph and Digraph Glossary.  An arc (X,Y) from term X to term Y exists in the network iff in the Graph and Digraph Glossary the term Y is used to describe the meaning of term X.

Questions?