会议专题

A New Programming Method Avoiding Complicated Process Design

Programming includes operation and data structures. Given a certain storage structures, programmers need to design logical structure accordingly and decide proper logical structures of the algorithm. Designing logical structures for data and algorithms is one of the most onerous tasks for programming. By solving the maze problem through graph theory, a new programming method which is proposed in this paper omits the complicated logical structure design and focuses on the input and output interface of storage structure. In this paper, two real examples are given to show the new programming procedure. Through the new method, a set of programming tasks became much simpler.

Data structure The logical structure The graph theory The maze problem Programming

Zheping Yang Jinguo He

College of Science Minzu University of China Beijing,China

国际会议

2011 3rd International Conference on Computer and Network Technology(ICCNT 2011)(2011第三届IEEE计算机与网络技术国际会议)

太原

英文

160-163

2011-02-26(万方平台首次上网日期,不代表论文的发表时间)