목록graphs (1)

되는대로 살자

[영어 원서 독해] algorithms and programming - Paths in graphs 1

Chapter 4 Paths in graphs 4.1 Distances Depth-rst search readily identies all the vertices of a graph that can be reached from a designated starting point. It also nds explicit paths to these vertices, summarized in its search tree (Figure 4.1). However, these paths might not be the most economical ones possible. In the gure, vertex C is reachable from S by traversing just one edge, while the DF..
카테고리 없음 2011. 5. 26. 22:02
이전 Prev 1 Next 다음