node :bb: --> -->dc:bd: tree no true directed acyclic graph noby definition some vertices remainbut none have no successors weighted graphs answers to questions edges false the lowest-weight (cheapestedge is already the destination of an edge with lower weight false true warshall' algorithm