Drop duplicate comment

This commit is contained in:
Richard Feldman 2019-11-27 17:30:04 -05:00
parent fe86c3b49d
commit 6a161e816f

View file

@ -22,8 +22,6 @@
// Secondarily, SipHash isn't the fastest hashing algorithm out there, so we can get // Secondarily, SipHash isn't the fastest hashing algorithm out there, so we can get
// slightly better performance by using a faster hasher. // slightly better performance by using a faster hasher.
// Find a topological order in a directed graph if one exists.
use collections::{default_hasher, BuildHasher, MutSet}; use collections::{default_hasher, BuildHasher, MutSet};
use std::collections::{HashMap, HashSet, VecDeque}; use std::collections::{HashMap, HashSet, VecDeque};
use std::hash::Hash; use std::hash::Hash;