ENGM 732 Formalization of Network Flows Network Flow Models.

Slides:



Advertisements
Similar presentations
CSE 211 Discrete Mathematics
Advertisements

Basic Search Methods How to solve the control problem in production-rule systems? Basic techniques to find paths through state- nets. For the moment: -
Lecture 5 Graph Theory. Graphs Graphs are the most useful model with computer science such as logical design, formal languages, communication network,
ENGM 732 Formalization of Network Flows Network Flow Models.
Decision Maths Graphs Wiltshire Graphs A graph is just a diagram made up of “dots” and “lines”. These are all graphs. The dots are called “nodes” or.
Computational Methods for Management and Economics Carla Gomes Module 9a Network Models Terminology (Slides adapted from J.Orlin’s)
Network Optimization Problems: Models and Algorithms This handout: Minimum Spanning Tree Problem.
Graphs and Trees This handout: Trees Minimum Spanning Tree Problem.
Representing Graphs Wade Trappe. Lecture Overview Introduction Some Terminology –Paths Adjacency Matrix.
W. D. Grover TRLabs & University of Alberta © Wayne D. Grover 2002, 2003 Graph theory and routing (initial background) E E Lecture 4.
Chapter 11 Graphs and Trees This handout: Terminology of Graphs Eulerian Cycles.
Degree A F H G B E D C. Adjacent A F H G B E D C.
Discrete Mathematics Lecture 9 Alexander Bukharovich New York University.
Minimum Spanning Trees. Subgraph A graph G is a subgraph of graph H if –The vertices of G are a subset of the vertices of H, and –The edges of G are a.
NetworkModel-1 Network Optimization Models. NetworkModel-2 Network Terminology A network consists of a set of nodes and arcs. The arcs may have some flow.
GRAPH Learning Outcomes Students should be able to:
1 ELEC692 Fall 2004 Lecture 1b ELEC692 Lecture 1a Introduction to graph theory and algorithm.
Can you connect the dots as shown without taking your pen off the page or drawing the same line twice.
Introduction to Graphs. Introduction Graphs are a generalization of trees –Nodes or verticies –Edges or arcs Two kinds of graphs –Directed –Undirected.
Chapter 2: Graphs and Networks Lesson 2: Hello Mr Euler…
1 CS104 : Discrete Structures Chapter V Graph Theory.
Spring 2007Graphs1 ORD DFW SFO LAX
EMIS 8374 Optimal Trees updated 25 April slide 1 Minimum Spanning Tree (MST) Input –A (simple) graph G = (V,E) –Edge cost c ij for each edge e 
GRAPHS THEROY. 2 –Graphs Graph basics and definitions Vertices/nodes, edges, adjacency, incidence Degree, in-degree, out-degree Subgraphs, unions, isomorphism.
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.
COSC 2007 Data Structures II Chapter 14 Graphs I.
Introduction to Graph Theory
Graphs Edge(arc) Vertices can be even or odd or undirected (two-way) Edges can be directed (one-way) This graph is connected. Degree(order) = 3 Odd vertex.
THEORY OF COMPUTATION Komate AMPHAWAN 1. 2.
Graphs 9.1 Graphs and Graph Models أ. زينب آل كاظم 1.
Graph theory and networks. Basic definitions  A graph consists of points called vertices (or nodes) and lines called edges (or arcs). Each edge joins.
Homework #5 Due: October 31, 2000 Christine Kang Graph Concepts and Algorithms.
Graphs Upon completion you will be able to:
Graph Concepts and Algorithms Using LEDA By Caroline Moore and Carmen Frerichs (252a-at and 252a-ao) each graph in the presentation was created using gw_basic_graph_algorithms.
Graph Concepts Elif Tosun 252a-aa (All graphics created by using demo/graphwin/gw*)
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.
Chapter 05 Introduction to Graph And Search Algorithms.
1 CPSC 320: Intermediate Algorithm Design and Analysis July 14, 2014.
Graph Concepts Illustrated Using The Leda Library Amanuel Lemma CS252 Algorithms.
ENGM 631 Maximum Flow Solutions. Maximum Flow Models (Flow, Capacity) (0,3) (2,2) (5,7) (0,8) (3,6) (6,8) (3,3) (4,4) (4,10)
1 GRAPH Learning Outcomes Students should be able to: Explain basic terminology of a graph Identify Euler and Hamiltonian cycle Represent graphs using.
English for Economic Informatics I Tomáš Foltýnek Theoretical Foundations of Informatics.
Leda Demos By: Kelley Louie Credits: definitions from Algorithms Lectures and Discrete Mathematics with Algorithms by Albertson and Hutchinson graphics.
  An alphabet is any finite set of symbols.  Examples: ASCII, Unicode, {0,1} ( binary alphabet ), {a,b,c}. Alphabets.
