« View all new features in Mathematica 9  previous  |  next 
New in Mathematica 9Enhanced Graphs and Networks

Transportation Problems 

A railroad network serving six major Canadian cities, with the daily number of car compartments.
In[4]:=
Click for copyable input
X
In[1]:=
Click for copyable input
X

Find the maximum number of compartments that can be carried from Vancouver to Winnipeg.

In[2]:=
Click for copyable input
X
In[3]:=
Click for copyable input
X
Out[3]=

Number of compartments between cities.

Out[4]=

Show the flows of compartments.

In[5]:=
Click for copyable input
X
Out[5]=