graph

graph / IsAcyclic / 0.1.0

README.md
Returns true if and only if a directed graph contains no cycles.

Input:
  • A graph represented as a map from vertices (strings) to a list of neighbors (list of strings).