← Lab · Chapter: Constructive heuristics
Vertex coloring: greedy and DSATUR¶
The graph is colored vertex by vertex with greedy and DSATUR: Petersen, crown graph or a random graph. Drag the vertices; ◀ ▶ one vertex at a time, «Run» to watch them all.
← Lab · Chapter: Constructive heuristics
The graph is colored vertex by vertex with greedy and DSATUR: Petersen, crown graph or a random graph. Drag the vertices; ◀ ▶ one vertex at a time, «Run» to watch them all.