Simplifying test requirement suite is helpful for optimizing test case suite, as is proposed in this paper, it bases on adjacency list. Primarily, confirmed the test requirements and generated the initial test case suite according to program flow diagram, then drew the directed graph of relationships of test requirements and its corresponding adjacency list, analyzed its relationships between head-node and linked-list-node, finally simplified the requirements. It is indicated by the example that this algorithm could eliminate the relationships of equivalence and inclusion in test requirements automatically and reserve the mutually exclusive relationships and so on. Correctness and validity are demonstrated by the result of calculation corresponding to the one of manual analysis.