If you had any particular difficult with the requirements, basically, a string of node connections ( ex. "A to B", "B to C" listed as an inputs "AB" or "BC") need to be shown.
at times, there may be branching ( "C" may branch into both "D" and "F", the listed as "CD" and "CF").. each unique branch needs to be listed
A second input allows a failure module (or, node) to be chosen ( if "F" is chosen then a "*" follows "F", appearing as "F*" )
Each unique branch needs to be spaced (exploded) with each node in order of relation.
For example, using the above mentioned nodes:
Those are the four requirements
Fyi, the string, for example, would be listed as :
Any node can be a failure imputed as a failure node ( for example, if "C" is the failure node then it will print as "C*")
Hi, sir! I have 3+ years of experience of developing algorithm. Please trust me and send me more detailed description. I will show you good result. My skype id is daystar8834. Sincerely, totori1990