Edge-based partitioning with vertex separators of oriented graphs

I am searching for an algorithm that can create balanced edge-based partitions with vertex separators of oriented graphs. My understanding is that the METIS_PartGraphKway function performs a vertex-based partition with edge separators. Instead, I am looking for a function that does edge-based partitions with vertex separators. Does anyone know of such an algorithm available in some Julia package?

Perhaps it is possible to code something with Metis.separator, but is it necessary?