{"title":"解决路径问题的通用c++库","authors":"M. Botincan","doi":"10.2498/CIT.2004.02.13","DOIUrl":null,"url":null,"abstract":"Path problems are a family of frequently encountered optimization and enumeration problems. Although they are specific each for itself, theory provides a mathematical framework for treatment of path problems in a general way. In this paper we describe a generic C++ library based on algebraic approach for solving path problems. The classes and functions in the library are very compact and written with intention to be extensively combined. In this way many different concrete path problems can be solved by using the same set of programming components","PeriodicalId":320305,"journal":{"name":"26th International Conference on Information Technology Interfaces, 2004.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A generic C++ library for solving path problems\",\"authors\":\"M. Botincan\",\"doi\":\"10.2498/CIT.2004.02.13\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Path problems are a family of frequently encountered optimization and enumeration problems. Although they are specific each for itself, theory provides a mathematical framework for treatment of path problems in a general way. In this paper we describe a generic C++ library based on algebraic approach for solving path problems. The classes and functions in the library are very compact and written with intention to be extensively combined. In this way many different concrete path problems can be solved by using the same set of programming components\",\"PeriodicalId\":320305,\"journal\":{\"name\":\"26th International Conference on Information Technology Interfaces, 2004.\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-06-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"26th International Conference on Information Technology Interfaces, 2004.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2498/CIT.2004.02.13\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"26th International Conference on Information Technology Interfaces, 2004.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2498/CIT.2004.02.13","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Path problems are a family of frequently encountered optimization and enumeration problems. Although they are specific each for itself, theory provides a mathematical framework for treatment of path problems in a general way. In this paper we describe a generic C++ library based on algebraic approach for solving path problems. The classes and functions in the library are very compact and written with intention to be extensively combined. In this way many different concrete path problems can be solved by using the same set of programming components
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
