Draw the diagram for the following
| Activity | Predecessor |
| A | - |
| B | - |
| C | A |
| D | B |
| E | B |
| F | D |
| G | E |
On examining the predecessor relation they contain single letter hence we can proceed for the following diagram
In predecessor relation C,F,G are absent. Hence there will be 3 hanging nodes in the diagram. All those nodes should be merged & indicated as a single node.
No comments:
Post a Comment