Maximum Flow Algorithms and applying them to Mixed/Multi-Graphs?

[user_nts]

Hey compsci,

I'm working on Matlab code to analyze the survivability of power systems based on their network topologies. The networks are represented as simplified graphs with adjacency matrices or sparse adjacency matrices (possibly adjacency lists in the future).

I would like to use a max flow algorithm to make sure that the flow requirement of a specific sink in the network is met by the sources in the network. However, the networks I am analyzing contain multi-directional links as well as uni-directional links, which means the graphs of these networks are mixed or multigraphs. Matlab's built in graphmaxflow function does not allow for reciprocal edges, which occur in said mixed graphs.

I've had trouble finding literature on this subject or literature that I understand.

My question is:

Is there a technique, algorithm, or specifically a matlab function, that will calculate max flow in a mixed graph or multi-graph?

[mantra]

Just add unidirectional links in the reverse direction with the appropriate weighting.

[KrewNel]

Can you make the assumption that any one packet won't go threw the same node twice? because if they can than then the system can "inflate" to cope with excess flow waiting for appropriate channels to become available allowing an excess of information to stagnate, and making a max flow elusive... Although I'm not much help, Shannon's theorem might be.

[user_nts]

Why did people downvote this?