欢迎用过Mo网络分析模块的同志发表意见！放出例子让大家分享！

欢迎用过Mo网络分析模块的同志发表意见！放出例子让大家分享！

<img src="images/post/smile/dvbbs/em01.gif" /><img src="images/post/smile/dvbbs/em01.gif" /><img src="images/post/smile/dvbbs/em01.gif" />

<P>短短的</P>

无聊

<img src="images/post/smile/dvbbs/em10.gif" /><img src="images/post/smile/dvbbs/em10.gif" /><img src="images/post/smile/dvbbs/em10.gif" /><img src="images/post/smile/dvbbs/em01.gif" /><img src="images/post/smile/dvbbs/em01.gif" /><img src="images/post/smile/dvbbs/em01.gif" />

<P>两种最短路径的算法VC++程序</P>
<P>double CMoPathFindView::Dijkstra(int iSNode, int iTNode, int Path[])
{
//Graph&Aacute;&Uacute;&frac12;&Oacute;&frac34;&Oslash;&Otilde;ó&pound;&not;&cedil;&iexcl;&micro;&atilde;&ETH;&Iacute;
    int i, j, w, mark[MAX_VERTEX];
double minc, dbDist[MAX_VERTEX];</P>
<P>//±ê&Ecirc;&para;&Euml;ù&Oacute;&ETH;&frac12;á&micro;&atilde;&frac34;ù&Icirc;&acute;&Agrave;ú±é
    for (i=0;i<m_Graph.nodeNum;i++)
  mark=0;</P>
<P>//
for (i=0;i<m_Graph.nodeNum;i++)
    {
  dbDist = m_Graph.arcLength[iSNode];
        Path = iSNode;
}
//±ê&Ecirc;&para;&AElig;&eth;&micro;&atilde;&micro;&Auml;&Iuml;à&sup1;&Oslash;&sup2;&Icirc;&Ecirc;&yacute;
    mark[iSNode] =1;
Path[iSNode] =0;
dbDist[iSNode] =0.0;</P>
<P>double dbInfinity=INFINITY;</P>
<P>    for (i=1;i<m_Graph.nodeNum;i++)
{
  minc=INFINITY;
  w=0;
  //&Ograve;&Ocirc;Vi&Icirc;&ordf;&AElig;&eth;&micro;&atilde;&pound;&not;&Euml;&Ntilde;&Euml;÷&frac34;à&Agrave;&euml;Vi&micro;&Auml;×&icirc;&ETH;&iexcl;&micro;&Auml;&para;&yen;&micro;&atilde;
  for (j=0;j<m_Graph.nodeNum;j++)
   if ((mark[j]==0) ;; (minc>=dbDist[j]))
   {
    minc=dbDist[j]; //&frac14;&Ccedil;&Acirc;&frac14;×&icirc;&ETH;&iexcl;&frac34;à&Agrave;&euml;
    w=j;   //&frac14;&Ccedil;&Acirc;&frac14;&frac34;à&Agrave;&euml;×&icirc;&ETH;&iexcl;&para;&yen;&micro;&atilde;
   }</P>
<P>  mark[w]=1;
  for (j=0;j<m_Graph.nodeNum;j++)
   if ((mark[j]==0) ;; (dbDist[j] > (dbDist[w]+m_Graph.arcLength[w][j])) ;; (m_Graph.arcLength[w][j] != dbInfinity))
   {
    dbDist[j]=dbDist[w]+m_Graph.arcLength[w][j];
    Path[j]=w;
   }
}
    return dbDist[iTNode];
}
</P>
<P>double CMoPathFindView::BellmanFord(int iSNode, int iTNode, int Path[])
{
//Graph&Aacute;&Uacute;&frac12;&Oacute;&frac34;&Oslash;&Otilde;ó&pound;&not;&cedil;&iexcl;&micro;&atilde;&ETH;&Iacute;
    int i, j, k;
double dbDist[MAX_VERTEX];
double dbInfinity=INFINITY;</P>
<P>//±ê&Ecirc;&para;&Euml;ù&Oacute;&ETH;&frac12;á&micro;&atilde;&frac34;ù&Icirc;&acute;&Agrave;ú±é
for (i=0;i<m_Graph.nodeNum;i++)
    {
  dbDist = dbInfinity;
        Path = 0;
}
//±ê&Ecirc;&para;&AElig;&eth;&micro;&atilde;&micro;&Auml;&Iuml;à&sup1;&Oslash;&sup2;&Icirc;&Ecirc;&yacute;
dbDist[iSNode] =0.0;</P>
<P>    for (k=1;k<m_Graph.nodeNum;k++)
  for (i=0;i<m_Graph.nodeNum;i++)
   for (j=0;j<m_Graph.nodeNum;j++)
   if (dbDist[j]>dbDist+m_Graph.arcLength[j])
   {
    dbDist[j]=dbDist+m_Graph.arcLength[j];
    Path[j]=i;
   }</P>
<P>for (i=0;i<m_Graph.nodeNum;i++)
  for (j=0;j<m_Graph.nodeNum;j++)
  if (dbDist[j]>dbDist+m_Graph.arcLength[j]) return 0;</P>
<P>  
return dbDist[iTNode];
}</P>
<P>请指正！</P>

[此贴子已经被作者于2004-9-30 8:45:53编辑过]

<P>我是用数组来定义图的邻接矩阵，感觉比较笨，一直想用其它更好的方式解决，但一直没有时间
</P>
<P>//&para;¨&Ograve;&aring;&Iacute;&frac14;&micro;&Auml;&Aacute;&Uacute;&frac12;&Oacute;&frac34;&Oslash;&Otilde;ó&Agrave;à&ETH;&Iacute;
//
typedef struct Graph
{
int    nodeID[MAX_VERTEX];     //用数组来保存结点
CMoPoint moNode[MAX_VERTEX];    //&acute;&aelig;&acute;&cent;&para;&yen;&micro;&atilde;&micro;&Auml;Shape
double arcLength[MAX_VERTEX][MAX_VERTEX];   //&acute;&aelig;&acute;&cent;&raquo;&iexcl;&para;&Icirc;&sup3;¤&para;&Egrave;
int    nodeNum;        //&acute;&aelig;&acute;&cent;&para;&yen;&micro;&atilde;×&Uuml;&Ecirc;&yacute;
int    arcsNum;        //&acute;&aelig;&acute;&cent;&raquo;&iexcl;&para;&Icirc;×&Uuml;&Ecirc;&yacute;
} GraphTp;
</P>
<P>GraphTp m_Graph;</P>