Edmonds-Karp Algorithm with both directed and undirected edges?
Replace each undirected edge $(u,v)$ by two directed edges, one in each direction: $u\to v$ and $v\to u$.  That gives you a graph with only directed edges.  Then the max-flow on that graph is the same as the max-flow on your original graph.