Wolfram Language & System 10.0 (2014)|Legacy Documentation

This is documentation for an earlier version of the Wolfram Language.View current documentation (Version 11.2)

Transportation Problems

A railroad network serving six major Canadian cities, with the daily number of car compartments.

    
In[1]:=
Click for copyable input
Find the maximum number of compartments that can be carried from Vancouver to Winnipeg:
In[2]:=
Click for copyable input
In[3]:=
Click for copyable input
Out[3]=
Number of compartments between cities:
In[4]:=
Click for copyable input
Out[4]=
Show the flows of compartments:
In[5]:=
Click for copyable input
Out[5]=