Preview. Graph. Graph. Graph. Graph Representation. Graph Representation 12/3/2018. Graph Graph Representation Graph Search Algorithms
|
|
- Stanley Lamb
- 5 years ago
- Views:
Transcription
1 /3/0 Prvw Grph Grph Rprsntton Grph Srch Algorthms Brdth Frst Srch Corrctnss of BFS Dpth Frst Srch Mnmum Spnnng Tr Kruskl s lgorthm Grph Drctd grph (or dgrph) G = (V, E) V: St of vrt (nod) E: St of dgs (ordrd vrt pr) Undrctd grph G = (V, E) V: St of vrt E: St of dgs (unordrd vrt pr) Grph Grph A B E A B E C D F C D F Dgrph G = (V, E) Undrctd Grph G = (V, E) V = A, B, C, D, E, F V = A, B, C, D, E, F E = (A, B), (C, A), (B, D), (B, C), (C, D), (D, C), (B, B) (F, E) E = (A, B), (A, C), (B, D), (B, C), (E, F) 3 Grph Rprsntton Grph Rprsntton Two stndrd wy to rprsnt grph. Adjcnt Lst Sprs grph. Adjcnt Mtr Dns Grph Adjcnt Lst Adjcnt Mtr Adjcncy lst If G s drctd grph, th sum of lngths of djcncy lst s E. If G s undrctd grph, th sum of lngths of ll th djcncy lst s E. Wghtd grph s grph for whch ch dg hs n ssoctd wght. Adjcnt lsts cn rdly b dptd to rprsnt wghtd grphs by sv mor nformton for ch nod. A dsdvntg Thr s no quckr wy to dtrmn f gvn dg (u, v) s prsnt n th grph thn srch for v n th djcncy lst A[u].
2 /3/0 Grph Rprsntton Grph Rprsntton Adjcncy Mtr Th djcncy-mtr rprsntton of grph G conssts of V V mtr A = (, j ) such tht, j f (, j) E 0 othrws Th djcncy mtr rprsntton cn b usd for wghtd grphs. If grph s unwghtd, th djcncy mtr uss only on bt pr ntry Adjcnt Lst Adjcnt Mtr Grph Rprsntton 3 Grph Rprsntton Wghtd dgrph or grph cn b rprsntd wth djcnt mtr Brdth-Frst Srch Brdth-Frst Srch From sourc nod s n grph G = (V, E), BFS plors th dgs of G vry vrt tht s rchbl from s. It clcult shortst dstnc from s to ny vrt u. BFS d s usd n Djkstr s sngl sourc shortst pth lgorthm nd Prm s mnmum spnnng tr lgorthm. Brdth-Frst srch Th lgorthm dscovrs ll vrtcs t dstnc k from s bfor dscovrng ny vrtcs t dstnc k +. Ech nod hs thr lmnts: color, dstnc nd prnt.. Color s usd for plorng grph,. Dstnc s usd for dnotng th hght from s n brdth-frst srch tr nd 3. Prnt s usd for kp th brdth-frst tr.
3 /3/0 Brdth-Frst Srch Brdth-Frst Srch (G, s) for ch vrt u V(G) s u.color = wht u.dstnc = u.prnt = Nl s.color = gry s.dstnc = 0 s.prnt = Nl EnQuu (Q, s) whl not mpty(q) u = Top(Q) for ch v djcnt to u f v.color = wht thn v.color = gry v.prnt = u v.dstnc = u.dstnc + ; EnQuu(Q, v) DQuu(Q) u.color = blck Th runnng tm of BFS Intlzton O(V) Ech dgs must plor on tm for BFS O(E) Totl: O(V+ E) 3 Brdth-Frst Srch 0 s Quu Brdth-Frst Srch Brdth-Frst Srch 0 0 s w s w r Quu Quu Brdth-Frst Srch Brdth-Frst Srch 0 0 w r w r t Quu Quu 3
4 /3/0 Brdth-Frst Srch Brdth-Frst Srch 0 0 w r t r t Quu Quu 0 Brdth-Frst Srch Brdth-Frst Srch 0 0 r t v t v Quu Quu Brdth-Frst Srch Brdth-Frst Srch t v u v u Quu Quu 3
5 /3/0 Brdth-Frst Srch Brdth-Frst Srch v u y v u y Quu Quu Brdth-Frst Srch Brdth-Frst Srch u y y Quu Quu Brdth-Frst Srch Corrctnss of Brdth-Frst Srch Lts s, v V n G = (V, E) 0 3 (s, v): shortst pth from s to v s th mnmum numbr of dgs n ny possbl pth from s to v. 3 BFS crt shortst pth from vrt s to ny vrt v f thr s pth btwn s nd v Quu 30
6 /3/0 Dpth Frst Srch In dpth-frst srch strtgy s to srch dpr n th grph whnvr possbl. In dpth-frst srch, dgs r plord out of th most rcntly dscovrd vrt v tht stll hs unplord dgs lvng t. Whn ll of v s dgs hv bn plord, th srch bcktrcks to plor dgs lvng th vrt from whch v ws dscovrd Dpth Frst Srch Ech vrt hs four lmnts: color, prnt nd tmstmps (vst_tm nd fnsh_tm).. Color s usd for plorng th grph.. v.vst_tm rcords whn nod v s dscovrd(nd gry). 3. v.fnsh_tm rcords whn th srch fnshs mnng v s djcncy lst.. Prnt s usd for kp th brdth-frst tr or forst. Ths tmstmps r usd n mny grph lgorthms nd r hlpful n rsonng bout th bhvor of dpth-frst srch. Runnng tm : (V + E) 3 3 Dpth Frst Srch Dpth Frst Srch Dpth_Frst_Srch(G) for ch vrt u V(G) u.color = wht u.prnt = nl tm = 0 for ch vrt u V(G) f u.color = wht Dpth_Frst_Vst(u) Dpth_Frst_Vst(u) u.color = gry u.vst_tm = tm + for ch v djcnt u f v.color == wht v.prnt = u Dpth_Frst_Vst(v) u.color = blck u.fnsh_tm = tm + / 33 3 Dpth Frst Srch Dpth Frst Srch / / / / 3/ 3 3
7 /3/0 Dpth Frst Srch Dpth Frst Srch / / / / / 3/ / 3/ 3 3 Dpth Frst Srch Dpth Frst Srch / / / / / 3/ / 3/ 3 0 Dpth Frst Srch Dpth Frst Srch / / / / / 3/ / 3/
8 /3/0 Dpth Frst Srch Dpth Frst Srch / / / / / / / 3/ / 3/ 3 Dpth Frst Srch Dpth Frst Srch / / / / / / / 3/ 0/ / 3/ 0/ Dpth Frst Srch / / / / 3/ 0/ Input: connctd undrctd grph G = (V, E) whr for ch dg (u, v) E, w hv wght w(u, v) Output: Fnd n cyclc subst T E tht conncts ll of th vrtcs nd whos totl wght s mnmzd.
9 /3/0 Mnmum Spnnng Tr us grdy lgorthm Grdy lgorthm lwys mks th choc tht looks bst t th momnt. It mks loclly optml choc n th hop tht ths choc wll ld to globlly optml soluton. Grdy lgorthms do not lwys ylds optml solutons. Kruskl s lgorthm Kruskl s lgorthm s grdy lgorthm, bcus t ch stp t dds to th forst n dgs of lst possbl wght. 0 Kruskl (G, w) A = Strt wth forst whr thr r V trs Sort th dgs of E by non-dcrsng wght w. for ch dg (u, v) E, n ordr by ncrsng wght f u nd v r not blongs to sm tr A = A (u, v) Mk two tr to connct wth dg (u, v)
10 /3/
11 /3/
12 /3/
13 /3/
Spanning Tree. Preview. Minimum Spanning Tree. Minimum Spanning Tree. Minimum Spanning Tree. Minimum Spanning Tree 10/17/2017.
0//0 Prvw Spnnng Tr Spnnng Tr Mnmum Spnnng Tr Kruskl s Algorthm Prm s Algorthm Corrctnss of Kruskl s Algorthm A spnnng tr T of connctd, undrctd grph G s tr composd of ll th vrtcs nd som (or prhps ll) of
More informationMinimum Spanning Trees
Mnmum Spnnng Trs Spnnng Tr A tr (.., connctd, cyclc grph) whch contns ll th vrtcs of th grph Mnmum Spnnng Tr Spnnng tr wth th mnmum sum of wghts 1 1 Spnnng forst If grph s not connctd, thn thr s spnnng
More informationMinimum Spanning Trees
Minimum Spnning Trs Minimum Spnning Trs Problm A town hs st of houss nd st of rods A rod conncts nd only houss A rod conncting houss u nd v hs rpir cost w(u, v) Gol: Rpir nough (nd no mor) rods such tht:
More informationCSC Design and Analysis of Algorithms. Example: Change-Making Problem
CSC 801- Dsign n Anlysis of Algorithms Ltur 11 Gry Thniqu Exmpl: Chng-Mking Prolm Givn unlimit mounts of oins of nomintions 1 > > m, giv hng for mount n with th lst numr of oins Exmpl: 1 = 25, 2 =10, =
More informationLecture 20: Minimum Spanning Trees (CLRS 23)
Ltur 0: Mnmum Spnnn Trs (CLRS 3) Jun, 00 Grps Lst tm w n (wt) rps (unrt/rt) n ntrou s rp voulry (vrtx,, r, pt, onnt omponnts,... ) W lso suss jny lst n jny mtrx rprsntton W wll us jny lst rprsntton unlss
More informationCSE 373: More on graphs; DFS and BFS. Michael Lee Wednesday, Feb 14, 2018
CSE 373: Mor on grphs; DFS n BFS Mihl L Wnsy, F 14, 2018 1 Wrmup Wrmup: Disuss with your nighor: Rmin your nighor: wht is simpl grph? Suppos w hv simpl, irt grph with x nos. Wht is th mximum numr of gs
More informationCOMP108 Algorithmic Foundations
Grdy mthods Prudn Wong http://www.s.liv..uk/~pwong/thing/omp108/01617 Coin Chng Prolm Suppos w hv 3 typs of oins 10p 0p 50p Minimum numr of oins to mk 0.8, 1.0, 1.? Grdy mthod Lrning outoms Undrstnd wht
More information12/3/12. Outline. Part 10. Graphs. Circuits. Euler paths/circuits. Euler s bridge problem (Bridges of Konigsberg Problem)
12/3/12 Outlin Prt 10. Grphs CS 200 Algorithms n Dt Struturs Introution Trminology Implmnting Grphs Grph Trvrsls Topologil Sorting Shortst Pths Spnning Trs Minimum Spnning Trs Ciruits 1 Ciruits Cyl 2 Eulr
More information5/9/13. Part 10. Graphs. Outline. Circuits. Introduction Terminology Implementing Graphs
Prt 10. Grphs CS 200 Algorithms n Dt Struturs 1 Introution Trminology Implmnting Grphs Outlin Grph Trvrsls Topologil Sorting Shortst Pths Spnning Trs Minimum Spnning Trs Ciruits 2 Ciruits Cyl A spil yl
More informationb. How many ternary words of length 23 with eight 0 s, nine 1 s and six 2 s?
MATH 3012 Finl Exm, My 4, 2006, WTT Stunt Nm n ID Numr 1. All our prts o this prolm r onrn with trnry strings o lngth n, i.., wors o lngth n with lttrs rom th lpht {0, 1, 2}.. How mny trnry wors o lngth
More informationV={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}
Introution Computr Sin & Enginring 423/823 Dsign n Anlysis of Algorithms Ltur 03 Elmntry Grph Algorithms (Chptr 22) Stphn Sott (Apt from Vinohnrn N. Vriym) I Grphs r strt t typs tht r pplil to numrous
More informationShortest Paths in Graphs. Paths in graphs. Shortest paths CS 445. Alon Efrat Slides courtesy of Erik Demaine and Carola Wenk
S 445 Shortst Paths n Graphs lon frat Sls courtsy of rk man an arola Wnk Paths n raphs onsr a raph G = (V, ) wth -wht functon w : R. Th wht of path p = v v v k s fn to xampl: k = w ( p) = w( v, v + ).
More informationCSE 373. Graphs 1: Concepts, Depth/Breadth-First Search reading: Weiss Ch. 9. slides created by Marty Stepp
CSE 373 Grphs 1: Conpts, Dpth/Brth-First Srh ring: Wiss Ch. 9 slis rt y Mrty Stpp http://www.s.wshington.u/373/ Univrsity o Wshington, ll rights rsrv. 1 Wht is grph? 56 Tokyo Sttl Soul 128 16 30 181 140
More informationFundamentals of Continuum Mechanics. Seoul National University Graphics & Media Lab
Fndmntls of Contnm Mchncs Sol Ntonl Unvrsty Grphcs & Md Lb Th Rodmp of Contnm Mchncs Strss Trnsformton Strn Trnsformton Strss Tnsor Strn T + T ++ T Strss-Strn Rltonshp Strn Enrgy FEM Formlton Lt s Stdy
More informationOutline. 1 Introduction. 2 Min-Cost Spanning Trees. 4 Example
Outlin Computr Sin 33 Computtion o Minimum-Cost Spnnin Trs Prim's Alorithm Introution Mik Joson Dprtmnt o Computr Sin Univrsity o Clry Ltur #33 3 Alorithm Gnrl Constrution Mik Joson (Univrsity o Clry)
More informationV={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}
s s of s Computr Sin & Enginring 423/823 Dsign n Anlysis of Ltur 03 (Chptr 22) Stphn Sott (Apt from Vinohnrn N. Vriym) s of s s r strt t typs tht r pplil to numrous prolms Cn ptur ntitis, rltionships twn
More informationA general N-dimensional vector consists of N values. They can be arranged as a column or a row and can be real or complex.
Lnr lgr Vctors gnrl -dmnsonl ctor conssts of lus h cn rrngd s column or row nd cn rl or compl Rcll -dmnsonl ctor cn rprsnt poston, loct, or cclrton Lt & k,, unt ctors long,, & rspctl nd lt k h th componnts
More informationAnalysis of Algorithms - Elementary graphs algorithms -
Analysis of Algorithms - Elmntary graphs algorithms - Anras Ermahl MRTC (Mälaralns Ral-Tim Rsarch Cntr) anras.rmahl@mh.s Autumn 004 Graphs Graphs ar important mathmatical ntitis in computr scinc an nginring
More informationOutline. Circuits. Euler paths/circuits 4/25/12. Part 10. Graphs. Euler s bridge problem (Bridges of Konigsberg Problem)
4/25/12 Outlin Prt 10. Grphs CS 200 Algorithms n Dt Struturs Introution Trminology Implmnting Grphs Grph Trvrsls Topologil Sorting Shortst Pths Spnning Trs Minimum Spnning Trs Ciruits 1 2 Eulr s rig prolm
More information(A) the function is an eigenfunction with eigenvalue Physical Chemistry (I) First Quiz
96- Physcl Chmstry (I) Frst Quz lctron rst mss m 9.9 - klogrm, Plnck constnt h 6.66-4 oul scon Sp of lght c. 8 m/s, lctron volt V.6-9 oul. Th functon F() C[cos()+sn()] s n gnfuncton of /. Th gnvlu s (A)
More informationCSI35 Chapter 11 Review
1. Which of th grphs r trs? c f c g f c x y f z p q r 1 1. Which of th grphs r trs? c f c g f c x y f z p q r . Answr th qustions out th following tr 1) Which vrtx is th root of c th tr? ) wht is th hight
More informationAnalysis of Algorithms - Elementary graphs algorithms -
Analysis of Algorithms - Elmntary graphs algorithms - Anras Ermahl MRTC (Mälaralns Ral-Tim Rsach Cntr) anras.rmahl@mh.s Autumn 00 Graphs Graphs ar important mathmatical ntitis in computr scinc an nginring
More informationLast time: introduced our first computational model the DFA.
Lctur 7 Homwork #7: 2.2.1, 2.2.2, 2.2.3 (hnd in c nd d), Misc: Givn: M, NFA Prov: (q,xy) * (p,y) iff (q,x) * (p,) (follow proof don in clss tody) Lst tim: introducd our first computtionl modl th DFA. Tody
More informationCS 461, Lecture 17. Today s Outline. Example Run
Prim s Algorithm CS 461, Ltur 17 Jr Si Univrsity o Nw Mxio In Prim s lgorithm, th st A mintin y th lgorithm orms singl tr. Th tr strts rom n ritrry root vrtx n grows until it spns ll th vrtis in V At h
More informationb.) v d =? Example 2 l = 50 m, D = 1.0 mm, E = 6 V, " = 1.72 #10 $8 % & m, and r = 0.5 % a.) R =? c.) V ab =? a.) R eq =?
xmpl : An 8-gug oppr wr hs nomnl mtr o. mm. Ths wr rrs onstnt urrnt o.67 A to W lmp. Th nsty o r ltrons s 8.5 x 8 ltrons pr u mtr. Fn th mgntu o. th urrnt nsty. th rt vloty xmpl D. mm,.67 A, n N 8.5" 8
More informationminimize c'x subject to subject to subject to
z ' sut to ' M ' M N uostrd N z ' sut to ' z ' sut to ' sl vrls vtor of : vrls surplus vtor of : uostrd s s s s s s z sut to whr : ut ost of :out of : out of ( ' gr of h food ( utrt : rqurt for h utrt
More informationPaths. Connectivity. Euler and Hamilton Paths. Planar graphs.
Pths.. Eulr n Hmilton Pths.. Pth D. A pth rom s to t is squn o gs {x 0, x 1 }, {x 1, x 2 },... {x n 1, x n }, whr x 0 = s, n x n = t. D. Th lngth o pth is th numr o gs in it. {, } {, } {, } {, } {, } {,
More informationCSE303 - Introduction to the Theory of Computing Sample Solutions for Exercises on Finite Automata
CSE303 - Introduction to th Thory of Computing Smpl Solutions for Exrciss on Finit Automt Exrcis 2.1.1 A dtrministic finit utomton M ccpts th mpty string (i.., L(M)) if nd only if its initil stt is finl
More informationWeek 3: Connected Subgraphs
Wk 3: Connctd Subgraphs Sptmbr 19, 2016 1 Connctd Graphs Path, Distanc: A path from a vrtx x to a vrtx y in a graph G is rfrrd to an xy-path. Lt X, Y V (G). An (X, Y )-path is an xy-path with x X and y
More informationCS 241 Analysis of Algorithms
CS 241 Anlysis o Algorithms Prossor Eri Aron Ltur T Th 9:00m Ltur Mting Lotion: OLB 205 Businss HW6 u lry HW7 out tr Thnksgiving Ring: Ch. 22.1-22.3 1 Grphs (S S. B.4) Grphs ommonly rprsnt onntions mong
More informationGraphs. CSC 1300 Discrete Structures Villanova University. Villanova CSC Dr Papalaskari
Grphs CSC 1300 Disrt Struturs Villnov Univrsity Grphs Grphs r isrt struturs onsis?ng of vr?s n gs tht onnt ths vr?s. Grphs n us to mol: omputr systms/ntworks mthm?l rl?ons logi iruit lyout jos/prosss f
More informationAn undirected graph G = (V, E) V a set of vertices E a set of unordered edges (v,w) where v, w in V
Unirt Grphs An unirt grph G = (V, E) V st o vrtis E st o unorr gs (v,w) whr v, w in V USE: to mol symmtri rltionships twn ntitis vrtis v n w r jnt i thr is n g (v,w) [or (w,v)] th g (v,w) is inint upon
More informationChapter 6 Continuous Random Variables and Distributions
Chpter 6 Continuous Rndom Vriles nd Distriutions Mny economic nd usiness mesures such s sles investment consumption nd cost cn hve the continuous numericl vlues so tht they cn not e represented y discrete
More informationERDOS-SMARANDACHE NUMBERS. Sabin Tabirca* Tatiana Tabirca**
ERDO-MARANDACHE NUMBER b Tbrc* Tt Tbrc** *Trslv Uvrsty of Brsov, Computr cc Dprtmt **Uvrsty of Mchstr, Computr cc Dprtmt Th strtg pot of ths rtcl s rprstd by rct work of Fch []. Bsd o two symptotc rsults
More information4.1 Interval Scheduling. Chapter 4. Greedy Algorithms. Interval Scheduling: Greedy Algorithms. Interval Scheduling. Interval scheduling.
Cptr 4 4 Intrvl Suln Gry Alortms Sls y Kvn Wyn Copyrt 005 Prson-Ason Wsly All rts rsrv Intrvl Suln Intrvl Suln: Gry Alortms Intrvl suln! Jo strts t s n nss t! Two os omptl ty on't ovrlp! Gol: n mxmum sust
More informationGraphs. Graphs. Graphs: Basic Terminology. Directed Graphs. Dr Papalaskari 1
CSC 00 Disrt Struturs : Introuon to Grph Thory Grphs Grphs CSC 00 Disrt Struturs Villnov Univrsity Grphs r isrt struturs onsisng o vrs n gs tht onnt ths vrs. Grphs n us to mol: omputr systms/ntworks mthml
More informationOutline. Computer Science 331. Computation of Min-Cost Spanning Trees. Costs of Spanning Trees in Weighted Graphs
Outlin Computr Sin 33 Computtion o Minimum-Cost Spnnin Trs Prim s Mik Joson Dprtmnt o Computr Sin Univrsity o Clry Ltur #34 Introution Min-Cost Spnnin Trs 3 Gnrl Constrution 4 5 Trmintion n Eiiny 6 Aitionl
More information5/7/13. Part 10. Graphs. Theorem Theorem Graphs Describing Precedence. Outline. Theorem 10-1: The Handshaking Theorem
Thorm 10-1: Th Hnshkin Thorm Lt G=(V,E) n unirt rph. Thn Prt 10. Grphs CS 200 Alorithms n Dt Struturs v V (v) = 2 E How mny s r thr in rph with 10 vrtis h of r six? 10 * 6 /2= 30 1 Thorm 10-2 An unirt
More informationFractions. Mathletics Instant Workbooks. Simplify. Copyright
Frctons Stunt Book - Srs H- Smplfy + Mthltcs Instnt Workbooks Copyrht Frctons Stunt Book - Srs H Contnts Topcs Topc - Equvlnt frctons Topc - Smplfyn frctons Topc - Propr frctons, mpropr frctons n mx numbrs
More informationPractice Final Exam. 3.) What is the 61st term of the sequence 7, 11, 15, 19,...?
Discrt mth Prctic Fl Em.) Fd 4 (i ) i=.) Fd i= 6 i.) Wht is th 6st trm th squnc 7,, 5, 9,...? 4.) Wht s th 57th trm, 6,, 4,...? 5.) Wht s th sum th first 60 trms th squnc, 5, 7, 9,...? 6.) Suppos st A
More informationELEG 413 Lecture #6. Mark Mirotznik, Ph.D. Professor The University of Delaware
LG 43 Lctur #6 Mrk Mirtnik, Ph.D. Prfssr Th Univrsity f Dlwr mil: mirtni@c.udl.du Wv Prpgtin nd Plritin TM: Trnsvrs lctrmgntic Wvs A md is prticulr fild cnfigurtin. Fr givn lctrmgntic bundry vlu prblm,
More informationglo beau bid point full man branch last ior s all for ap Sav tree tree God length per down ev the fect your er Cm7 a a our
SING, MY TONGU, TH SAVIOR S GLORY mj7 Mlod Kbd fr nd S would tm flsh s D nd d tn s drw t crd S, Fth t So Th L lss m ful wn dd t, Fs4 F wd; v, snr, t; ngh, t: lod; t; tgu, now Chrst, h O d t bnd Sv God
More informationCS200: Graphs. Graphs. Directed Graphs. Graphs/Networks Around Us. What can this represent? Sometimes we want to represent directionality:
CS2: Grphs Prihr Ch. 4 Rosn Ch. Grphs A olltion of nos n gs Wht n this rprsnt? n A omputr ntwork n Astrtion of mp n Soil ntwork CS2 - Hsh Tls 2 Dirt Grphs Grphs/Ntworks Aroun Us A olltion of nos n irt
More informationWalk Like a Mathematician Learning Task:
Gori Dprtmnt of Euction Wlk Lik Mthmticin Lrnin Tsk: Mtrics llow us to prform mny usful mthmticl tsks which orinrily rquir lr numbr of computtions. Som typs of problms which cn b on fficintly with mtrics
More informationDCDM BUSINESS SCHOOL NUMERICAL METHODS (COS 233-8) Solutions to Assignment 3. x f(x)
DCDM BUSINESS SCHOOL NUMEICAL METHODS (COS -8) Solutons to Assgnment Queston Consder the followng dt: 5 f() 8 7 5 () Set up dfference tble through fourth dfferences. (b) Wht s the mnmum degree tht n nterpoltng
More informationMulti-Section Coupled Line Couplers
/0/009 MultiSction Coupld Lin Couplrs /8 Multi-Sction Coupld Lin Couplrs W cn dd multipl coupld lins in sris to incrs couplr ndwidth. Figur 7.5 (p. 6) An N-sction coupld lin l W typiclly dsign th couplr
More informationIntegration Continued. Integration by Parts Solving Definite Integrals: Area Under a Curve Improper Integrals
Intgrtion Continud Intgrtion y Prts Solving Dinit Intgrls: Ar Undr Curv Impropr Intgrls Intgrtion y Prts Prticulrly usul whn you r trying to tk th intgrl o som unction tht is th product o n lgric prssion
More informationSection 3: Antiderivatives of Formulas
Chptr Th Intgrl Appli Clculus 96 Sction : Antirivtivs of Formuls Now w cn put th is of rs n ntirivtivs togthr to gt wy of vluting finit intgrls tht is ct n oftn sy. To vlut finit intgrl f(t) t, w cn fin
More informationCopyright 2000, Kevin Wayne 1
Chptr. Intrvl Shulng Gry Algorthms Sls y Kvn Wyn. Copyrght 005 Prson-Ason Wsly. All rghts rsrv. Intrvl Shulng Intrvl Shulng: Gry Algorthms Intrvl shulng. Jo strts t s n fnshs t f. Two os omptl f thy on't
More informationErrata for Second Edition, First Printing
Errt for Scond Edition, First Printing pg 68, lin 1: z=.67 should b z=.44 pg 1: Eqution (.63) should rd B( R) = x= R = θ ( x R) p( x) R 1 x= [1 G( x)] = θp( R) + ( θ R)[1 G( R)] pg 15, problm 6: dmnd of
More informationFSA. CmSc 365 Theory of Computation. Finite State Automata and Regular Expressions (Chapter 2, Section 2.3) ALPHABET operations: U, concatenation, *
CmSc 365 Thory of Computtion Finit Stt Automt nd Rgulr Exprssions (Chptr 2, Sction 2.3) ALPHABET oprtions: U, conctntion, * otin otin Strings Form Rgulr xprssions dscri Closd undr U, conctntion nd * (if
More informationCMPS 2200 Fall Graphs. Carola Wenk. Slides courtesy of Charles Leiserson with changes and additions by Carola Wenk
CMPS 2200 Fll 2017 Grps Crol Wnk Sls ourtsy o Crls Lsrson wt ns n tons y Crol Wnk 10/23/17 CMPS 2200 Intro. to Alortms 1 Grps Dnton. A rt rp (rp) G = (V, E) s n orr pr onsstn o st V o vrts (snulr: vrtx),
More informationON THE COMPLEXITY OF K-STEP AND K-HOP DOMINATING SETS IN GRAPHS
MATEMATICA MONTISNIRI Vol XL (2017) MATEMATICS ON TE COMPLEXITY OF K-STEP AN K-OP OMINATIN SETS IN RAPS M FARAI JALALVAN AN N JAFARI RA partmnt of Mathmatcs Shahrood Unrsty of Tchnology Shahrood Iran Emals:
More informationSection 5.1/5.2: Areas and Distances the Definite Integral
Scto./.: Ars d Dstcs th Dt Itgrl Sgm Notto Prctc HW rom Stwrt Ttook ot to hd p. #,, 9 p. 6 #,, 9- odd, - odd Th sum o trms,,, s wrtt s, whr th d o summto Empl : Fd th sum. Soluto: Th Dt Itgrl Suppos w
More information, each of which is a tree, and whose roots r 1. , respectively, are children of r. Data Structures & File Management
nrl tr T is init st o on or mor nos suh tht thr is on sint no r, ll th root o T, n th rminin nos r prtition into n isjoint susts T, T,, T n, h o whih is tr, n whos roots r, r,, r n, rsptivly, r hilrn o
More informationExamples and applications on SSSP and MST
Exampls an applications on SSSP an MST Dan (Doris) H & Junhao Gan ITEE Univrsity of Qunslan COMP3506/7505, Uni of Qunslan Exampls an applications on SSSP an MST Dijkstra s Algorithm Th algorithm solvs
More informationECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS
C 24 - COMBINATIONAL BUILDING BLOCKS - INVST 3 DCODS AND NCODS FALL 23 AP FLZ To o "wll" on this invstition you must not only t th riht nswrs ut must lso o nt, omplt n onis writups tht mk ovious wht h
More informationLucas Test is based on Euler s theorem which states that if n is any integer and a is coprime to n, then a φ(n) 1modn.
Modul 10 Addtonal Topcs 10.1 Lctur 1 Prambl: Dtrmnng whthr a gvn ntgr s prm or compost s known as prmalty tstng. Thr ar prmalty tsts whch mrly tll us whthr a gvn ntgr s prm or not, wthout gvng us th factors
More information5/1/2018. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees
/1/018 W usully no strns y ssnn -lnt os to ll rtrs n t lpt (or mpl, 8-t on n ASCII). Howvr, rnt rtrs our wt rnt rquns, w n sv mmory n ru trnsmttl tm y usn vrl-lnt non. T s to ssn sortr os to rtrs tt our
More informationSearching Linked Lists. Perfect Skip List. Building a Skip List. Skip List Analysis (1) Assume the list is sorted, but is stored in a linked list.
3 3 4 8 6 3 3 4 8 6 3 3 4 8 6 () (d) 3 Sarching Linkd Lists Sarching Linkd Lists Sarching Linkd Lists ssum th list is sortd, but is stord in a linkd list. an w us binary sarch? omparisons? Work? What if
More informationRiemann Sums and Riemann Integrals
Riemnn Sums nd Riemnn Integrls Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University August 26, 2013 Outline 1 Riemnn Sums 2 Riemnn Integrls 3 Properties
More informationcycle that does not cross any edges (including its own), then it has at least
W prov th following thorm: Thorm If a K n is drawn in th plan in such a way that it has a hamiltonian cycl that dos not cross any dgs (including its own, thn it has at last n ( 4 48 π + O(n crossings Th
More informationErrata for Second Edition, First Printing
Errt for Scond Edition, First Printing pg 68, lin 1: z=.67 should b z=.44 pg 71: Eqution (.3) should rd B( R) = θ R 1 x= [1 G( x)] pg 1: Eqution (.63) should rd B( R) = x= R = θ ( x R) p( x) R 1 x= [1
More informationRiemann Sums and Riemann Integrals
Riemnn Sums nd Riemnn Integrls Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University August 26, 203 Outline Riemnn Sums Riemnn Integrls Properties Abstrct
More informationINF5820/INF9820 LANGUAGE TECHNOLOGICAL APPLICATIONS. Jan Tore Lønning, Lecture 4, 14 Sep
INF5820/INF9820 LANGUAGE TECHNOLOGICAL ALICATIONS Jn Tor Lønning Lctur 4 4 Sp. 206 tl@ii.uio.no Tody 2 Sttisticl chin trnsltion: Th noisy chnnl odl Word-bsd Trining IBM odl 3 SMT xpl 4 En kokk lgd n rtt
More informationUNIVERSITY OF IOANNINA DEPARTMENT OF ECONOMICS. M.Sc. in Economics MICROECONOMIC THEORY I. Problem Set II
Mcroeconomc Theory I UNIVERSITY OF IOANNINA DEPARTMENT OF ECONOMICS MSc n Economcs MICROECONOMIC THEORY I Techng: A Lptns (Note: The number of ndctes exercse s dffculty level) ()True or flse? If V( y )
More informationPartially Observable Systems. 1 Partially Observable Markov Decision Process (POMDP) Formalism
CS294-40 Lernng for Rootcs nd Control Lecture 10-9/30/2008 Lecturer: Peter Aeel Prtlly Oservle Systems Scre: Dvd Nchum Lecture outlne POMDP formlsm Pont-sed vlue terton Glol methods: polytree, enumerton,
More information8. Linear Contracts under Risk Neutrality
8. Lnr Contrcts undr Rsk Nutrlty Lnr contrcts r th smplst form of contrcts nd thy r vry populr n pplctons. Thy offr smpl ncntv mchnsm. Exmpls of lnr contrcts r mny: contrctul jont vnturs, quty jont vnturs,
More informationMath 61 : Discrete Structures Final Exam Instructor: Ciprian Manolescu. You have 180 minutes.
Nm: UCA ID Numr: Stion lttr: th 61 : Disrt Struturs Finl Exm Instrutor: Ciprin nolsu You hv 180 minuts. No ooks, nots or lultors r llow. Do not us your own srth ppr. 1. (2 points h) Tru/Fls: Cirl th right
More informationSolutions for HW11. Exercise 34. (a) Use the recurrence relation t(g) = t(g e) + t(g/e) to count the number of spanning trees of v 1
Solutions for HW Exris. () Us th rurrn rltion t(g) = t(g ) + t(g/) to ount th numr of spnning trs of v v v u u u Rmmr to kp multipl gs!! First rrw G so tht non of th gs ross: v u v Rursing on = (v, u ):
More informationChapter Newton-Raphson Method of Solving a Nonlinear Equation
Chpter.4 Newton-Rphson Method of Solvng Nonlner Equton After redng ths chpter, you should be ble to:. derve the Newton-Rphson method formul,. develop the lgorthm of the Newton-Rphson method,. use the Newton-Rphson
More informationAnnouncements. These are Graphs. This is not a Graph. Graph Definitions. Applications of Graphs. Graphs & Graph Algorithms
Grphs & Grph Algorithms Ltur CS Fll 5 Announmnts Upoming tlk h Mny Crrs o Computr Sintist Or how Computr Sin gr mpowrs you to o muh mor thn o Dn Huttnlohr, Prossor in th Dprtmnt o Computr Sin n Johnson
More information(Minimum) Spanning Trees
(Mnmum) Spnnn Trs Spnnn trs Kruskl's lortm Novmr 23, 2017 Cn Hrn / Gory Tn 1 Spnnn trs Gvn G = V, E, spnnn tr o G s onnt surp o G wt xtly V 1 s mnml sust o s tt onnts ll t vrts o G G = Spnnn trs Novmr
More informationInstructions for Section 1
Instructions for Sction 1 Choos th rspons tht is corrct for th qustion. A corrct nswr scors 1, n incorrct nswr scors 0. Mrks will not b dductd for incorrct nswrs. You should ttmpt vry qustion. No mrks
More information, between the vertical lines x a and x b. Given a demand curve, having price as a function of quantity, p f (x) at height k is the curve f ( x,
Clculus for Businss nd Socil Scincs - Prof D Yun Finl Em Rviw vrsion 5/9/7 Chck wbsit for ny postd typos nd updts Pls rport ny typos This rviw sht contins summris of nw topics only (This rviw sht dos hv
More informationAnnouncements. Not graphs. These are Graphs. Applications of Graphs. Graph Definitions. Graphs & Graph Algorithms. A6 released today: Risk
Grphs & Grph Algorithms Ltur CS Spring 6 Announmnts A6 rls toy: Risk Strt signing with your prtnr sp Prlim usy Not grphs hs r Grphs K 5 K, =...not th kin w mn, nywy Applitions o Grphs Communition ntworks
More informationCSE 417, Winter Greedy Algorithms 1/27/2012. Chapter 4. Ben Birnbaum Widad Machmouchi. 4.1 Interval Scheduling.
//0 CSE, Wntr 0 Grdy Algorthms Chaptr Grdy Algorthms Bn Brnbaum Wdad Machmouch Slds by Kvn Wayn. Copyrght 00 Parson-Addson Wsly. All rghts rsrvd. Slds adaptd rom Larry Ruzzo, Stv Tanmoto, and Kvn Wayn
More informationSpanning Trees. BFS, DFS spanning tree Minimum spanning tree. March 28, 2018 Cinda Heeren / Geoffrey Tien 1
Spnnn Trs BFS, DFS spnnn tr Mnmum spnnn tr Mr 28, 2018 Cn Hrn / Gory Tn 1 Dpt-rst sr Vsts vrts lon snl pt s r s t n o, n tn ktrks to t rst junton n rsums own notr pt Mr 28, 2018 Cn Hrn / Gory Tn 2 Dpt-rst
More information# 1 ' 10 ' 100. Decimal point = 4 hundred. = 6 tens (or sixty) = 5 ones (or five) = 2 tenths. = 7 hundredths.
How os it work? Pl vlu o imls rprsnt prts o whol numr or ojt # 0 000 Tns o thousns # 000 # 00 Thousns Hunrs Tns Ons # 0 Diml point st iml pl: ' 0 # 0 on tnth n iml pl: ' 0 # 00 on hunrth r iml pl: ' 0
More informationThe graphs of Rational Functions
Lecture 4 5A: The its of Rtionl Functions s x nd s x + The grphs of Rtionl Functions The grphs of rtionl functions hve severl differences compred to power functions. One of the differences is the behvior
More informationa b c cat CAT A B C Aa Bb Cc cat cat Lesson 1 (Part 1) Verbal lesson: Capital Letters Make The Same Sound Lesson 1 (Part 1) continued...
Progrssiv Printing T.M. CPITLS g 4½+ Th sy, fun (n FR!) wy to tch cpitl lttrs. ook : C o - For Kinrgrtn or First Gr (not for pr-school). - Tchs tht cpitl lttrs mk th sm souns s th littl lttrs. - Tchs th
More informationTOPIC 5: INTEGRATION
TOPIC 5: INTEGRATION. Th indfinit intgrl In mny rspcts, th oprtion of intgrtion tht w r studying hr is th invrs oprtion of drivtion. Dfinition.. Th function F is n ntidrivtiv (or primitiv) of th function
More informationLinear Algebra Existence of the determinant. Expansion according to a row.
Lir Algbr 2270 1 Existc of th dtrmit. Expsio ccordig to row. W dfi th dtrmit for 1 1 mtrics s dt([]) = (1) It is sy chck tht it stisfis D1)-D3). For y othr w dfi th dtrmit s follows. Assumig th dtrmit
More informationWeighted Graphs. Weighted graphs may be either directed or undirected.
1 In mny ppltons, o rp s n ssot numrl vlu, ll wt. Usully, t wts r nonntv ntrs. Wt rps my tr rt or unrt. T wt o n s otn rrr to s t "ost" o t. In ppltons, t wt my msur o t lnt o rout, t pty o ln, t nry rqur
More informationAbstract Interpretation: concrete and abstract semantics
Abstract Intrprtation: concrt and abstract smantics Concrt smantics W considr a vry tiny languag that manags arithmtic oprations on intgrs valus. Th (concrt) smantics of th languags cab b dfind by th funzcion
More informationConstructive Geometric Constraint Solving
Construtiv Gomtri Constrint Solving Antoni Soto i Rir Dprtmnt Llngutgs i Sistms Inormàtis Univrsitt Politèni Ctluny Brlon, Sptmr 2002 CGCS p.1/37 Prliminris CGCS p.2/37 Gomtri onstrint prolm C 2 D L BC
More informationProblem solving by search
Prolm solving y srh Tomáš voo Dprtmnt o Cyrntis, Vision or Roots n Autonomous ystms Mrh 5, 208 / 3 Outlin rh prolm. tt sp grphs. rh trs. trtgis, whih tr rnhs to hoos? trtgy/algorithm proprtis? Progrmming
More informationNefertiti. Echoes of. Regal components evoke visions of the past MULTIPLE STITCHES. designed by Helena Tang-Lim
MULTIPLE STITCHES Nrtiti Ehos o Rgl omponnts vok visions o th pst sign y Hln Tng-Lim Us vrity o stiths to rt this rgl yt wrl sign. Prt sping llows squr s to mk roun omponnts tht rp utiully. FCT-SC-030617-07
More informationLecture 14. Relic neutrinos Temperature at neutrino decoupling and today Effective degeneracy factor Neutrino mass limits Saha equation
Lctur Rlc nutrnos mpratur at nutrno dcoupln and today Effctv dnracy factor Nutrno mass lmts Saha quaton Physcal Cosmoloy Lnt 005 Rlc Nutrnos Nutrnos ar wakly ntractn partcls (lptons),,,,,,, typcal ractons
More informationLecture 11 Waves in Periodic Potentials Today: Questions you should be able to address after today s lecture:
Lctur 11 Wvs in Priodic Potntils Tody: 1. Invrs lttic dfinition in 1D.. rphicl rprsnttion of priodic nd -priodic functions using th -xis nd invrs lttic vctors. 3. Sris solutions to th priodic potntil Hmiltonin
More informationRank One Update And the Google Matrix by Al Bernstein Signal Science, LLC
Introducton Rnk One Updte And the Google Mtrx y Al Bernsten Sgnl Scence, LLC www.sgnlscence.net here re two dfferent wys to perform mtrx multplctons. he frst uses dot product formulton nd the second uses
More information1 Introduction to Modulo 7 Arithmetic
1 Introution to Moulo 7 Arithmti Bor w try our hn t solvin som hr Moulr KnKns, lt s tk los look t on moulr rithmti, mo 7 rithmti. You ll s in this sminr tht rithmti moulo prim is quit irnt rom th ons w
More information10/7/14. Mixture Models. Comp 135 Introduction to Machine Learning and Data Mining. Maximum likelihood estimation. Mixture of Normals in 1D
Comp 35 Introducton to Machn Larnng and Data Mnng Fall 204 rofssor: Ron Khardon Mxtur Modls Motvatd by soft k-mans w dvlopd a gnratv modl for clustrng. Assum thr ar k clustrs Clustrs ar not rqurd to hav
More informationITERATIVE METHODS FOR SOLVING SYSTEMS OF LINEAR ALGEBRAIC EQUATIONS
Numercl Alyss for Egeers Germ Jord Uversty ITERATIVE METHODS FOR SOLVING SYSTEMS OF LINEAR ALGEBRAIC EQUATIONS Numercl soluto of lrge systems of ler lgerc equtos usg drect methods such s Mtr Iverse, Guss
More informationVariable time amplitude amplification and quantum algorithms for linear algebra. Andris Ambainis University of Latvia
Vrble tme mpltude mplfcton nd quntum lgorthms for lner lgebr Andrs Ambns Unversty of Ltv Tlk outlne. ew verson of mpltude mplfcton;. Quntum lgorthm for testng f A s sngulr; 3. Quntum lgorthm for solvng
More informationChapter Newton-Raphson Method of Solving a Nonlinear Equation
Chpter 0.04 Newton-Rphson Method o Solvng Nonlner Equton Ater redng ths chpter, you should be ble to:. derve the Newton-Rphson method ormul,. develop the lgorthm o the Newton-Rphson method,. use the Newton-Rphson
More informationExam 1 Solution. CS 542 Advanced Data Structures and Algorithms 2/14/2013
CS Avn Dt Struturs n Algorithms Exm Solution Jon Turnr //. ( points) Suppos you r givn grph G=(V,E) with g wights w() n minimum spnning tr T o G. Now, suppos nw g {u,v} is to G. Dsri (in wors) mtho or
More informationStrongly Connected Components
Strongly Connctd Componnts Lt G = (V, E) b a dirctd graph Writ if thr is a path from to in G Writ if and is an quivalnc rlation: implis and implis s quivalnc classs ar calld th strongly connctd componnts
More information13. Binary tree, height 4, eight terminal vertices 14. Full binary tree, seven vertices v 7 v13. v 19
0. Spnning Trs n Shortst Pths 0. Consir th tr shown blow with root v 0.. Wht is th lvl of v 8? b. Wht is th lvl of v 0? c. Wht is th hight of this root tr?. Wht r th chilrn of v 0?. Wht is th prnt of v
More informationCycles and Simple Cycles. Paths and Simple Paths. Trees. Problem: There is No Completely Standard Terminology!
Outlin Computr Sin 331, Spnnin, n Surphs Mik Joson Dprtmnt o Computr Sin Univrsity o Clry Ltur #30 1 Introution 2 3 Dinition 4 Spnnin 5 6 Mik Joson (Univrsity o Clry) Computr Sin 331 Ltur #30 1 / 20 Mik
More information