Triple

Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).

Phrase: Prim's minimum spanning tree algorithm | Statement: [Fibonacci heap, usedInAlgorithm, Prim's minimum spanning tree algorithm]

Target entity: Prim's minimum spanning tree algorithm
Context triple: [Fibonacci heap, usedInAlgorithm, Prim's minimum spanning tree algorithm]

• A. Kruskal’s minimum spanning tree algorithm
  Kruskal’s minimum spanning tree algorithm is a classic greedy graph algorithm that builds a minimum spanning tree by repeatedly adding the smallest-weight edge that does not create a cycle, typically implemented efficiently using a union–find data structure.
• B. Kruskal
  Kruskal is a surname most prominently associated with American mathematician Martin David Kruskal, known for his work in soliton theory and nonlinear science.
• C. Dijkstra's shortest path algorithm
  Dijkstra's shortest path algorithm is a classic graph algorithm that efficiently computes the minimum-cost paths from a single source vertex to all other vertices in a weighted graph with non-negative edge weights.
• D. Dijkstra
  Dijkstra is a renowned Dutch computer scientist best known for his pioneering work in algorithms, including Dijkstra's shortest path algorithm, and for his influential contributions to programming methodology and software engineering.
• E. Steiner tree problem
  The Steiner tree problem is a classic optimization problem in combinatorial mathematics and computer science that seeks the shortest network of line segments connecting a given set of points, potentially adding extra intermediate points to minimize total length.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"

Entity: Prim's minimum spanning tree algorithm
Triple: [Fibonacci heap, usedInAlgorithm, Prim's minimum spanning tree algorithm]

Prim's minimum spanning tree algorithm is a greedy graph algorithm that incrementally builds a minimum-cost spanning tree by repeatedly adding the cheapest edge connecting the growing tree to a new vertex.

Target entity: Prim's minimum spanning tree algorithm
Target entity description: Prim's minimum spanning tree algorithm is a greedy graph algorithm that incrementally builds a minimum-cost spanning tree by repeatedly adding the cheapest edge connecting the growing tree to a new vertex.

• A. Kruskal’s minimum spanning tree algorithm
  Kruskal’s minimum spanning tree algorithm is a classic greedy graph algorithm that builds a minimum spanning tree by repeatedly adding the smallest-weight edge that does not create a cycle, typically implemented efficiently using a union–find data structure.
• B. Kruskal
  Kruskal is a surname most prominently associated with American mathematician Martin David Kruskal, known for his work in soliton theory and nonlinear science.
• C. Dijkstra's shortest path algorithm
  Dijkstra's shortest path algorithm is a classic graph algorithm that efficiently computes the minimum-cost paths from a single source vertex to all other vertices in a weighted graph with non-negative edge weights.
• D. Dijkstra
  Dijkstra is a renowned Dutch computer scientist best known for his pioneering work in algorithms, including Dijkstra's shortest path algorithm, and for his influential contributions to programming methodology and software engineering.
• E. Steiner tree problem
  The Steiner tree problem is a classic optimization problem in combinatorial mathematics and computer science that seeks the shortest network of line segments connecting a given set of points, potentially adding extra intermediate points to minimize total length.
• F. None of above. chosen