Homework 7 question 2 question.

R. Clayton (rclayton@monmouth.edu)
Wed, 26 Apr 2000 09:34:15 -0400 (EDT)

• Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
• Previous message: R. Clayton: "The greedy-choice property for Huffman's algorithm."

In problem 2, if you are given the matrix

   p1 p2 p3
p1 . T T
p2 F . F
p3 F T .

the facts are

p1 invited p2
p1 invited p3
p3 invited p2

and we can't solve the problem such that pa invited pb invited pc in any order.

  How about "p1 invited p3 invited p2"? You don't have to use all the facts
  when forming a chain (in fact, you can't use all the facts when they form a
  cycle, as when p1 invited p2 invited p3 invited p1).

• Previous message: R. Clayton: "The greedy-choice property for Huffman's algorithm."

This archive was generated by hypermail 2.0b3 on Wed Apr 26 2000 - 09:35:05 EDT