ERNESTO MARTINS'
Personal Home Page




FORTRAN SOURCE CODES:

    Random Generator Network Problems:
    1. Greedy networks
    2. Undirected greedy networks
    3. Acyclic networks
    4. Shortest paths problems
    5. K Shortest paths problems
    6. Biobjective optimal path problems
      1. Shortest and Maximal Capacity path
    7. Max-Flow Problems
    8. Minimal Spanning Tree Problems

    Algorithms:
    1. Shortest Path Algorithms
      1. Label Correcting Algorithms
        1. Bellman-Ford-Moore Version
        2. Bellman-Ford-Moore Version with parent-checking
        3. Pape-Levit Version
      2. Label Setting Algorithms
        1. Dijkstra's Adressed Calculation Sort First Version
        2. Dijkstra's Adressed Calculation Sort Second Version
    2. Minimal Spanning Tree Algorithms
      1. Kruskal's Algorithm
        1. Version using quick sort
      2. Prim's Algorithm
        1. Version 1 (with quick sort)
        2. Version 2 (with quick sort)
        3. Version 3 (with shell sort)
    3. Martins and Salgueiro Incremental Chain Max-Flow Algorithm
      1. Static Data Structures:
        1. Doubly Linked List Version
        2. Doubly Linked List plus Tree Version
      2. Dynamic Data Structure :
        1. Doubly Linked List Version
        2. Doubly Linked List plus Tree Version
    4. Shortest and Maximal Capacity Path Algorithm
      1. Ranking Paths Algorithm
        1. First Code
        2. Second Code
        3. Third Code
        4. Fourth Code
      2. Labeling Algorithms
        1. Label Seting Code
    5. K Shortest Paths Problem
        Improved MS algorithm
      1. FORTRAN 77 Code
        (Gziped PostScript Paper)(80056 bytes)
        To obtain the code (under unix or linux) and after copy the file execute
        gunzip imp.tar.gz; tar -xf imp.tar





    BACK


    HOME PAGE



    BACK MATH'S DEPARTMENT