Coerce a GFA into a fasta, finding the longest path through the graph.
Force a linear representation of the GFA.
Reusable function to call on subgraphs in a GFA if necessary.
