Presentation is loading. Please wait.

Presentation is loading. Please wait.

OVERVIEW OF NETWORKS AND GRAPHS

Published byΞένη Πυλαρινός Modified over 6 years ago

Similar presentations

Presentation on theme: "OVERVIEW OF NETWORKS AND GRAPHS"— Presentation transcript:

1 OVERVIEW OF NETWORKS AND GRAPHS
Activity Book

2 Activity 1 What questions would you anticipate will accompany this diagram ? What other data might make the diagram more helpful?

3 Distances between cities
Cork Limerick Galway Sligo Belfast Dublin 98 196 320 420 260 100 222 362 200 140 325 210 105 Now show this chart as a possible addendum to our previous question. We notice a symmetry - must be main roads(two way) as distance is the same either direction

4 ACTIVITY Based on the given data : Can I identify Nodes ?
What would the weights signify ? Can I identify a path using four nodes ? Can I represent the given data in graph format ? What is the shortest distance from Limerick to Belfast ?

5 ACTIVITY 2 Verify if the minimum spanning tree will have a weight total of 24. Select a different Node to commence the minimum spanning tree. Connect all the nodes with minimum total. Hopefully it is 24.

Download ppt "OVERVIEW OF NETWORKS AND GRAPHS"

Similar presentations

Every edge is in a red ellipse (the bags). The bags are connected in a tree. The bags an original vertex is part of are connected.

Every edge is in a red ellipse (the bags). The bags are connected in a tree. The bags an original vertex is part of are connected.
Networks Prim’s Algorithm

Networks Prim’s Algorithm
O(N 1.5 ) divide-and-conquer technique for Minimum Spanning Tree problem Step 1: Divide the graph into  N sub-graph by clustering. Step 2: Solve each.

O(N 1.5 ) divide-and-conquer technique for Minimum Spanning Tree problem Step 1: Divide the graph into  N sub-graph by clustering. Step 2: Solve each.
Breadth-First Search Seminar – Networking Algorithms CS and EE Dept. Lulea University of Technology 27 Jan. 2005 Mohammad Reza Akhavan.

Breadth-First Search Seminar – Networking Algorithms CS and EE Dept. Lulea University of Technology 27 Jan Mohammad Reza Akhavan.
7.3 Kruskal’s Algorithm. Kruskal’s Algorithm was developed by JOSEPH KRUSKAL.

7.3 Kruskal’s Algorithm. Kruskal’s Algorithm was developed by JOSEPH KRUSKAL.
Network Optimization Problems: Models and Algorithms This handout: Minimum Spanning Tree Problem.

Network Optimization Problems: Models and Algorithms This handout: Minimum Spanning Tree Problem.
Chapter 7 Network Flow Models.

Chapter 7 Network Flow Models.
Minimum Spanning Network: Brute Force Solution 34 43 49 53 59 67 71 75 77 83.

Minimum Spanning Network: Brute Force Solution
1 Internet Networking Spring 2002 Tutorial 6 Network Cost of Minimum Spanning Tree.

1 Internet Networking Spring 2002 Tutorial 6 Network Cost of Minimum Spanning Tree.
Chapter 11 Network Models. What You Need to Know For each of the three models: –What is the model? (what are given and what is to calculate) –What is.

Chapter 11 Network Models. What You Need to Know For each of the three models: –What is the model? (what are given and what is to calculate) –What is.
The Mathematics of Networks Chapter 7. Trees A tree is a graph that –Is connected –Has no circuits Tree.

The Mathematics of Networks Chapter 7. Trees A tree is a graph that –Is connected –Has no circuits Tree.
Dijkstra’s Algorithm. 2 Shortest-path Suppose we want to find the shortest path from node X to node Y It turns out that, in order to do this, we need.

Dijkstra’s Algorithm. 2 Shortest-path Suppose we want to find the shortest path from node X to node Y It turns out that, in order to do this, we need.
Networks and the Shortest Path Problem.  Physical Networks  Road Networks  Railway Networks  Airline traffic Networks  Electrical networks, e.g.,

Networks and the Shortest Path Problem.  Physical Networks  Road Networks  Railway Networks  Airline traffic Networks  Electrical networks, e.g.,
7.1 and 7.2: Spanning Trees. A network is a graph that is connected –The network must be a sub-graph of the original graph (its edges must come from the.

7.1 and 7.2: Spanning Trees. A network is a graph that is connected –The network must be a sub-graph of the original graph (its edges must come from the.
Module 5 – Networks and Decision Mathematics Chapter 23 – Undirected Graphs.

Module 5 – Networks and Decision Mathematics Chapter 23 – Undirected Graphs.
ICOM 6115©Manuel Rodriguez-Martinez ICOM 6115 – Computer Networks and the WWW Manuel Rodriguez-Martinez, Ph.D. Lecture 20.

ICOM 6115©Manuel Rodriguez-Martinez ICOM 6115 – Computer Networks and the WWW Manuel Rodriguez-Martinez, Ph.D. Lecture 20.
Kruskal’s and Dijkstra’s Algorithm.  Kruskal's algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connected weighted.

Kruskal’s and Dijkstra’s Algorithm.  Kruskal's algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connected weighted.
O A BD T EC 2 4 4 7 5 7 2 5 3 4 1 1 [2,O] 1 2,3 [4,0] [4,A] 4 [9,A] [7,B] [8,C] 5 [8,B] [8,E] 6 [13,D] [14,E] SHORTEST PATH – SERADA PARK UNDIRECTED GRAPH.

O A BD T EC [2,O] 1 2,3 [4,0] [4,A] 4 [9,A] [7,B] [8,C] 5 [8,B] [8,E] 6 [13,D] [14,E] SHORTEST PATH – SERADA PARK UNDIRECTED GRAPH.
© Nuffield Foundation 2012 Nuffield Free-Standing Mathematics Activity Networks © Rudolf Stricker.

© Nuffield Foundation 2012 Nuffield Free-Standing Mathematics Activity Networks © Rudolf Stricker.
Decision Maths 1 Shortest path algorithm Dijkstra’s Algorithm A V Ali : www.2july-maths.co.uk.

Decision Maths 1 Shortest path algorithm Dijkstra’s Algorithm A V Ali :

Similar presentations

Ads by Google