Question: paths in graph

July 11 2014 alpha041 30
Maple 14


Hi i have two questions about paths in graph package: 1. suppose we have: path1=[1,3,5,7,9] path2=[1,2,3,6,7,8,9] if we want to create a graph that it's edges are edges of path1 and edges of path2,how can we do this? edge set of our graph should be {[1,3],[3,5],[5,7],[7,9],[1,2],[2,3],[3,6],[6,7],[7,8],[8,9]} 2. suppose p is an arbitrary path on a given weighted graph G how can i calculate weight of p (that is sum of it's edges weights) in maple ? thanks very much for your help
Please Wait...