Contents (hide)

# Assignment 4

## General Information

 Contact Person Ariel Sapir Submission deadline 02/06/2005 05/06/2016
For administration problems contact algo162@cs.bgu.ac.il

## Clarifications

• In question 1 the graph is directed.

• In question 3-B) when calling to Dijkstra in pg.4 in procedure findHappy(G,w), the call is from starting vertex s0.

• In question 3-C) when calling to color-visit on vi's neighbours, the index c is increased by 1.

• In question 3-C) in procedure CSFS, if not returned false - the algorithm will return true (and the periodic partition as well).

• Added few lines in question 2-A) and 2-C) in the answer sheet.

## Forum

• We will try to answer questions as fast as we can, but this is not 24/7 online forum. Don’t wait to the deadline to ask your question.
• Inappropriate questions will not be answered. We will also ignore questions that repeats themselves.
• Please avoid publishing solutions (or part of the solutions) in this forum or in any other forums.

Good Luck ^~^

## 10 last forum topics

by ronyeh - Saturday, 4 June 2016 18:46:05
last update: 5 Jun 2016 01:05:47 by arielsa

3 ג
by ronyeh - Saturday, 4 June 2016 16:21:25
last update: 5 Jun 2016 01:04:07 by arielsa

by mortur - Thursday, 2 June 2016 17:25:09
last update: 5 Jun 2016 00:48:46 by arielsa

by koral - Thursday, 2 June 2016 20:48:36
last update: 2 Jun 2016 23:15:46 by arielsa

שאלה 1א
by morbitt - Wednesday, 1 June 2016 20:08:20
last update: 2 Jun 2016 23:11:37 by arielsa

by amir3 - Wednesday, 1 June 2016 01:38:07
last update: 2 Jun 2016 23:08:23 by arielsa

by ofirhau - Thursday, 2 June 2016 02:23:18
last update: 2 Jun 2016 23:05:21 by arielsa

by saarsch - Thursday, 2 June 2016 14:40:35
last update: 2 Jun 2016 23:04:29 by arielsa

שאלה 1ב'