Scippy

SCIP

Solving Constraint Integer Programs

Data Structures

Detailed Description

commonly used data structures

Below you find a list of available data structures

Modules

 Queue
 circular FIFO queue
 
 Priority Queue
 priority queue with O(1) access to the minimum element
 
 Hash Table
 hash table that resolves conflicts by probing
 
 Multi Hash table
 hash table that resolves conflicts by queueing, thereby allowing for duplicate entries
 
 Hash Map
 hash map to store key-value pairs (called origin and image)
 
 Resource Activity
 ressource activity data structure
 
 Resource Profile
 ressource profile data structure
 
 Directed Graph
 graph structure with common algorithms for directed and undirected graphs
 
 Binary Search Tree
 binary search tree data structure
 
 Dynamic Arrays
 methods for the creation and access of dynamic arrays