摘要
文章着重探讨读者通过城市群图书馆联机检索软件获取文献资料信息过程中,如何获得联机典藏馆之间的最短路径排序问题。针对单册文献借阅,考虑读者到典藏馆的距离,设计了冒泡排序算法;针对多册文献借阅,考虑文献有序和无序两种情形,设计了相应的最优路径算法。
This article mainly discusses how to obtain the sequencing of the shortest path between online libraries when the readers use the library online retrieval software to seek document information.As for the borrowing of a single literature,this article designs a bubble sort algorithm to take the distance between the reader and the library into account.As for the borrowing of many literatures,this article designs a corresponding optimal path algorithm to take the conditions of the literatures in order and in disorder into account.
出处
《情报理论与实践》
CSSCI
北大核心
2013年第6期110-113,共4页
Information Studies:Theory & Application
基金
湖南省图工委科研资助项目"长株潭城市群‘两型社会’建设中乡镇社区图书馆建设模式选择研究"的成果之一
项目编号:2011L005
关键词
图书馆联盟
读者
馆际互借
算法
library alliance
reader
interlibrary loan
algorithm
