线性规划求解程序（Linear programming solver）.docVIP

线性规划求解程序（Linear programming solver） # include stdafx.h # include iostream # include queue # define max _ vertex _ num 20 using namespace std; queue int q; typedef struct ebox { char ivex, jvex; struct ebox * ilink, * jlink; ebox}; typedef struct vexbox { char vertex; ebox * firstedge; vexbox}; / / 顶点表结点 / / 边表结点 typedef struct { vexbox adjmulist [max _ vertex _ num]; int vexnum, edgenum; amlgraph}; int locate (amlgraph g, char (iv) / / 返回顶点的顺序值 { for (int c = 0; c g.vexnum; c + +) if (g.adjmulist [c].vertex = = iv) return c; } void creataml (amlgraph g) { char iv jv; cout 分别输入无向图的顶点数、边数: final; g.vexnum cin g.edgenum; cout 输入各个节点的值: final; for (int a = 0; a g.vexnum; a + +) { cin g.adjmulist [a].vertex; g.adjmulist [a].firstedge = null; } cout 输入存在的连接两边的节点值: final; for (int b = 0; b g.edgenum; b + +) { int i, j; ebox * p; cin iv jv; in = locate (g, iv); j = locate (g, jv); p = (ebox *) malloc (sizeof (ebox)); p - ivex = iv; p - jvex = jv; p - ilink = g.adjmulist [in].firstedge; p - jlink = g.adjmulist [j].firstedge; g.adjmulist [in].firstedge = p; g.adjmulist [j].firstedge = p; } } all visited [max _ vertex _ num]; / / 第一个节点 int firstaml (amlgraph g, int v) { for (int i = 0; i g.vexnum; i + +) if (g.adjmulist [we].vertex = = g.adjmulist [v].firstedge - jvex | | g.adjmulist [we].vertex = = g.adjmulist [v].firstedge - ivex) if (i! = v) we return; } int nextaml (amlgraph g, int v, int w) / / 下一个节点 { ebox * p; p = g.adjmulist [v].firstedge; for (int d; d = 0; + + d) { if (p - ivex = = v) if (p - jvex = = w) {p = p - ilink; break;} if (p - ivex = = w) if (w p - jvex = = v) {p = p - jlink; break;} } if (p - ivex = = v) { for (int e = 0; e g.edgenum; e + +) if (g.adjmulist [e].vertex = = p - jvex) return e; } if (p - jvex = = v) { for (int r = 0; f g.edgenum; f + +) if (g.adjmulist [f].vertex = = p - ivex) return f; } } void dfs (amlgraph g, int v) { visited [v] = true; cout g.adjmulist [v].vertex; for (int w = firstam