Given a directed graph with negative edge weights, Dijkstra's algorithm is capable of finding the shortest path between two nodes.

In a Do...Loop statement, a condition can be phrased as either a looping condition or a loop enter condition.

Answer the following statement true (T) or false (F)

Which of the following is not a component of project management?

A. goals and objectives B. timeline C. end user evaluation D. resources