Home
last modified time | relevance | path

Searched refs:dg_graph (Results 1 – 6 of 6) sorted by relevance

/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/include/
H A Dsym_dg.h83 }dg_graph; typedef
108 dg_graph g;
143 int find_node PROTO((int node_id, dg_graph *g));
144 int find_edge PROTO((int edge_id, dg_graph *g));
145 void compress_graph PROTO((dg_graph *g));
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/CNRP/include/
H A Dcnrp_dg.h80 void copy_network_into_graph PROTO((dg_net_network *n, dg_graph *g));
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/VRP/include/
H A Dvrp_dg.h80 void copy_network_into_graph PROTO((dg_net_network *n, dg_graph *g));
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/src/DrawGraph/
H A Ddraw_graph.c155 dg_graph *g; in main()
1208 int find_node(int node_id, dg_graph *g) in find_node()
1231 int find_edge(int edge_id, dg_graph *g) in find_edge()
1254 void compress_graph(dg_graph *g) in compress_graph()
1340 dg_graph *g = &(win->g); in display_graph_on_canvas()
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/VRP/src/DrawGraph/
H A Dvrp_dg_network.c225 void copy_network_into_graph(dg_net_network *n, dg_graph *g) in copy_network_into_graph()
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/CNRP/src/DrawGraph/
H A Dcnrp_dg_network.c224 void copy_network_into_graph(dg_net_network *n, dg_graph *g) in copy_network_into_graph()