AONd - All or Nothing traffic assignment algorithm
Displays the non feasible OD pairs, if there are some. Those pairs are ignored in the assignment. Assigns the flow with the All or Nothing algorithm. For each OD-pair it looks for the minimum travel time path and assigns all the demand to this path. The travel time of the links are given by t0 or by the corresponding field in net.
%net=TrafficExample('Nguyen Dupuis'); // we can see the Net ShowNet(); //we add a non feasible OD pair AddDemands(8,1,10); ShowNet() [F,f]=AONd(%net);