|Contact Person||Ariel Sapir|
- 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.
ForumPlease read the forum rules:
- Ask your question only after you read the forum. It is most likely that someone already asked the same question before.
- 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
Show all 37 forum topics