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}
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).
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
