1. What is the total number of ways to reach A to B in the network given, such that no node is included twice and one can only move from left to right?
Write Comment
Comments
By: anil on 05 May 2019 02.29 am
4 first level nodes are connected to A => 4 ways. Each of these first level nodes are connected to 1 second level node by four connections => 4 ways Each of these second level nodes are connected to 2 third level nodes => 2 ways. Each of these third level nodes are connected to B by 1 route => 1 way => 4 * 4 * 2 * 1 = 32 ways.
Terms And Service:We do not guarantee the accuracy of available data ..We Provide Information On Public Data.. Please consult an expert before using this data for commercial or personal use