diff --git a/crates/swc_fast_graph/src/digraph.rs b/crates/swc_fast_graph/src/digraph.rs
index f6522acce046..e083af67ef19 100644
--- a/crates/swc_fast_graph/src/digraph.rs
+++ b/crates/swc_fast_graph/src/digraph.rs
@@ -6,7 +6,7 @@
 use std::{
     cmp::Ordering,
     fmt,
-    hash::{self, Hash},
+    hash::{self, BuildHasherDefault, Hash},
     iter::{Cloned, DoubleEndedIterator, FromIterator},
     marker::PhantomData,
     ops::Deref,
@@ -27,6 +27,8 @@ use petgraph::{
 };
 use swc_common::collections::AHashSet;
 
+type FxBuildHasher = BuildHasherDefault<FxHasher>;
+
 /// A `GraphMap` with directed edges.
 ///
 /// For example, an edge from *1* to *2* is distinct from an edge from *2* to
@@ -59,8 +61,8 @@ pub type FastDiGraphMap<N, E> = FastGraphMap<N, E, Directed>;
 /// Depends on crate feature `graphmap` (default).
 #[derive(Clone)]
 pub struct FastGraphMap<N, E, Ty> {
-    nodes: IndexMap<N, Vec<(N, CompactDirection)>, ahash::RandomState>,
-    edges: IndexMap<(N, N), E, ahash::RandomState>,
+    nodes: IndexMap<N, Vec<(N, CompactDirection)>, FxBuildHasher>,
+    edges: IndexMap<(N, N), E, FxBuildHasher>,
     ty: PhantomData<Ty>,
 }
 
@@ -584,7 +586,7 @@ where
     Ty: EdgeType,
 {
     from: N,
-    edges: &'a IndexMap<(N, N), E, ahash::RandomState>,
+    edges: &'a IndexMap<(N, N), E, FxBuildHasher>,
     iter: Neighbors<'a, N, Ty>,
 }