Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
interval_tree_example.cc File Reference

Example: meeting scheduler and 1D segment intersection. More...

#include <iostream>
#include <tpl_interval_tree.H>
Include dependency graph for interval_tree_example.cc:

Go to the source code of this file.

Functions

void meeting_scheduler ()
 Scenario 1: Meeting scheduler — detect conflicts.
 
void segment_intersection ()
 Scenario 2: 1D segment intersection.
 
int main ()
 

Detailed Description

Example: meeting scheduler and 1D segment intersection.

Definition in file interval_tree_example.cc.

Function Documentation

◆ main()

int main ( )

Definition at line 148 of file interval_tree_example.cc.

References meeting_scheduler(), and segment_intersection().

◆ meeting_scheduler()

void meeting_scheduler ( )

Scenario 1: Meeting scheduler — detect conflicts.

Definition at line 44 of file interval_tree_example.cc.

References Aleph::divide_and_conquer_partition_dp(), and Aleph::DynIntervalTree< T, Compare >::insert().

Referenced by main().

◆ segment_intersection()