Home
last modified time | relevance | path

Searched defs:bestnode (Results 1 – 20 of 20) sorted by relevance

/dports/math/concorde/concorde/TSP/
H A Dddecker.c1149 int *marks, int marker, int *bestnode, double *bestval) in find_smallest_marked()
1167 int *marks, int marker, int *bestnode, double *bestval) in find_largest_marked()
1274 int i, j, k, bestnode, hits, al, acount; in comb_to_star() local
/dports/games/quake2max/Quake2maX_0.45-src_unix/ref_gl/
H A Dgl_cin.c106 int best, bestnode; in SmallestNode1() local
/dports/cad/gmsh/gmsh-4.9.2-source/contrib/blossom/concorde97/EDGEGEN/
H A Dxnear.c599 int j, bestnode = 0; local
721 int j, bestnode = 0; local
/dports/games/gtkradiant/GPL/Q2Tools/qdata/
H A Dvideo.c444 int best, bestnode; in SmallestNode() local
799 int best, bestnode; in SmallestNode1() local
/dports/games/gtkradiant/GPL/GtkRadiant/tools/quake2/qdata/
H A Dvideo.c444 int best, bestnode; in SmallestNode() local
799 int best, bestnode; in SmallestNode1() local
/dports/games/netradiant/netradiant-20150621-src/tools/quake2/qdata/
H A Dvideo.c435 int best, bestnode; in SmallestNode() local
796 int best, bestnode; in SmallestNode1() local
/dports/games/netradiant/netradiant-20150621-src/tools/quake2/extra/qdata/
H A Dvideo.c444 int best, bestnode; in SmallestNode() local
799 int best, bestnode; in SmallestNode1() local
/dports/games/quake2lnx/quake2-r0.16.2/src/client/
H A Dcl_cin.c215 int best, bestnode; in SmallestNode1() local
/dports/games/quake2-source/quake2-r0.16.2/src/client/
H A Dcl_cin.c215 int best, bestnode; in SmallestNode1() local
/dports/games/q2p/Q2P-0.2-2006-12-31/client/
H A Dcl_cin.c212 int best, bestnode; in SmallestNode1() local
/dports/games/r1q2/r1q2-8012_5/client/
H A Dcl_cin.c216 int best, bestnode; in SmallestNode1() local
/dports/games/qudos/QuDos-0.40.1-src/src/client/
H A Dcl_cin.c188 int best , bestnode; in SmallestNode1() local
/dports/games/quake2max/Quake2maX_0.45-src_unix/client/
H A Dcl_cin.c215 int best, bestnode; in SmallestNode1() local
/dports/games/q2pro/q2pro/source/
H A Dcl_cin.c217 int best, bestnode; in SmallestNode1() local
/dports/math/concorde/concorde/EDGEGEN/
H A Dxnear.c562 int j, bestnode = 0; in CCedgegen_x_node_nearest() local
661 int j, bestnode = 0; in CCedgegen_junk_node_nearest() local
/dports/multimedia/v4l-utils/linux-5.13-rc2/arch/ia64/mm/
H A Ddiscontig.c434 int bestnode = NUMA_NO_NODE, node, anynode = 0; in memory_less_node_alloc() local
/dports/multimedia/v4l_compat/linux-5.13-rc2/arch/ia64/mm/
H A Ddiscontig.c434 int bestnode = NUMA_NO_NODE, node, anynode = 0; in memory_less_node_alloc() local
/dports/multimedia/libv4l/linux-5.13-rc2/arch/ia64/mm/
H A Ddiscontig.c434 int bestnode = NUMA_NO_NODE, node, anynode = 0; in memory_less_node_alloc() local
/dports/math/SCIP/scip-7.0.3/src/scip/
H A Dtree.c7105 SCIP_NODE* bestnode; in SCIPtreeGetPrioChild() local
7131 SCIP_NODE* bestnode; in SCIPtreeGetPrioSibling() local
7159 SCIP_NODE* bestnode; in SCIPtreeGetBestChild() local
7186 SCIP_NODE* bestnode; in SCIPtreeGetBestSibling() local
7226 SCIP_NODE* bestnode; in SCIPtreeGetBestNode() local
H A Dcons_sos1.c7931 int bestnode = -1; in getDiveBdChgsSOS1conflictgraph() local