Groups > comp.soft-sys.math.maple > #916

3 problems with graph package in MuPAD

X-Received	by 10.236.209.97 with SMTP id r61mr4462935yho.33.1405047974824; Thu, 10 Jul 2014 20:06:14 -0700 (PDT)
X-Received	by 10.182.176.37 with SMTP id cf5mr1641obc.22.1405047974615; Thu, 10 Jul 2014 20:06:14 -0700 (PDT)
Path	csiph.com!v102.xanadu-bbs.net!xanadu-bbs.net!news.glorb.com!r10no812829igi.0!news-out.google.com!gf2ni6igb.0!nntp.google.com!r10no812818igi.0!postnews.google.com!glegroupsg2000goo.googlegroups.com!not-for-mail
Newsgroups	comp.soft-sys.math.maple
Date	Thu, 10 Jul 2014 20:06:14 -0700 (PDT)
Complaints-To	groups-abuse@google.com
Injection-Info	glegroupsg2000goo.googlegroups.com; posting-host=2.191.64.162; posting-account=sVyxEgoAAABmESTWb-pKcXBmVoxFdLxS
NNTP-Posting-Host	2.191.64.162
User-Agent	G2/1.0
MIME-Version	1.0
Message-ID	<d456a779-abe5-4302-a138-3bd475cb2829@googlegroups.com> (permalink)
Subject	3 problems with graph package in MuPAD
From	researcher2014 <m.ershadmanesh@gmail.com>
Injection-Date	Fri, 11 Jul 2014 03:06:14 +0000
Content-Type	text/plain; charset=ISO-8859-1
Xref	csiph.com comp.soft-sys.math.maple:916

Show key headers only | View raw

I am a master student of operations research and must implement a 
heuristic algorithm of solving hazardous material transportation. 
I have uploaded a zipped file contains two documents describe model 
and algorithm. 
link of file: 
http://www.mediafire.com/download/5r35wgya0klanbd/scans.zip 
In order to implement this algorithm to random networks, i did steps below: 
1. generate random graph: 
G := Graph::createRandomGraph(n,m): 
2. assign random risks to edges in [a,,b]: 
G1 := Graph::createRandomEdgeCosts(G, a..b): 
3.solve minimum risk problems from node s to node d: 
G2:=Graph::shortestPathSingleSource(G1, StartVertex = [s], EndVertex = 
[d], SearchFor = Costs) 
-------first issue is that Graph::shortestPathSingleSource(G1, 
StartVertex = [1], SearchFor = Costs) don't get us the shortest path 
and only give value of shortest path value! (G1 is defined as 10th 
line in this text) 
------in step2, we must create a subgraph of G1 that contains specified 
edges (edges belong to shortest paths in step 1),how can i do this? 
but i can't create this sub graph because i only found 
Graph::getSubGraph(G, Vertex) returns a subgraph according to the 
specified vertex but we want that the subgraph contasins specified 
edges (edges belong to shortest paths in step 1) 
other problem is: 
------after solving minimum cost problems in step 2, we must remove edge 
with maximum risk from subgraph, but i don't know how to identify such 
edge (i can't find any functions identify edge with maximum edge 
weight in the graph) 
please help me

Back to comp.soft-sys.math.maple | Previous | Next | Find similar

Thread

3 problems with graph package in MuPAD researcher2014 <m.ershadmanesh@gmail.com> - 2014-07-10 20:06 -0700

csiph-web