GraphRAG uses a lengthy prompt with examples to make the LLM identify all entities (name, type, description) from given entity types, then identify pairs of related source/target entities with a relationship description and an integer strength score from 1 to 10, which is later used when merging the subgraphs.