I would like to summarize the following algorithm in one sentence.
Algorithm:
- Let i=1.
- Suppose node i is a source node.
- Obtain the reward accordingly, denoted by R_i.
- Repeat 2) to 3) for i=2, 3, 4, 5, ..., 100.
- By comparing R_1, R_2, ..., R_100, choose which node is the optimal source node.
For the above algorithm, I summarize as follows:
Also, the algorithm is based on a scheme of comparing all cases in which every node is selected as a source node and then choosing the best case.
Is the above statement correctly describing the algorithm above?