四种最短路径算法实例分析
通过理论分析,结合实际应用,在GIS节点数很大的数字地形图中,从完备性、最优性、时间复杂度、空间复杂度几种性能问题实例分析,较系统地总结出深度优先搜索(DFS)、广度优先搜索(BFS)、双向广度优先搜索(DBFS)、A★算法四种算法代价及优缺点....
Gespeichert in:
| Veröffentlicht in: | 电脑知识与技术 2007, Vol.3 (16), p.1030-1032 |
|---|---|
| 1. Verfasser: | |
| Format: | Magazinearticle |
| Sprache: | chi |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 1032 |
|---|---|
| container_issue | 16 |
| container_start_page | 1030 |
| container_title | 电脑知识与技术 |
| container_volume | 3 |
| creator | 陈圣群 滕忠坚 洪亲 陈清华 |
| description | 通过理论分析,结合实际应用,在GIS节点数很大的数字地形图中,从完备性、最优性、时间复杂度、空间复杂度几种性能问题实例分析,较系统地总结出深度优先搜索(DFS)、广度优先搜索(BFS)、双向广度优先搜索(DBFS)、A★算法四种算法代价及优缺点. |
| doi_str_mv | 10.3969/j.issn.1009-3044.2007.16.077 |
| format | Magazinearticle |
| fullrecord | <record><control><sourceid>wanfang_jour_chong</sourceid><recordid>TN_cdi_wanfang_journals_dnzsyjs_itrzyksb200716077</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><cqvip_id>1000116937</cqvip_id><wanfj_id>dnzsyjs_itrzyksb200716077</wanfj_id><sourcerecordid>dnzsyjs_itrzyksb200716077</sourcerecordid><originalsourceid>FETCH-LOGICAL-c717-27404891357f9510ddd8134a534a8306ec08b9c675e7fc4d7572c279ea25f5ef3</originalsourceid><addsrcrecordid>eNo9jz1Lw1AUhu-gYKn9F1kTz_3KyR2l-AUFl-4hucmtSUuKvYq0k4OIIIKLdKjU0ck6OLj115jEn2Gk4nB44cDzvjyEOBQ8rny1l3uZtYVHAZTLQQiPAaBHfQ8Qt0jr_79DOtZmMYBkLBBUtIhTLhb160P1fF2_vH1_vpfrm3o1rz6eytXya31f3t1Wy8ddsm2ikU07f9km_cODfvfY7Z0enXT3e65Gii5DASJQlEs0SlJIkiSgXESyuYCDn2oIYqV9lCkaLRKUyDRDlUZMGpka3iZ0U3sVFSYqBmE-vpwUzWCYFDM7zW2YXUxm06GNf_Wo38g1jLNh9Nm4GJxnDRVHemiyURo22kCprzjyH-4IX5U</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>magazinearticle</recordtype></control><display><type>magazinearticle</type><title>四种最短路径算法实例分析</title><source>Alma/SFX Local Collection</source><creator>陈圣群 滕忠坚 洪亲 陈清华</creator><creatorcontrib>陈圣群 滕忠坚 洪亲 陈清华</creatorcontrib><description>通过理论分析,结合实际应用,在GIS节点数很大的数字地形图中,从完备性、最优性、时间复杂度、空间复杂度几种性能问题实例分析,较系统地总结出深度优先搜索(DFS)、广度优先搜索(BFS)、双向广度优先搜索(DBFS)、A★算法四种算法代价及优缺点.</description><identifier>ISSN: 1009-3044</identifier><identifier>DOI: 10.3969/j.issn.1009-3044.2007.16.077</identifier><language>chi</language><publisher>医学光电科学与技术教育部重点实验室,福建师范大学,福建,福州,350007</publisher><subject>A★算法 ; 双向广度优先搜索 ; 广度优先搜索 ; 最短路径算法 ; 深度优先搜索</subject><ispartof>电脑知识与技术, 2007, Vol.3 (16), p.1030-1032</ispartof><rights>Copyright © Wanfang Data Co. Ltd. All Rights Reserved.</rights><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttp://image.cqvip.com/vip1000/qk/98164B/98164B.jpg</thumbnail><link.rule.ids>776,780,27902</link.rule.ids></links><search><creatorcontrib>陈圣群 滕忠坚 洪亲 陈清华</creatorcontrib><title>四种最短路径算法实例分析</title><title>电脑知识与技术</title><addtitle>Computer Knowledge and Technology</addtitle><description>通过理论分析,结合实际应用,在GIS节点数很大的数字地形图中,从完备性、最优性、时间复杂度、空间复杂度几种性能问题实例分析,较系统地总结出深度优先搜索(DFS)、广度优先搜索(BFS)、双向广度优先搜索(DBFS)、A★算法四种算法代价及优缺点.</description><subject>A★算法</subject><subject>双向广度优先搜索</subject><subject>广度优先搜索</subject><subject>最短路径算法</subject><subject>深度优先搜索</subject><issn>1009-3044</issn><fulltext>true</fulltext><rsrctype>magazinearticle</rsrctype><creationdate>2007</creationdate><recordtype>magazinearticle</recordtype><recordid>eNo9jz1Lw1AUhu-gYKn9F1kTz_3KyR2l-AUFl-4hucmtSUuKvYq0k4OIIIKLdKjU0ck6OLj115jEn2Gk4nB44cDzvjyEOBQ8rny1l3uZtYVHAZTLQQiPAaBHfQ8Qt0jr_79DOtZmMYBkLBBUtIhTLhb160P1fF2_vH1_vpfrm3o1rz6eytXya31f3t1Wy8ddsm2ikU07f9km_cODfvfY7Z0enXT3e65Gii5DASJQlEs0SlJIkiSgXESyuYCDn2oIYqV9lCkaLRKUyDRDlUZMGpka3iZ0U3sVFSYqBmE-vpwUzWCYFDM7zW2YXUxm06GNf_Wo38g1jLNh9Nm4GJxnDRVHemiyURo22kCprzjyH-4IX5U</recordid><startdate>2007</startdate><enddate>2007</enddate><creator>陈圣群 滕忠坚 洪亲 陈清华</creator><general>医学光电科学与技术教育部重点实验室,福建师范大学,福建,福州,350007</general><scope>2RA</scope><scope>92L</scope><scope>CQIGP</scope><scope>W92</scope><scope>~WA</scope><scope>2B.</scope><scope>4A8</scope><scope>92I</scope><scope>93N</scope><scope>PSX</scope><scope>TCJ</scope></search><sort><creationdate>2007</creationdate><title>四种最短路径算法实例分析</title><author>陈圣群 滕忠坚 洪亲 陈清华</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c717-27404891357f9510ddd8134a534a8306ec08b9c675e7fc4d7572c279ea25f5ef3</frbrgroupid><rsrctype>magazinearticle</rsrctype><prefilter>magazinearticle</prefilter><language>chi</language><creationdate>2007</creationdate><topic>A★算法</topic><topic>双向广度优先搜索</topic><topic>广度优先搜索</topic><topic>最短路径算法</topic><topic>深度优先搜索</topic><toplevel>online_resources</toplevel><creatorcontrib>陈圣群 滕忠坚 洪亲 陈清华</creatorcontrib><collection>中文科技期刊数据库</collection><collection>中文科技期刊数据库-CALIS站点</collection><collection>中文科技期刊数据库-7.0平台</collection><collection>中文科技期刊数据库-工程技术</collection><collection>中文科技期刊数据库- 镜像站点</collection><collection>Wanfang Data Journals - Hong Kong</collection><collection>WANFANG Data Centre</collection><collection>Wanfang Data Journals</collection><collection>万方数据期刊 - 香港版</collection><collection>China Online Journals (COJ)</collection><collection>China Online Journals (COJ)</collection><jtitle>电脑知识与技术</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>陈圣群 滕忠坚 洪亲 陈清华</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>四种最短路径算法实例分析</atitle><jtitle>电脑知识与技术</jtitle><addtitle>Computer Knowledge and Technology</addtitle><date>2007</date><risdate>2007</risdate><volume>3</volume><issue>16</issue><spage>1030</spage><epage>1032</epage><pages>1030-1032</pages><issn>1009-3044</issn><abstract>通过理论分析,结合实际应用,在GIS节点数很大的数字地形图中,从完备性、最优性、时间复杂度、空间复杂度几种性能问题实例分析,较系统地总结出深度优先搜索(DFS)、广度优先搜索(BFS)、双向广度优先搜索(DBFS)、A★算法四种算法代价及优缺点.</abstract><pub>医学光电科学与技术教育部重点实验室,福建师范大学,福建,福州,350007</pub><doi>10.3969/j.issn.1009-3044.2007.16.077</doi><tpages>3</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1009-3044 |
| ispartof | 电脑知识与技术, 2007, Vol.3 (16), p.1030-1032 |
| issn | 1009-3044 |
| language | chi |
| recordid | cdi_wanfang_journals_dnzsyjs_itrzyksb200716077 |
| source | Alma/SFX Local Collection |
| subjects | A★算法 双向广度优先搜索 广度优先搜索 最短路径算法 深度优先搜索 |
| title | 四种最短路径算法实例分析 |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-11T07%3A54%3A27IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-wanfang_jour_chong&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=%E5%9B%9B%E7%A7%8D%E6%9C%80%E7%9F%AD%E8%B7%AF%E5%BE%84%E7%AE%97%E6%B3%95%E5%AE%9E%E4%BE%8B%E5%88%86%E6%9E%90&rft.jtitle=%E7%94%B5%E8%84%91%E7%9F%A5%E8%AF%86%E4%B8%8E%E6%8A%80%E6%9C%AF&rft.au=%E9%99%88%E5%9C%A3%E7%BE%A4%20%E6%BB%95%E5%BF%A0%E5%9D%9A%20%E6%B4%AA%E4%BA%B2%20%E9%99%88%E6%B8%85%E5%8D%8E&rft.date=2007&rft.volume=3&rft.issue=16&rft.spage=1030&rft.epage=1032&rft.pages=1030-1032&rft.issn=1009-3044&rft_id=info:doi/10.3969/j.issn.1009-3044.2007.16.077&rft_dat=%3Cwanfang_jour_chong%3Ednzsyjs_itrzyksb200716077%3C/wanfang_jour_chong%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_cqvip_id=1000116937&rft_wanfj_id=dnzsyjs_itrzyksb200716077&rfr_iscdi=true |