Abstract
Several graph algorithms were studied, as well as familiarization with the main approaches to software implementation of graphs and related algorithms was carried out. The aim of the work is to develop a software tool that will enable finding the shortest path between the vertices of a weighted graph of orthogonal domains and displaying the results in the user's graphical environment. The problem of searching for the shortest path of a weighted graph of orthogonal rectangular domains can be used in practice to determine the optimal arrangement of logic elements at the stage of development of integrated circuits, according to certain requirements. The weights are determined according to the parameters characterizing that requirement. For example, in an integrated circuit, we can consider logical elements as orthogonal domains and the parameter determining the weight can be the intersection surface of rectangular domains. It is proposed to develop and implement a software tool that, receiving the orthogonal rectangular domains in the input with the appropriate file description or through a graphical interface, will build the weighted graph corresponding to them, will find the shortest path between the vertices of that graph, and will display them in the graphical environment of the software tool.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: INFORMATION TECHNOLOGIES, ELECTRONICS, RADIO ENGINEERING
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
