• Status: Solved
  • Priority: Medium
  • Security: Public
  • Views: 264
  • Last Modified:

Discreted graph

Hi guys: Is this is correct according to the question ? Thanks.

A belongs to B
A belongs to C
B belongs to C
B belongs to E
B belongs to D
C belongs to F
D belongs to E
E belongs to F

p22.JPG
0
mustish1
Asked:
mustish1
  • 2
1 Solution
 
aburrCommented:
I am not sure what you want. The question askes for a mumber but you have not supplied one.
Looking at your note it seems you have left out at least one line (C to E)
But there are less than 8 distinct paths
0
 
maeltarCommented:
The easy way, count the arrow heads ...

9
0
 
GwynforWebCommented:
Your decision tree is as below. There a re 5 routes.
           a
        /      \
       b         c
    /  |  \     /  \
  d  e    c  e    f
  /   |   /  \   \
 e   f  e    f    f
/       /
f       f
0
 
GwynforWebCommented:
...sorry 6 routes, ie 6 leaf nodes.
0

Featured Post

Hire Technology Freelancers with Gigs

Work with freelancers specializing in everything from database administration to programming, who have proven themselves as experts in their field. Hire the best, collaborate easily, pay securely, and get projects done right.

  • 2
Tackle projects and never again get stuck behind a technical roadblock.
Join Now