diff --git a/gtsam/sfm/MFAS.cpp b/gtsam/sfm/MFAS.cpp
index 4cd983ecd..913752d8a 100644
--- a/gtsam/sfm/MFAS.cpp
+++ b/gtsam/sfm/MFAS.cpp
@@ -121,8 +121,8 @@ MFAS::MFAS(const TranslationEdges& relativeTranslations,
   }
 }
 
-vector<Key> MFAS::computeOrdering() const {
-  vector<Key> ordering;  // Nodes in MFAS order (result).
+KeyVector MFAS::computeOrdering() const {
+  KeyVector ordering;  // Nodes in MFAS order (result).
 
   // A graph is an unordered map from keys to nodes. Each node contains a list
   // of its adjacent nodes. Create the graph from the edgeWeights.
@@ -140,7 +140,7 @@ vector<Key> MFAS::computeOrdering() const {
 
 map<MFAS::KeyPair, double> MFAS::computeOutlierWeights() const {
   // Find the ordering.
-  vector<Key> ordering = computeOrdering();
+  KeyVector ordering = computeOrdering();
 
   // Create a map from the node key to its position in the ordering. This makes
   // it easier to lookup positions of different nodes.
diff --git a/gtsam/sfm/MFAS.h b/gtsam/sfm/MFAS.h
index 3b01122a9..decfbed0f 100644
--- a/gtsam/sfm/MFAS.h
+++ b/gtsam/sfm/MFAS.h
@@ -84,7 +84,7 @@ class MFAS {
    * @brief Computes the 1D MFAS ordering of nodes in the graph
    * @return orderedNodes: vector of nodes in the obtained order
    */
-  std::vector<Key> computeOrdering() const;
+  KeyVector computeOrdering() const;
 
   /**
    * @brief Computes the outlier weights of the graph. We define the outlier