Part 3 Linear Programming
Graphs: Definitions and Basic Properties
School of Computing Clemson University Fall, 2012
Graph Graphs and graph theory can be used to model:
Graph theory Definitions Trees, cycles, directed graphs.
Graphs and Graph Models
ENGM 535 Optimization Networks
Topological Sort (topological order)
Spanning Trees Discrete Mathematics.
Maximum Flow Solutions
Part 3 Linear Programming
Maximum Flows of Minimum Cost
Lecture 19-Problem Solving 4 Incremental Method
ELECTRICAL CIRCUITS AND CONSTRUCTIONS An electrical circuit is a network consisting of a closed loop, giving a return path for the current 2.
Decision Maths Graphs.
Spanning Tree Algorithms
Representing Graphs Wade Trappe.
Eulerian Cycles in directed graphs
Shortest Path Solutions
Part 3 Linear Programming
Chapter 14 Graphs © 2011 Pearson Addison-Wesley. All rights reserved.
Chapter 10 Graphs and Trees
INTRODUCTION TO NETWORK FLOWS
HW 3 (Due Wednesday Feb 6) Create slide(s) for your 1 minute presentation on a graph theory application. Make sure your slide(s) include (1) Define the.
GRAPHS.
Chapter 14 Graphs © 2011 Pearson Addison-Wesley. All rights reserved.
Presentation transcript:

ENGM 732 Formalization of Network Flows Network Flow Models

Terminology Loop 5 Graph

Terminology Graph Multigraph

Terminology Directed Network Graph

Terminology Walk – alternating sequence of nodes and lines beginning and ending with nodes Closed walk – same node begins and ends walk Open walk – ends at node other than beginning node Trail – walk with no line repeated Path - a walk with no node repeated

Terminology Walk – alternating sequence of nodes and lines beginning and ending with nodes Open walk – ends at node other than beginning node 45

Terminology Closed walk – same node begins and ends walk Trail – walk with no line repeated 1 4 2

Terminology Path - a walk with no node repeated 1 4 2

Terminology - Trees [ b i ] (c k, h k ) [3] [-5] (1,2) (2,-1) (3,5) (2,1) (5,3) [0] (1,-1) (2,1) 5 Root = 5 N T = {5} M T = 

Terminology - Trees [ b i ] (c k, h k ) [3] [-5] (1,2) (2,-1) (3,5) (2,1) (5,3) [0] (1,-1) (2,1) Root = 5 N T = {1,2,3,4,5} M T = {1,2,5,7} Spanning Tree

Terminology - Trees [ b i ] (c k, h k ) [3] [-5] (1,2) (2,-1) (3,5) (2,1) (5,3) [0] (1,-1) (2,1) Root = 5 N T = {1,2, 5} M T = {1,7} Spanning Forest Root = 3 N T = {3, 4} M T = {5}

Expanded Network Directed Network Expanded Network o(-k) = t(k) t(-k) = o(k)

Expanded Network Marginal Network Consists of a subset that are admissible arcs (2,2,-1) (f k, c k, h k ) Network with flow