---
tag: 4CS9H7QS3R
kind: concept
name: Greedy
sources:
  - wikipedia: en:325802@r1373839425
    locator: Glossary of graph theory, section G
    note: adopted
    mention: wikipedia://en/325802#FA7X
    sections: [Summary]
inventory: [1TEEV0E96J]
---

## Summary

Produced by a greedy algorithm. For instance, a greedy coloring of a graph is a coloring produced by considering the vertices in some sequence and assigning each vertex the first available color.