public static void bell(Graph g, Vertex vs) {
		ArrayList<Vertex> vertexs = g.vertex;
		ArrayList<Edge> edges = g.edges;
		vs.value = 0;
		Edge e;
		Vertex v1, v2;
		for (int i = 0; i < vertexs.size(); i++) {
			for (int j = 0; j < edges.size(); j++) {
				e = edges.get(j);
				v1 = e.from;
				v2 = e.to;
				if (v1.value + e.cost < v2.value) {
					v2.value = v1.value + e.cost;
					v2.prev = v1;
				}
			}
			System.out.println("Number "+i);
			for (int k = 0; k < vertexs.size(); k++) {

				System.out.print(vertexs.get(k).label + " " + vertexs.get(k).value
						);

				System.out.println();

			}
		}
		for (int i = 0; i < vertexs.size(); i++) {
			for (int j = 0; j < edges.size(); j++) {
				e = edges.get(j);
				v1 = e.from;
				v2 = e.to;
				if (v1.value + e.cost < v2.value) {
					System.err.println("error");
				}
			}}
	}