### Question:
SmallestDegreeLastColoring extends GreedyColoring<V, E> { public SmallestDegreeLastColoring(Graph<V, E> graph) { super(graph); } SmallestDegreeLastColoring(Graph<V, E> graph);   }### Answer:
@Test public void testSmallestDegreeLastColoring() { Graph<Integer, DefaultEdge> g = createGraph1(); Coloring<Integer> coloring = new SmallestDegreeLastColoring<>(g).getColoring(); assertEquals(3, coloring.getNumberColors()); Map<Integer, Integer> colors = coloring.getColors(); assertEquals(2, colors.get(1).intValue()); assertEquals(0, colors.get(2).intValue()); assertEquals(1, colors.get(3).intValue()); assertEquals(0, colors.get(4).intValue()); assertEquals(0, colors.get(5).intValue()); }