Scippy

    SCIP

    Solving Constraint Integer Programs

    DIJKSTRA_Graph Struct Reference

    Detailed Description

    graph structure - use consecutive storage for arcs

    Definition at line 52 of file dijkstra.h.

    #include <dijkstra.h>

    Data Fields

    unsigned int nodes
     
    unsigned int * outbeg
     
    unsigned int * outcnt
     
    unsigned int arcs
     
    unsigned int * weight
     
    unsigned int * head
     
    unsigned int minweight
     
    unsigned int maxweight
     

    Field Documentation

    ◆ nodes

    unsigned int DIJKSTRA_Graph::nodes

    ◆ outbeg

    unsigned int* DIJKSTRA_Graph::outbeg

    indices of out-arcs for each node in arcs array

    Definition at line 55 of file dijkstra.h.

    Referenced by dijkstra(), dijkstraGraphIsValid(), dijkstraPair(), dijkstraPairCutoff(), dijkstraPairCutoffIgnore(), isNeighbor(), and separateGLS().

    ◆ outcnt

    unsigned int* DIJKSTRA_Graph::outcnt

    number of out-arcs for each node

    Definition at line 56 of file dijkstra.h.

    Referenced by addGLSCliques(), dijkstraGraphIsValid(), isNeighbor(), and separateGLS().

    ◆ arcs

    unsigned int DIJKSTRA_Graph::arcs

    consecutive storage for all arcs

    Definition at line 57 of file dijkstra.h.

    Referenced by dijkstraGraphIsValid(), and separateGLS().

    ◆ weight

    unsigned int* DIJKSTRA_Graph::weight

    ◆ head

    unsigned int* DIJKSTRA_Graph::head

    ◆ minweight

    unsigned int DIJKSTRA_Graph::minweight

    total minimal weight

    Definition at line 60 of file dijkstra.h.

    Referenced by addGLSCliques(), dijkstraGraphIsValid(), and separateGLS().

    ◆ maxweight

    unsigned int DIJKSTRA_Graph::maxweight

    total maximal weight

    Definition at line 61 of file dijkstra.h.

    Referenced by addGLSCliques(), dijkstraGraphIsValid(), and separateGLS().