The world’s Largest Sharp Brain Virtual Experts Marketplace Just a click Away
Levels Tought:
Elementary,Middle School,High School,College,University,PHD
| Teaching Since: | May 2017 |
| Last Sign in: | 398 Weeks Ago, 1 Day Ago |
| Questions Answered: | 66690 |
| Tutorials Posted: | 66688 |
MCS,PHD
Argosy University/ Phoniex University/
Nov-2005 - Oct-2011
Professor
Phoniex University
Oct-2001 - Nov-2016
1. Let G = (V,E) be a weighted, directed graph with source vertex s, and let Gbe initialized by INITIALIzE-SINGLE-SOURCE(G,s). Prove that if a sequence of relaxation steps sets s.Ï€ to a non-NIL value, then G contains a negative-weight cycle.
2. Let G = (V,E) be a weighted, directed graph with no negative-weight edges. Let s ∈V be the source vertex, and suppose that we allow υ.π to be the predecessor of υ on any shortest path to υ from source s if υ ∈V – {s} is reachable from s, and NIL otherwise. Give an example of such a graph G and an assignment of υvalues that produces a cycle in Gπ. (By Lemma 24.16, such an assignment cannot be produced by a sequence of relaxation steps.)
Hel-----------lo -----------Sir-----------/Ma-----------dam-----------Tha-----------nk -----------You----------- fo-----------r u-----------sin-----------g o-----------ur -----------web-----------sit-----------e a-----------nd -----------acq-----------uis-----------iti-----------on -----------of -----------my -----------pos-----------ted----------- so-----------lut-----------ion-----------.Pl-----------eas-----------e p-----------ing----------- me----------- on-----------cha-----------t I----------- am----------- on-----------lin-----------e o-----------r i-----------nbo-----------x m-----------e a----------- me-----------ssa-----------ge -----------I w-----------ill----------- be-----------