c#.net下对获短路径

 public static string ToShortPathName(string longName)
  {
   StringBuilder shortNameBuffer = new StringBuilder(256);
   int bufferSize = shortNameBuffer.Capacity;

   int result = GetShortPathName(longName, shortNameBuffer, bufferSize);

   return shortNameBuffer.ToString();
  }
  [DllImport("kernel32.dll", CharSet = CharSet.Auto)]
  public static extern int GetShortPathName([MarshalAs(UnmanagedType.LPTStr)] string path,[MarshalAs(UnmanagedType.LPTStr)] StringBuilder shortPath,int shortPathLength);

************************************

[DllImport("kernel32.dll")]
        static extern uint GetLongPathName(string shortname, StringBuilder   longnamebuff, uint buffersize);

public static string ToLongPathName(string shortName)
        {
            StringBuilder longNameBuffer = new StringBuilder(256);
            uint bufferSize = (uint)longNameBuffer.Capacity;

            GetLongPathName(shortName, longNameBuffer, bufferSize);

            return longNameBuffer.ToString();
        }

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
C# .NET中有多种实现最短路径算法的方法,其中比较常用的是Dijkstra算法和Floyd Warshall算法。下面分别介绍这两种算法的实现方法: 1. Dijkstra算法 Dijkstra算法是一种贪心算法,用于解决带权图的单源最短路径问题。该算法的基本思想是从起点开始,每次选择当前距离起点最近的一个顶点,然后以该顶点为中心进行扩展,直到扩展到终点为止。具体实现方法如下: ```csharp public static int[] Dijkstra(int[,] graph, int source) { int n = graph.GetLength(0); int[] dist = new int[n]; bool[] visited = new bool[n]; for (int i = 0; i < n; i++) { dist[i] = int.MaxValue; visited[i] = false; } dist[source] = 0; for (int count = 0; count < n - 1; count++) { int u = MinDistance(dist, visited); visited[u] = true; for (int v = 0; v < n; v++) { if (!visited[v] && graph[u, v] != 0 && dist[u] != int.MaxValue && dist[u] + graph[u, v] < dist[v]) { dist[v] = dist[u] + graph[u, v]; } } } return dist; } private static int MinDistance(int[] dist, bool[] visited) { int min = int.MaxValue; int minIndex = -1; for (int v = 0; v < dist.Length; v++) { if (!visited[v] && dist[v] <= min) { min = dist[v]; minIndex = v; } } return minIndex; } ``` 2. Floyd Warshall算法 Floyd Warshall算法是一种动态规划算法,用于解决带权图的所有点对最短路径问题。该算法的基本思想是利用中间顶点的集合逐步扩大,从而求出所有顶点之间的最短路径。具体实现方法如下: ```csharp public static int[,] FloydWarshall(int[,] graph) { int n = graph.GetLength(0); int[,] dist = new int[n, n]; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { dist[i, j] = graph[i, j]; } } for (int k = 0; k < n; k++) { for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (dist[i, k] != int.MaxValue && dist[k, j] != int.MaxValue && dist[i, k] + dist[k, j] < dist[i, j]) { dist[i, j] = dist[i, k] + dist[k, j]; } } } } return dist; } ```
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值