用于学习算法以解决最小路问题的WEB工具

Exacta Pub Date : 2022-10-13 DOI:10.5585/exactaep.2022.22247
Wilson Da Silva Lourenço, Wonder Alexandre Luiz Alves, Stanley Jefferson de Araujo Lima, S. D. Araújo
{"title":"用于学习算法以解决最小路问题的WEB工具","authors":"Wilson Da Silva Lourenço, Wonder Alexandre Luiz Alves, Stanley Jefferson de Araujo Lima, S. D. Araújo","doi":"10.5585/exactaep.2022.22247","DOIUrl":null,"url":null,"abstract":"This paper proposes a web-based computational tool (accessible on the internet) to help students understand how work algorithms to solve the shortest path problem (SPP), which are commonly taught in undergraduate courses such as Production Engineering, Computer Science and Information Systems. The proposed tool has an interactive graphical interface, which uses resources from the JUNG library (Java Universal Network/Graph), and allows the student to represent and solve the investigated problem, in addition to develop their understanding of the available algorithms (Dijkstra, A* and Greedy Search).","PeriodicalId":30294,"journal":{"name":"Exacta","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2022-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"FERRAMENTA WEB PARA APRENDIZAGEM DE ALGORITMOS PARA SOLUÇÃO DO PROBLEMA DE CAMINHO MÍNIMO\",\"authors\":\"Wilson Da Silva Lourenço, Wonder Alexandre Luiz Alves, Stanley Jefferson de Araujo Lima, S. D. Araújo\",\"doi\":\"10.5585/exactaep.2022.22247\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes a web-based computational tool (accessible on the internet) to help students understand how work algorithms to solve the shortest path problem (SPP), which are commonly taught in undergraduate courses such as Production Engineering, Computer Science and Information Systems. The proposed tool has an interactive graphical interface, which uses resources from the JUNG library (Java Universal Network/Graph), and allows the student to represent and solve the investigated problem, in addition to develop their understanding of the available algorithms (Dijkstra, A* and Greedy Search).\",\"PeriodicalId\":30294,\"journal\":{\"name\":\"Exacta\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-10-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Exacta\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5585/exactaep.2022.22247\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Exacta","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5585/exactaep.2022.22247","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文提出了一种基于网络的计算工具(可在互联网上访问),以帮助学生了解如何使用算法来解决最短路径问题(SPP),该问题通常在生产工程、计算机科学和信息系统等本科课程中教授。所提出的工具具有交互式图形界面,该界面使用JUNG库(Java通用网络/图形)中的资源,并允许学生表示和解决所研究的问题,此外还可以发展他们对可用算法(Dijkstra、A*和Greedy Search)的理解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
FERRAMENTA WEB PARA APRENDIZAGEM DE ALGORITMOS PARA SOLUÇÃO DO PROBLEMA DE CAMINHO MÍNIMO
This paper proposes a web-based computational tool (accessible on the internet) to help students understand how work algorithms to solve the shortest path problem (SPP), which are commonly taught in undergraduate courses such as Production Engineering, Computer Science and Information Systems. The proposed tool has an interactive graphical interface, which uses resources from the JUNG library (Java Universal Network/Graph), and allows the student to represent and solve the investigated problem, in addition to develop their understanding of the available algorithms (Dijkstra, A* and Greedy Search).
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
57
审稿时长
16 weeks
期刊最新文献
Método combinado na previsão de séries temporais de consumo de energia elétrica Integração de ferramentas de auxílio a tomada de decisão para a avaliação estratégica em empresa de prestação de serviços Análise de lucratividade baseada no Time-Driven Activity Based-Costing (TDABC) em uma organização de serviços contábeis de Santa Catarina Exploring the Interplay of Agile Methodologies, Resilience, and ESG in Supply Chains: Gestão de Perdas em uma Indústria Alimentícia
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1