Algorithmic Networks and Object-Oriented Programming
The article considers relevance of using the formalism of algorithmic networks in terms of object-oriented programming and the development of the basic ideology of using the formalism of algorithmic networks to solve problems in the framework of object-oriented systems is considered. A solution is p...
Uloženo v:
| Vydáno v: | E3S web of conferences Ročník 363; s. 1003 |
|---|---|
| Hlavní autoři: | , , , , |
| Médium: | Journal Article Konferenční příspěvek |
| Jazyk: | angličtina |
| Vydáno: |
Les Ulis
EDP Sciences
01.01.2022
|
| Témata: | |
| ISSN: | 2267-1242, 2555-0403, 2267-1242 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | The article considers relevance of using the formalism of algorithmic networks in terms of object-oriented programming and the development of the basic ideology of using the formalism of algorithmic networks to solve problems in the framework of object-oriented systems is considered. A solution is proposed to create a network of connected objects of a certain structure with the formalism of algorithmic networks and its algorithmic completeness. The choice of the platform for the implementation of the required task on the software part was made, providing full support for the object-oriented paradigm and allowing the use of the event mechanism and the delegate mechanism. The main classes of the system are presented, and the interaction between them is discussed in detail in the execution diagram. The process of setting an algorithmic network and its calculation is considered. The ability to set algorithmic networks programmatically is implemented, which further allows you to create the required configuration of the algorithmic network and save it as files. The calculation process is considered. |
|---|---|
| Bibliografie: | ObjectType-Conference Proceeding-1 SourceType-Conference Papers & Proceedings-1 content type line 21 |
| ISSN: | 2267-1242 2555-0403 2267-1242 |
| DOI: | 10.1051/e3sconf/202236301003 |