Basic Algorithm Implementation

[MarioSinovcic]

Create an algorithm that gives a VALID output.

# Testing is essential.

The output file needs to contain a valid schedule (which does not need to be optimal at this point).

Example Output:

digraph "outputExample" {
a              [Weight=2,Start=0,Processor=1];
b              [Weight=3,Start=2,Processor=1];
a−> b       [ Weight=1];
c              [ Weight=3,Start=4,Processor=2];
a−> c       [Weight=2];
d              [Weight=2,Start=7,Processor=2];
b−> d       [ Weight=2];
c−> d       [ Weight=1];
}