<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<HTML><HEAD>
<META http-equiv=Content-Type content="text/html; charset=iso-8859-1">
<META content="MSHTML 6.00.2900.2963" name=GENERATOR></HEAD>
<BODY>
<DIV dir=ltr align=left><SPAN class=979214921-03102006><FONT face=Arial
color=#0000ff size=2>Hi Alejandro,</FONT></SPAN></DIV>
<DIV dir=ltr align=left><SPAN class=979214921-03102006><FONT face=Arial
color=#0000ff size=2></FONT></SPAN> </DIV>
<DIV dir=ltr align=left><SPAN class=979214921-03102006><FONT face=Arial
color=#0000ff size=2>Yes. You could implement a shortest path command as a
C# aspx web page. This page could then be called from a web
application similar to the existing buffer.aspx script. MapGuide does not
currently support topology so you would have to create the topology out of the
raw geometry before running the shortest path algorithm.</FONT></SPAN></DIV>
<DIV dir=ltr align=left><SPAN class=979214921-03102006><FONT face=Arial
color=#0000ff size=2></FONT></SPAN> </DIV>
<DIV dir=ltr align=left><SPAN class=979214921-03102006><FONT face=Arial
color=#0000ff size=2>Here is a general outline:</FONT></SPAN></DIV>
<DIV dir=ltr align=left><SPAN class=979214921-03102006><FONT face=Arial
color=#0000ff size=2></FONT></SPAN> </DIV>
<DIV dir=ltr align=left><SPAN class=979214921-03102006><FONT face=Arial
color=#0000ff size=2>Select the features of interest using
FeatureService::SelectFeatures()</FONT></SPAN></DIV>
<DIV dir=ltr align=left><SPAN class=979214921-03102006><FONT face=Arial
color=#0000ff size=2>Iterate through the features recording the end points and
identity properties</FONT></SPAN></DIV>
<DIV dir=ltr align=left><SPAN class=979214921-03102006><FONT face=Arial
color=#0000ff size=2>Using some heuristics, iterate through the end
points to determine which "touch" and create the network
topology. An intersects call with a small circle around each end
point may be appropriate.</FONT></SPAN></DIV>
<DIV dir=ltr align=left><SPAN class=979214921-03102006><FONT face=Arial
color=#0000ff size=2>Using the network topology, determine the shortest
path.</FONT></SPAN></DIV>
<DIV dir=ltr align=left><SPAN class=979214921-03102006><FONT face=Arial
color=#0000ff size=2>Using the identity properties for the shortest
path features, highlight the shortest path using a technique similar to
measure.aspx</FONT></SPAN></DIV>
<DIV dir=ltr align=left><SPAN class=979214921-03102006><FONT face=Arial
color=#0000ff size=2></FONT></SPAN> </DIV>
<DIV dir=ltr align=left><SPAN class=979214921-03102006><FONT face=Arial
color=#0000ff size=2></FONT></SPAN> </DIV>
<DIV dir=ltr align=left><SPAN class=979214921-03102006><FONT face=Arial
color=#0000ff size=2>This algorithm could also be coded in C++. A C++
version would be faster but also more difficult to
implement.</FONT></SPAN></DIV>
<DIV dir=ltr align=left><SPAN class=979214921-03102006><FONT face=Arial
color=#0000ff size=2></FONT></SPAN> </DIV>
<DIV dir=ltr align=left><SPAN class=979214921-03102006><FONT face=Arial
color=#0000ff size=2></FONT></SPAN> </DIV>
<DIV dir=ltr align=left><SPAN class=979214921-03102006><FONT face=Arial
color=#0000ff size=2>Thanks,</FONT></SPAN></DIV>
<DIV dir=ltr align=left><SPAN class=979214921-03102006><FONT face=Arial
color=#0000ff size=2>Trevor</FONT></SPAN></DIV>
<DIV dir=ltr align=left><SPAN class=979214921-03102006></SPAN><SPAN
class=979214921-03102006><FONT face=Arial color=#0000ff
size=2></FONT></SPAN> </DIV><BR>
<DIV class=OutlookMessageHeader lang=en-us dir=ltr align=left>
<HR tabIndex=-1>
<FONT face=Tahoma size=2><B>From:</B> Alejandro Guzman
[mailto:lguzmanc@gmail.com] <BR><B>Sent:</B> Tuesday, October 03, 2006 9:56
AM<BR><B>To:</B> users@mapguide.osgeo.org<BR><B>Subject:</B> Shortest
Path<BR></FONT><BR></DIV>
<DIV></DIV>
<P class=MsoNormal><SPAN lang=EN-US style="COLOR: rgb(153,204,0)">Hello
</SPAN></P>
<P class=MsoNormal><SPAN lang=EN-US style="COLOR: rgb(153,204,0)">Nowadays I am
evaluating some Internet Map Servers to use one of them in a project. Till now,
due to diverse benefits that this one offers, I have decided on MapGuide Open
Source, nevertheless even I do not still have totally cleared some</SPAN><SPAN
lang=EN-US style="COLOR: rgb(255,102,0)"> </SPAN><SPAN lang=EN-US
style="COLOR: rgb(153,204,0)">questions. Specifically my questions are directed
to:</SPAN></P>
<P class=MsoNormal><SPAN lang=EN-US
style="COLOR: rgb(153,204,0)"></SPAN> </P>
<P class=MsoNormal><SPAN lang=EN-US style="COLOR: rgb(153,204,0)">Can I create a
new command to find shortest path?</SPAN></P>
<P class=MsoNormal><SPAN lang=EN-US style="COLOR: rgb(153,204,0)">If it is true,
can I programme it with C#? </SPAN></P>
<P class=MsoNormal><SPAN lang=EN-US style="COLOR: rgb(153,204,0)">Or would I
have to modify to the source code of Mapguide to do this, and therefore use a
specific language of programming?</SPAN></P>
<P class=MsoNormal><SPAN lang=EN-US style="COLOR: rgb(153,204,0)">Do solutions
exist type plug-in to find the shortest path with mapguide?</SPAN></P>
<P class=MsoNormal><SPAN lang=EN-US
style="COLOR: rgb(153,204,0)"></SPAN> </P>
<P class=MsoNormal><SPAN lang=EN-US style="COLOR: rgb(153,204,0)">Thanks
</SPAN></P>
<P class=MsoNormal><SPAN lang=EN-US style="COLOR: rgb(153,204,0)">Alejandro
Guzmán</SPAN></P></BODY></HTML>