hdu_2544

/*
 * 典型最短路问题，邻接矩阵+spfa
 * 注意重边的情况
*/
#include <cstdio>
#include <cstring>
#include <queue>
#include <algorithm>
#define MAXN	101
#define MAXM	10001
#define INF		0x7fffffff
using namespace std;

int dis[MAXN], used[MAXN], val[MAXN][MAXN];

int spfa(int src, int des, int vertex)
{
	int u, v;
	queue<int> q;
	fill(dis, dis+vertex+1, INF);
	memset(used, 0, sizeof(used));
	dis[src] = 0;	used[src] = 1;
	q.push(src);
	while( !q.empty() ) {
		u = q.front(); q.pop();
		for(int v = 0; v <= vertex; v ++) {
			if( val[u][v] && dis[v] > dis[u]+val[u][v] ) {
				dis[v] = dis[u]+val[u][v];
				if( !used[v] ) {
					q.push(v);	used[v] = 1;
				}
			}
		}
		used[u] = 0;
	}
	return	dis[des];
}

int main(int argc, char const *argv[])
{
	//freopen("test.in", "r", stdin);
	int vertex, arc, u, v, w;
	while( scanf("%d %d", &vertex, &arc) ) {
		if( !vertex && !arc ) {
			break;
		}
		memset(val, 0, sizeof(val));
		for(int i = 0; i < arc; i ++) {
			scanf("%d %d %d", &u, &v, &w);
			if( !val[u][v] ) {
				val[u][v] = val[v][u] = w;
			}
			else if( val[u][v] > w ) {
				val[u][v] = val[v][u] = w;
			}
		}
		printf("%d\n", spfa(1, vertex, vertex));
	}
	return 0;
}


/*
 * 典型最短路问题，邻接表+spfa
 * 注意重边的情况
*/
#include <cstdio>
#include <cstring>
#include <queue>
#include <algorithm>
#define MAXN	101
#define MAXM	10000
#define INF		0x7fffffff
using namespace std;

struct Edge {
	int v, val, next;
}edge[MAXM];

int e_cnt, head[MAXN], dis[MAXN], used[MAXN];

void insert_arc(int u, int v, int w)
{
	edge[e_cnt].v = v;	edge[e_cnt].val = w;
	edge[e_cnt].next = head[u];	head[u] = e_cnt ++;
}

int spfa(int src, int des, int vertex)
{
	int u, v;
	queue<int> q;
	fill(dis, dis+vertex+1, INF);
	memset(used, 0, sizeof(used));
	dis[src] = 0;	q.push(src);
	used[src] = 1;
	while( !q.empty() ) {
		u = q.front(); q.pop();
		for(int i = head[u]; -1 != i; i = edge[i].next) {
			v = edge[i].v;
			if( dis[v] > dis[u]+edge[i].val ) {
				dis[v] = dis[u]+edge[i].val;
				if( !used[v] ) {
					q.push(v);	used[v] = 1;
				}
			}
		}
		used[u] = 0;
	}
	return dis[des];
}

int main(int argc, char const *argv[])
{
	//freopen("test.in", "r", stdin);
	int vertex, arc, u, v, w;
	while( scanf("%d %d", &vertex, &arc) ) {
		if( !vertex && !arc ) {
			break;
		}
		e_cnt = 0;	memset(head, -1, sizeof(head));
		for(int i = 0; i < arc; i ++) {
			scanf("%d %d %d", &u, &v, &w);
			insert_arc(u, v, w);
			insert_arc(v, u, w);
		}
		printf("%d\n", spfa(1, vertex, vertex));
	}
	return 0;
}