IDEAS home Printed from https://ideas.repec.org/a/pet/annals/v3y2003p169-176.html
   My bibliography  Save this article

Route and circuit generation in a graph with „XGD&C”

Author

Listed:
  • Mircea Preda

    (University of Petroşani, Romania)

Abstract

The great number of relations that arise in production process, in exchange and many other activities, set us the task of analyzing and studying the characteristics of the relations between partners, phenomena, processes or activities with a view to rendering the activity efficient. Modeling these relations leads to graph notion and automatically to studying and analyzing the fundamental elements in the graph: type, routes, circuits, the route and circuit length, etc. that eventually lead to the optimization problems. The analysis of graph characteristics, the working-out of binary matrices of routes existence of length k, of matrices with the number of routes of k length and the effective construction of routes and circuits is an arduous activity, which often presents theory from being into practice. The XGD&C application (Route and Circuit Generation) is an information product, realized in Management System of Relational Data Base (MSRDB) FoxPro 2.6, that enables the generation of fundamental matrices used in the graph theory, interactive visualization of results in a Data Base (DB) with a view to analyzing their characteristics. The calculations, which make a large part of the problems specific to the graph theory be put into practice more easily, are performed automatically by XGD&C.

Suggested Citation

  • Mircea Preda, 2003. "Route and circuit generation in a graph with „XGD&C”," Annals of the University of Petrosani, Economics, University of Petrosani, Romania, vol. 3, pages 169-176.
  • Handle: RePEc:pet:annals:v:3:y:2003:p:169-176
    as

    Download full text from publisher

    File URL: http://www.upet.ro/annals/pdf/Annals-2003.pdf
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:pet:annals:v:3:y:2003:p:169-176. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Imola Driga (email available below). General contact details of provider: http://www.upet.ro/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.