encryptededdy / SE306_TravellingOliverProblem

SE306 Group 14: Travelling Oliver Problem - Parallel Task Scheduler
2 stars 0 forks source link

Dot parser should allow an empty graph #22

Open bcox280 opened 6 years ago

bcox280 commented 6 years ago

Description

When a dot file has an empty graph, it should be accepted as a graph. This is currently not allowed by the parser and should be fixed.

Testing

Please write a test case to test this specific problem, the solution should result in an optimal schedule length of 0, and of course an empty schedule

encryptededdy commented 6 years ago

This is intentional. Are you sure this is a bug?

encryptededdy commented 6 years ago

Specifically, the error thrown says "Cycle found in acyclic graph (or empty)"

bcox280 commented 6 years ago

As we are moving to use an external library, we can see what the behaviour of the library does with an empty graph

encryptededdy commented 6 years ago

Nope, my code will still throw an exception when it looks for entry nodes.

bcox280 commented 6 years ago

We will need to confide in our client to figure out the expected behaviour then

encryptededdy commented 6 years ago

Well we didn't lose marks for this so I'm gonna mark this as wontfix.