gen.lib.pathplan.shortestpth__c Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of plantuml Show documentation
Show all versions of plantuml Show documentation
PlantUML is a component that allows to quickly write :
* sequence diagram,
* use case diagram,
* class diagram,
* activity diagram,
* component diagram,
* state diagram
* object diagram
The newest version!
/* ========================================================================
* PlantUML : a free UML diagram generator
* ========================================================================
*
* Project Info: http://plantuml.com
*
* If you like this project or if you find it useful, you can support us at:
*
* http://plantuml.com/patreon (only 1$ per month!)
* http://plantuml.com/paypal
*
* This file is part of Smetana.
* Smetana is a partial translation of Graphviz/Dot sources from C to Java.
*
* (C) Copyright 2009-2017, Arnaud Roques
*
* This translation is distributed under the same Licence as the original C program:
*
*************************************************************************
* Copyright (c) 2011 AT&T Intellectual Property
* All rights reserved. This program and the accompanying materials
* are made available under the terms of the Eclipse Public License v1.0
* which accompanies this distribution, and is available at
* http://www.eclipse.org/legal/epl-v10.html
*
* Contributors: See CVS logs. Details at http://www.graphviz.org/
*************************************************************************
*
* THE ACCOMPANYING PROGRAM IS PROVIDED UNDER THE TERMS OF THIS ECLIPSE PUBLIC
* LICENSE ("AGREEMENT"). [Eclipse Public License - v 1.0]
*
* ANY USE, REPRODUCTION OR DISTRIBUTION OF THE PROGRAM CONSTITUTES
* RECIPIENT'S ACCEPTANCE OF THIS AGREEMENT.
*
* You may obtain a copy of the License at
*
* http://www.eclipse.org/legal/epl-v10.html
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
*/
package gen.lib.pathplan;
import static smetana.core.Macro.UNSUPPORTED;
public class shortestpth__c {
//1 baedz5i9est5csw3epz3cv7z
// typedef Ppoly_t Ppolyline_t
//1 7pb9zum2n4wlgil34lvh8i0ts
// typedef double COORD
//1 e75el5ykqd72ikokwkl7j2epc
// typedef COORD **array2
//1 4lqn82dcexmb1ujfx7ciwkq7t
// static COORD unseen = (double) INT_MAX
//3 3vmsnhxv064fhv23juvb3901f
// int *shortestPath(int root, int target, int V, array2 wadj)
public static Object shortestPath(Object... arg) {
UNSUPPORTED("ck9i1aidj3wocmwgkt8103ov9"); // int *shortestPath(int root, int target, int V, array2 wadj)
UNSUPPORTED("erg9i1970wdri39osu8hx2a6e"); // {
UNSUPPORTED("7q38vtznktnwi60z79t1yl7kn"); // int *dad;
UNSUPPORTED("3n8lsf3bhkta5dw01y6dosbhw"); // COORD *vl;
UNSUPPORTED("emjv9wq86wxaz1mkis592qedk"); // COORD *val;
UNSUPPORTED("985nf8jew0zg19ydmlmarwyl1"); // int min;
UNSUPPORTED("5tszi7ot461b5xrq7t6i2p9jw"); // int k, t;
UNSUPPORTED("8lhpkwmemj4ejagiby4wce1tp"); // /* allocate arrays */
UNSUPPORTED("70ahd60yay9ycxlgxj1zuyqwk"); // dad = (int *) malloc(V * sizeof(int));
UNSUPPORTED("cwcxxkaw0opazqbubfd67ylkw"); // vl = (COORD *) malloc((V + 1) * sizeof(COORD)); /* One extra for sentinel */
UNSUPPORTED("30bnpu1p596ets2fp9d9fcuuo"); // val = vl + 1;
UNSUPPORTED("6usgmh9di07cghsmczuausuqv"); // /* initialize arrays */
UNSUPPORTED("7s35obmd4mmmswain6cq6kjyz"); // for (k = 0; k < V; k++) {
UNSUPPORTED("9g1fv9lo3mqgozp0hgspk0jfx"); // dad[k] = -1;
UNSUPPORTED("3dfr2o54vzdz7ow35rvkkupwp"); // val[k] = -unseen;
UNSUPPORTED("dvgyxsnyeqqnyzq696k3vskib"); // }
UNSUPPORTED("6vvn9wwyfshecuati4wkh0hb1"); // val[-1] = -(unseen + (COORD) 1); /* Set sentinel */
UNSUPPORTED("ail1ie6r4omx0srfndd7uhkx8"); // min = root;
UNSUPPORTED("8iguu5odqkwyske4dcuz2zh5c"); // /* use (min >= 0) to fill entire tree */
UNSUPPORTED("3b9mo25ltl9ubqm9ptv305emr"); // while (min != target) {
UNSUPPORTED("37uwanwupwkgvkiatkocsnwmi"); // k = min;
UNSUPPORTED("2yk23r7ym8txau8t7w94um5l9"); // val[k] *= -1;
UNSUPPORTED("d8r99m4cpfcmbygzpwrb87waf"); // min = -1;
UNSUPPORTED("99ykmzy96436vip14lubfa2jo"); // if (val[k] == unseen)
UNSUPPORTED("9vb74y52jxvq4iptd1w4dewnu"); // val[k] = 0;
UNSUPPORTED("45pfcyfo86ei9srti6g0iz6xo"); // for (t = 0; t < V; t++) {
UNSUPPORTED("didw0ewjf6uo68oewapzly1rv"); // if (val[t] < 0) {
UNSUPPORTED("ekeykiipkt1z2a3sn2ilt5gx7"); // COORD newpri;
UNSUPPORTED("bczxeah6ns9u23ey094g25kjz"); // COORD wkt;
UNSUPPORTED("cctfdc4m6tunpeulyd30cbdma"); // /* Use lower triangle */
UNSUPPORTED("akz9x35nrpcyklhz1a227a4xh"); // if (k >= t)
UNSUPPORTED("6cx7tblgrev9yzb4ppafglzh7"); // wkt = wadj[k][t];
UNSUPPORTED("7e1uy5mzei37p66t8jp01r3mk"); // else
UNSUPPORTED("bbx44cas4y4rgf8fnytgoavog"); // wkt = wadj[t][k];
UNSUPPORTED("2p64h5oxifdj0iau4zuiebitc"); // newpri = -(val[k] + wkt);
UNSUPPORTED("1skepgmjhmtk882tbnh0ny10o"); // if ((wkt != 0) && (val[t] < newpri)) {
UNSUPPORTED("73wirchpqpajql6a751nimkyu"); // val[t] = newpri;
UNSUPPORTED("4hhrf0py8taqfmqeg3uvrx081"); // dad[t] = k;
UNSUPPORTED("6eq5kf0bj692bokt0bixy1ixh"); // }
UNSUPPORTED("98nv5m3wkh33gdi3z4vns4n4k"); // if (val[t] > val[min])
UNSUPPORTED("cpb83eu6rulsmbhc2rwsi9i5l"); // min = t;
UNSUPPORTED("6t98dcecgbvbvtpycwiq2ynnj"); // }
UNSUPPORTED("flupwh3kosf3fkhkxllllt1"); // }
UNSUPPORTED("dvgyxsnyeqqnyzq696k3vskib"); // }
UNSUPPORTED("yxn5pc6i3jmimfvzmmhfotak"); // free(vl);
UNSUPPORTED("60tomuwdovbmgh94zzb3yeqib"); // return dad;
UNSUPPORTED("c24nfmv9i7o5eoqaymbibp7m7"); // }
throw new UnsupportedOperationException();
}
//3 eb1kiq1ildiyme0qn3xszjyvk
// int *makePath(Ppoint_t p, int pp, COORD * pvis, Ppoint_t q, int qp, COORD * qvis, vconfig_t * conf)
public static Object makePath(Object... arg) {
UNSUPPORTED("2jth0bos9lrgk2xi5083p5rvp"); // int *makePath(Ppoint_t p, int pp, COORD * pvis,
UNSUPPORTED("a6dn81zxyfp9ydvajebmx15wt"); // Ppoint_t q, int qp, COORD * qvis, vconfig_t * conf)
UNSUPPORTED("erg9i1970wdri39osu8hx2a6e"); // {
UNSUPPORTED("9e683sch2jealt2ckz48v9f0j"); // int V = conf->N;
UNSUPPORTED("5ykvw66ec1v4dm5wm0ujsfgt9"); // if (directVis(p, pp, q, qp, conf)) {
UNSUPPORTED("8y9o9xskc3crv3uecpyrsdakg"); // int *dad = (int *) malloc(sizeof(int) * (V + 2));
UNSUPPORTED("7oo70ckt9z1mf09uljyji5zud"); // dad[V] = V + 1;
UNSUPPORTED("3akorfrpmzhjtlnjmmos6z20q"); // dad[V + 1] = -1;
UNSUPPORTED("7x27015v5wfafitei6hpx0rii"); // return dad;
UNSUPPORTED("c07up7zvrnu2vhzy6d7zcu94g"); // } else {
UNSUPPORTED("946fxixcelejjif01eiioqduy"); // array2 wadj = conf->vis;
UNSUPPORTED("5ynkls19r2ylvtzz36h6vjy0t"); // wadj[V] = qvis;
UNSUPPORTED("a8gy96zl4x1lwid18nfp48pbm"); // wadj[V + 1] = pvis;
UNSUPPORTED("1fm1wr69gee2idjkv025ovvwh"); // return (shortestPath(V + 1, V, V + 2, wadj));
UNSUPPORTED("dvgyxsnyeqqnyzq696k3vskib"); // }
UNSUPPORTED("c24nfmv9i7o5eoqaymbibp7m7"); // }
throw new UnsupportedOperationException();
}
}