diff options
| author | Sahand Kashani-Akhavan | 2020-03-10 22:53:48 +0100 |
|---|---|---|
| committer | GitHub | 2020-03-10 21:53:48 +0000 |
| commit | aa79cb656a7e72c6fbfb8218388f3a76f45ceb03 (patch) | |
| tree | f01cc9e2d665dda936453d183899dd363791931d | |
| parent | 113a4aa3641c49b4c86e0cc23b3897b935c9b445 (diff) | |
Fix copy-paste error in DiGraph.linearize documentation (#1324)
Co-authored-by: Albert Magyar <albert.magyar@gmail.com>
| -rw-r--r-- | src/main/scala/firrtl/graph/DiGraph.scala | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/main/scala/firrtl/graph/DiGraph.scala b/src/main/scala/firrtl/graph/DiGraph.scala index d3015b5a..e3b5fbe9 100644 --- a/src/main/scala/firrtl/graph/DiGraph.scala +++ b/src/main/scala/firrtl/graph/DiGraph.scala @@ -91,7 +91,7 @@ class DiGraph[T] private[graph] (private[graph] val edges: LinkedHashMap[T, Link /** Linearizes (topologically sorts) a DAG * * @throws CyclicException if the graph is cyclic - * @return a Map[T,T] from each visited node to its predecessor in the + * @return a Seq[T] describing the topological order of the DAG * traversal */ def linearize: Seq[T] = { |