| Modifier and Type | Method and Description |
|---|---|
static glp_graph |
GLPK.glp_create_graph(int v_size,
int a_size) |
| Modifier and Type | Method and Description |
|---|---|
protected static long |
glp_graph.getCPtr(glp_graph obj) |
static glp_arc |
GLPK.glp_add_arc(glp_graph G,
int i,
int j)
glp_add_arc - add new arc to graph .
|
static long |
GLPKJNI.glp_add_arc(long jarg1,
glp_graph jarg1_,
int jarg2,
int jarg3) |
static int |
GLPK.glp_add_vertices(glp_graph G,
int nadd)
glp_add_vertices - add new vertices to graph .
|
static int |
GLPKJNI.glp_add_vertices(long jarg1,
glp_graph jarg1_,
int jarg2) |
static int |
GLPK.glp_asnprob_hall(glp_graph G,
int v_set,
int a_x)
glp_asnprob_hall - find bipartite matching of maximum cardinality .
|
static int |
GLPKJNI.glp_asnprob_hall(long jarg1,
glp_graph jarg1_,
int jarg2,
int jarg3) |
static int |
GLPK.glp_asnprob_lp(glp_prob P,
int form,
glp_graph G,
int names,
int v_set,
int a_cost)
glp_asnprob_lp - convert assignment problem to LP .
|
static int |
GLPKJNI.glp_asnprob_lp(long jarg1,
glp_prob jarg1_,
int jarg2,
long jarg3,
glp_graph jarg3_,
int jarg4,
int jarg5,
int jarg6) |
static int |
GLPK.glp_asnprob_okalg(int form,
glp_graph G,
int v_set,
int a_cost,
SWIGTYPE_p_double sol,
int a_x) |
static int |
GLPKJNI.glp_asnprob_okalg(int jarg1,
long jarg2,
glp_graph jarg2_,
int jarg3,
int jarg4,
long jarg5,
int jarg6) |
static int |
GLPK.glp_check_asnprob(glp_graph G,
int v_set)
glp_check_asnprob - check correctness of assignment problem data .
|
static int |
GLPKJNI.glp_check_asnprob(long jarg1,
glp_graph jarg1_,
int jarg2) |
static double |
GLPK.glp_cpp(glp_graph G,
int v_t,
int v_es,
int v_ls) |
static double |
GLPKJNI.glp_cpp(long jarg1,
glp_graph jarg1_,
int jarg2,
int jarg3,
int jarg4) |
static void |
GLPK.glp_create_v_index(glp_graph G) |
static void |
GLPKJNI.glp_create_v_index(long jarg1,
glp_graph jarg1_) |
static void |
GLPK.glp_del_arc(glp_graph G,
glp_arc a)
glp_del_arc - delete arc from graph .
|
static void |
GLPKJNI.glp_del_arc(long jarg1,
glp_graph jarg1_,
long jarg2,
glp_arc jarg2_) |
static void |
GLPK.glp_del_vertices(glp_graph G,
int ndel,
SWIGTYPE_p_int num)
glp_del_vertices - delete vertices from graph .
|
static void |
GLPKJNI.glp_del_vertices(long jarg1,
glp_graph jarg1_,
int jarg2,
long jarg3) |
static void |
GLPK.glp_delete_graph(glp_graph G)
glp_delete_graph - delete graph .
|
static void |
GLPKJNI.glp_delete_graph(long jarg1,
glp_graph jarg1_) |
static void |
GLPK.glp_delete_v_index(glp_graph G) |
static void |
GLPKJNI.glp_delete_v_index(long jarg1,
glp_graph jarg1_) |
static void |
GLPK.glp_erase_graph(glp_graph G,
int v_size,
int a_size) |
static void |
GLPKJNI.glp_erase_graph(long jarg1,
glp_graph jarg1_,
int jarg2,
int jarg3) |
static int |
GLPK.glp_find_vertex(glp_graph G,
String name) |
static int |
GLPKJNI.glp_find_vertex(long jarg1,
glp_graph jarg1_,
String jarg2) |
static int |
GLPK.glp_gridgen(glp_graph G,
int v_rhs,
int a_cap,
int a_cost,
SWIGTYPE_p_int parm) |
static int |
GLPKJNI.glp_gridgen(long jarg1,
glp_graph jarg1_,
int jarg2,
int jarg3,
int jarg4,
long jarg5) |
static glp_java_vertex_data |
GLPK.glp_java_vertex_data_get(glp_graph G,
int i)
Get vertex data.
|
static long |
GLPKJNI.glp_java_vertex_data_get(long jarg1,
glp_graph jarg1_,
int jarg2) |
static glp_vertex |
GLPK.glp_java_vertex_get(glp_graph G,
int i)
Get vertex.
|
static long |
GLPKJNI.glp_java_vertex_get(long jarg1,
glp_graph jarg1_,
int jarg2) |
static int |
GLPK.glp_maxflow_ffalg(glp_graph G,
int s,
int t,
int a_cap,
SWIGTYPE_p_double sol,
int a_x,
int v_cut) |
static int |
GLPKJNI.glp_maxflow_ffalg(long jarg1,
glp_graph jarg1_,
int jarg2,
int jarg3,
int jarg4,
long jarg5,
int jarg6,
int jarg7) |
static void |
GLPK.glp_maxflow_lp(glp_prob P,
glp_graph G,
int names,
int s,
int t,
int a_cap)
glp_maxflow_lp - convert maximum flow problem to LP .
|
static void |
GLPKJNI.glp_maxflow_lp(long jarg1,
glp_prob jarg1_,
long jarg2,
glp_graph jarg2_,
int jarg3,
int jarg4,
int jarg5,
int jarg6) |
static void |
GLPK.glp_mincost_lp(glp_prob P,
glp_graph G,
int names,
int v_rhs,
int a_low,
int a_cap,
int a_cost)
glp_mincost_lp - convert minimum cost flow problem to LP .
|
static void |
GLPKJNI.glp_mincost_lp(long jarg1,
glp_prob jarg1_,
long jarg2,
glp_graph jarg2_,
int jarg3,
int jarg4,
int jarg5,
int jarg6,
int jarg7) |
static int |
GLPK.glp_mincost_okalg(glp_graph G,
int v_rhs,
int a_low,
int a_cap,
int a_cost,
SWIGTYPE_p_double sol,
int a_x,
int v_pi) |
static int |
GLPKJNI.glp_mincost_okalg(long jarg1,
glp_graph jarg1_,
int jarg2,
int jarg3,
int jarg4,
int jarg5,
long jarg6,
int jarg7,
int jarg8) |
static int |
GLPK.glp_mincost_relax4(glp_graph G,
int v_rhs,
int a_low,
int a_cap,
int a_cost,
int crash,
SWIGTYPE_p_double sol,
int a_x,
int a_rc) |
static int |
GLPKJNI.glp_mincost_relax4(long jarg1,
glp_graph jarg1_,
int jarg2,
int jarg3,
int jarg4,
int jarg5,
int jarg6,
long jarg7,
int jarg8,
int jarg9) |
static int |
GLPK.glp_netgen(glp_graph G,
int v_rhs,
int a_cap,
int a_cost,
SWIGTYPE_p_int parm) |
static int |
GLPKJNI.glp_netgen(long jarg1,
glp_graph jarg1_,
int jarg2,
int jarg3,
int jarg4,
long jarg5) |
static int |
GLPK.glp_read_asnprob(glp_graph G,
int v_set,
int a_cost,
String fname)
glp_read_asnprob - read assignment problem data in DIMACS format .
|
static int |
GLPKJNI.glp_read_asnprob(long jarg1,
glp_graph jarg1_,
int jarg2,
int jarg3,
String jarg4) |
static int |
GLPK.glp_read_ccdata(glp_graph G,
int v_wgt,
String fname)
glp_read_ccdata - read graph in DIMACS clique/coloring format .
|
static int |
GLPKJNI.glp_read_ccdata(long jarg1,
glp_graph jarg1_,
int jarg2,
String jarg3) |
static int |
GLPK.glp_read_graph(glp_graph G,
String fname)
glp_read_graph - read graph from plain text file .
|
static int |
GLPKJNI.glp_read_graph(long jarg1,
glp_graph jarg1_,
String jarg2) |
static int |
GLPK.glp_read_maxflow(glp_graph G,
SWIGTYPE_p_int s,
SWIGTYPE_p_int t,
int a_cap,
String fname)
glp_read_maxflow - read maximum flow problem data in DIMACS format .
|
static int |
GLPKJNI.glp_read_maxflow(long jarg1,
glp_graph jarg1_,
long jarg2,
long jarg3,
int jarg4,
String jarg5) |
static int |
GLPK.glp_read_mincost(glp_graph G,
int v_rhs,
int a_low,
int a_cap,
int a_cost,
String fname)
glp_read_mincost - read min-cost flow problem data in DIMACS format .
|
static int |
GLPKJNI.glp_read_mincost(long jarg1,
glp_graph jarg1_,
int jarg2,
int jarg3,
int jarg4,
int jarg5,
String jarg6) |
static int |
GLPK.glp_rmfgen(glp_graph G,
SWIGTYPE_p_int s,
SWIGTYPE_p_int t,
int a_cap,
SWIGTYPE_p_int parm) |
static int |
GLPKJNI.glp_rmfgen(long jarg1,
glp_graph jarg1_,
long jarg2,
long jarg3,
int jarg4,
long jarg5) |
static void |
GLPK.glp_set_graph_name(glp_graph G,
String name)
glp_set_graph_name - assign (change) graph name .
|
static void |
GLPKJNI.glp_set_graph_name(long jarg1,
glp_graph jarg1_,
String jarg2) |
static void |
GLPK.glp_set_vertex_name(glp_graph G,
int i,
String name) |
static void |
GLPKJNI.glp_set_vertex_name(long jarg1,
glp_graph jarg1_,
int jarg2,
String jarg3) |
static int |
GLPK.glp_strong_comp(glp_graph G,
int v_num)
glp_strong_comp - find all strongly connected components of graph .
|
static int |
GLPKJNI.glp_strong_comp(long jarg1,
glp_graph jarg1_,
int jarg2) |
static int |
GLPK.glp_top_sort(glp_graph G,
int v_num) |
static int |
GLPKJNI.glp_top_sort(long jarg1,
glp_graph jarg1_,
int jarg2) |
static int |
GLPK.glp_wclique_exact(glp_graph G,
int v_wgt,
SWIGTYPE_p_double sol,
int v_set) |
static int |
GLPKJNI.glp_wclique_exact(long jarg1,
glp_graph jarg1_,
int jarg2,
long jarg3,
int jarg4) |
static int |
GLPK.glp_weak_comp(glp_graph G,
int v_num)
glp_weak_comp - find all weakly connected components of graph .
|
static int |
GLPKJNI.glp_weak_comp(long jarg1,
glp_graph jarg1_,
int jarg2) |
static int |
GLPK.glp_write_asnprob(glp_graph G,
int v_set,
int a_cost,
String fname)
glp_write_asnprob - write assignment problem data in DIMACS format .
|
static int |
GLPKJNI.glp_write_asnprob(long jarg1,
glp_graph jarg1_,
int jarg2,
int jarg3,
String jarg4) |
static int |
GLPK.glp_write_ccdata(glp_graph G,
int v_wgt,
String fname)
glp_write_ccdata - write graph in DIMACS clique/coloring format .
|
static int |
GLPKJNI.glp_write_ccdata(long jarg1,
glp_graph jarg1_,
int jarg2,
String jarg3) |
static int |
GLPK.glp_write_graph(glp_graph G,
String fname)
glp_write_graph - write graph to plain text file .
|
static int |
GLPKJNI.glp_write_graph(long jarg1,
glp_graph jarg1_,
String jarg2) |
static int |
GLPK.glp_write_maxflow(glp_graph G,
int s,
int t,
int a_cap,
String fname)
glp_write_maxflow - write maximum flow problem data in DIMACS format .
|
static int |
GLPKJNI.glp_write_maxflow(long jarg1,
glp_graph jarg1_,
int jarg2,
int jarg3,
int jarg4,
String jarg5) |
static int |
GLPK.glp_write_mincost(glp_graph G,
int v_rhs,
int a_low,
int a_cap,
int a_cost,
String fname)
glp_write_mincost - write min-cost flow problem data in DIMACS format .
|
static int |
GLPKJNI.glp_write_mincost(long jarg1,
glp_graph jarg1_,
int jarg2,
int jarg3,
int jarg4,
int jarg5,
String jarg6) |
This documentation is part of project GLPK for Java.
| Group-ID | org.gnu.glpk |
| Artifact-ID | glpk-java |
| Version | 1.12.0 |