I use PERL to participate in many online quiz websites like codechef, hackerrank etc. In such contest, installing a module like Graphs is not allowed. I observed that no one attempts such problem using PERL, most of them use C++, but in other problems, people do you PERL a lot.
I am looking for a approach in PERL without using any module for TREE problems
Sample problem: find shortest path from a to b
Input line 1= no of vertex(v) and no of edges(e)(separated by space) Next e lines containing v1 and v2 ie there exists a edge between v1 and v2 Next line contains a and b Sample: 5 6 1 2 2 3 2 4 4 5 1 3 3 5 1 5 So we want shortest path from 1 to 5 OUTPUT 1-3-5
In reply to Tree in perl by saurabh2k26
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |