diff --git a/docs/src/experimental_methods.md b/docs/src/experimental_methods.md
index 08045a23..d3b027de 100644
--- a/docs/src/experimental_methods.md
+++ b/docs/src/experimental_methods.md
@@ -29,12 +29,6 @@ Methods which still need to be discussed, modified, or deprecated.
   TreeTensorNetwork(os::OpSum, sites::IndsNetwork; kws...)
   ```
 
-* From `OpSum`, assuming path graph (`opsum_to_ttn.jl`):
-  ```julia
-  mpo(os::OpSum, external_inds::Vector; kws...)
-  mpo(os::OpSum, s::IndsNetwork; kws...)
-  ```
-
 #### AbstractTreeTensorNetwork Type
 
 * Required-to-implement abstract interface — `TreeTensorNetwork` provides both (`treetensornetworks/abstracttreetensornetwork.jl`):
@@ -243,13 +237,6 @@ Methods which still need to be discussed, modified, or deprecated.
   IndsNetwork{V, I}(g::AbstractSimpleGraph, link_space::Dictionary, site_space::Dictionary)
   ```
 
-* Build an `IndsNetwork` on a path graph from a vector of external (site) indices
-  per vertex, or one index per vertex (`indsnetwork.jl`):
-  ```julia
-  path_indsnetwork(external_inds::Vector{<:Vector{<:Index}})
-  path_indsnetwork(external_inds::Vector{<:Index})
-  ```
-
 * Normalize a user-supplied link-space spec into a `Dictionary{edgetype, Vector{I}}`,
   building fresh edge-tagged `Index` objects from raw integer dimensions when needed.
   Accepts an integer, a `Vector{Int}`, a `Dictionary` of integers / vectors of integers /
diff --git a/src/indsnetwork.jl b/src/indsnetwork.jl
index 92d1e981..d65a6b14 100644
--- a/src/indsnetwork.jl
+++ b/src/indsnetwork.jl
@@ -127,21 +127,6 @@ function IndsNetwork{V, I}(
     return IndsNetwork{V, I}(NamedGraph(g), link_space, site_space)
 end
 
-# Construct from collections of indices
-
-function path_indsnetwork(external_inds::Vector{<:Vector{<:Index}})
-    g = named_path_graph(length(external_inds))
-    is = IndsNetwork(g)
-    for v in eachindex(external_inds)
-        is[v] = external_inds[v]
-    end
-    return is
-end
-
-function path_indsnetwork(external_inds::Vector{<:Index})
-    return path_indsnetwork(map(i -> [i], external_inds))
-end
-
 @traitfn function default_link_space(V::Type, g::::IsUnderlyingGraph)
     # TODO: Convert `g` to vertex type `V`
     E = edgetype(g)
diff --git a/src/treetensornetworks/opsum_to_ttn/opsum_to_ttn.jl b/src/treetensornetworks/opsum_to_ttn/opsum_to_ttn.jl
index 8861d189..2fca80e0 100644
--- a/src/treetensornetworks/opsum_to_ttn/opsum_to_ttn.jl
+++ b/src/treetensornetworks/opsum_to_ttn/opsum_to_ttn.jl
@@ -659,14 +659,6 @@ function TreeTensorNetwork(
     return ttn_svd(os, sites, root_vertex; kwargs...)
 end
 
-function mpo(os::OpSum, external_inds::Vector; kwargs...)
-    return TreeTensorNetwork(os, path_indsnetwork(external_inds); kwargs...)
-end
-function mpo(os::OpSum, s::IndsNetwork; kwargs...)
-    # TODO: Check it is a path graph.
-    return TreeTensorNetwork(os, s; kwargs...)
-end
-
 # Catch-all for leaf eltype specification
 function TreeTensorNetwork(eltype::Type{<:Number}, os, sites::IndsNetwork; kwargs...)
     return NDTensors.convert_scalartype(eltype, TreeTensorNetwork(os, sites; kwargs...))