summaryrefslogtreecommitdiffstats
path: root/scilab/modules/metanet
diff options
context:
space:
mode:
authorAllan CORNET <allan.cornet@scilab.org>2009-10-21 09:01:22 +0200
committerAllan CORNET <allan.cornet@scilab.org>2009-10-21 09:01:22 +0200
commit3dc381da5d4cb8804837a271c52fccbf03100493 (patch)
treed0a26657972f39d345718cdd1e9f22394304fba0 /scilab/modules/metanet
parentd1704bc252d167daad12568d677044e863f99568 (diff)
downloadscilab-3dc381da5d4cb8804837a271c52fccbf03100493.zip
scilab-3dc381da5d4cb8804837a271c52fccbf03100493.tar.gz
moved in Atoms
Diffstat (limited to 'scilab/modules/metanet')
-rw-r--r--scilab/modules/metanet/help/en_US/netwindow.xml64
-rw-r--r--scilab/modules/metanet/help/en_US/netwindows.xml61
-rw-r--r--scilab/modules/metanet/help/en_US/ngraphic_data_structure.xml115
-rw-r--r--scilab/modules/metanet/help/en_US/node_number.xml57
-rw-r--r--scilab/modules/metanet/help/en_US/nodedatafields.xml82
-rw-r--r--scilab/modules/metanet/help/en_US/nodes_2_path.xml80
-rw-r--r--scilab/modules/metanet/help/en_US/nodes_data_structure.xml85
-rw-r--r--scilab/modules/metanet/help/en_US/nodes_degrees.xml81
-rw-r--r--scilab/modules/metanet/help/en_US/path_2_nodes.xml78
-rw-r--r--scilab/modules/metanet/help/en_US/perfect_match.xml97
-rw-r--r--scilab/modules/metanet/help/en_US/pipe_network.xml99
-rw-r--r--scilab/modules/metanet/help/en_US/plot_graph.xml125
-rw-r--r--scilab/modules/metanet/help/en_US/predecessors.xml79
-rw-r--r--scilab/modules/metanet/help/en_US/qassign.xml91
-rw-r--r--scilab/modules/metanet/help/en_US/salesman.xml83
-rw-r--r--scilab/modules/metanet/help/en_US/save_graph.xml86
-rw-r--r--scilab/modules/metanet/help/en_US/set_nodes_id.xml100
-rw-r--r--scilab/modules/metanet/help/en_US/shortest_path.xml112
-rw-r--r--scilab/modules/metanet/help/en_US/show_arcs.xml85
-rw-r--r--scilab/modules/metanet/help/en_US/show_edges.xml105
-rw-r--r--scilab/modules/metanet/help/en_US/show_graph.xml107
-rw-r--r--scilab/modules/metanet/help/en_US/show_nodes.xml99
-rw-r--r--scilab/modules/metanet/help/en_US/split_edge.xml104
-rw-r--r--scilab/modules/metanet/help/en_US/strong_con_nodes.xml82
-rw-r--r--scilab/modules/metanet/help/en_US/strong_connex.xml91
-rw-r--r--scilab/modules/metanet/help/en_US/successors.xml78
-rw-r--r--scilab/modules/metanet/help/en_US/trans_closure.xml76
-rw-r--r--scilab/modules/metanet/help/en_US/update_graph.xml60
-rw-r--r--scilab/modules/metanet/help/fr_FR/add_node.xml104
-rw-r--r--scilab/modules/metanet/help/fr_FR/addchapter.sce11
-rw-r--r--scilab/modules/metanet/help/fr_FR/adj_lists.xml144
-rw-r--r--scilab/modules/metanet/help/fr_FR/articul.xml76
-rw-r--r--scilab/modules/metanet/help/fr_FR/best_match.xml122
-rw-r--r--scilab/modules/metanet/help/fr_FR/chain_struct.xml141
-rw-r--r--scilab/modules/metanet/help/fr_FR/check_graph.xml59
-rw-r--r--scilab/modules/metanet/help/fr_FR/circuit.xml87
-rw-r--r--scilab/modules/metanet/help/fr_FR/connex.xml94
-rw-r--r--scilab/modules/metanet/help/fr_FR/contract_edge.xml98
-rw-r--r--scilab/modules/metanet/help/fr_FR/gen_net.xml139
-rw-r--r--scilab/modules/metanet/help/fr_FR/glist.xml56
-rw-r--r--scilab/modules/metanet/help/fr_FR/graph_center.xml88
-rw-r--r--scilab/modules/metanet/help/fr_FR/graph_diameter.xml81
-rw-r--r--scilab/modules/metanet/help/fr_FR/graph_power.xml77
-rw-r--r--scilab/modules/metanet/help/fr_FR/graph_simp.xml65
-rw-r--r--scilab/modules/metanet/help/fr_FR/graph_sum.xml104
-rw-r--r--scilab/modules/metanet/help/fr_FR/graph_union.xml98
-rw-r--r--scilab/modules/metanet/help/fr_FR/is_connex.xml74
-rw-r--r--scilab/modules/metanet/help/fr_FR/line_graph.xml83
-rw-r--r--scilab/modules/metanet/help/fr_FR/make_graph.xml120
-rw-r--r--scilab/modules/metanet/help/fr_FR/max_cap_path.xml102
-rw-r--r--scilab/modules/metanet/help/fr_FR/max_flow.xml124
-rw-r--r--scilab/modules/metanet/help/fr_FR/min_lcost_cflow.xml172
-rw-r--r--scilab/modules/metanet/help/fr_FR/min_lcost_flow1.xml136
-rw-r--r--scilab/modules/metanet/help/fr_FR/min_lcost_flow2.xml146
-rw-r--r--scilab/modules/metanet/help/fr_FR/min_qcost_flow.xml149
-rw-r--r--scilab/modules/metanet/help/fr_FR/min_weight_tree.xml118
-rw-r--r--scilab/modules/metanet/help/fr_FR/neighbors.xml81
-rw-r--r--scilab/modules/metanet/help/fr_FR/path_2_nodes.xml82
-rw-r--r--scilab/modules/metanet/help/fr_FR/perfect_match.xml98
-rw-r--r--scilab/modules/metanet/help/fr_FR/pipe_network.xml105
-rw-r--r--scilab/modules/metanet/help/fr_FR/predecessors.xml82
-rw-r--r--scilab/modules/metanet/help/fr_FR/salesman.xml80
-rw-r--r--scilab/modules/metanet/help/fr_FR/strong_con_nodes.xml87
-rw-r--r--scilab/modules/metanet/help/fr_FR/strong_connex.xml93
-rw-r--r--scilab/modules/metanet/help/fr_FR/successors.xml81
-rw-r--r--scilab/modules/metanet/help/fr_FR/trans_closure.xml74
-rw-r--r--scilab/modules/metanet/includes/dynlib_metanet.h28
-rw-r--r--scilab/modules/metanet/license.txt10
-rw-r--r--scilab/modules/metanet/locales/de_DE/metanet.po107
-rw-r--r--scilab/modules/metanet/locales/fr_FR/metanet.po115
-rw-r--r--scilab/modules/metanet/locales/ru_RU/metanet.po110
-rw-r--r--scilab/modules/metanet/macros/buildmacros.bat11
-rw-r--r--scilab/modules/metanet/macros/buildmacros.sce33
-rw-r--r--scilab/modules/metanet/macros/cleanmacros.bat16
-rw-r--r--scilab/modules/metanet/macros/editor/buildmacros.bat11
-rw-r--r--scilab/modules/metanet/macros/editor/buildmacros.sce15
-rw-r--r--scilab/modules/metanet/macros/editor/cleanmacros.bat13
-rw-r--r--scilab/modules/metanet/macros/editor/ge_add_history.sci13
-rw-r--r--scilab/modules/metanet/macros/editor/ge_arc_coordinates.sci72
-rw-r--r--scilab/modules/metanet/macros/editor/ge_arc_fields.sci27
-rw-r--r--scilab/modules/metanet/macros/editor/ge_check_before_quit.sci44
-rw-r--r--scilab/modules/metanet/macros/editor/ge_check_names.sci25
-rw-r--r--scilab/modules/metanet/macros/editor/ge_clear_history.sci13
-rw-r--r--scilab/modules/metanet/macros/editor/ge_complete_defaults.sci99
-rw-r--r--scilab/modules/metanet/macros/editor/ge_compute.sci15
-rw-r--r--scilab/modules/metanet/macros/editor/ge_copy_region_to_cb.sci19
-rw-r--r--scilab/modules/metanet/macros/editor/ge_create_menus.sci29
-rw-r--r--scilab/modules/metanet/macros/editor/ge_default_edge_profile.sci21
-rw-r--r--scilab/modules/metanet/macros/editor/ge_delete_arc.sci15
-rw-r--r--scilab/modules/metanet/macros/editor/ge_delete_node.sci25
-rw-r--r--scilab/modules/metanet/macros/editor/ge_dig_bound.sci41
-rw-r--r--scilab/modules/metanet/macros/editor/ge_disablemenus.sci24
-rw-r--r--scilab/modules/metanet/macros/editor/ge_dist2edge.sci18
-rw-r--r--scilab/modules/metanet/macros/editor/ge_dist2polyline.sci45
-rw-r--r--scilab/modules/metanet/macros/editor/ge_do_SaveAs.sci39
-rw-r--r--scilab/modules/metanet/macros/editor/ge_do_add_edge_data.sci57
-rw-r--r--scilab/modules/metanet/macros/editor/ge_do_add_node_data.sci56
-rw-r--r--scilab/modules/metanet/macros/editor/ge_do_circuit.sci15
-rw-r--r--scilab/modules/metanet/macros/editor/ge_do_default_names.sci41
-rw-r--r--scilab/modules/metanet/macros/editor/ge_do_delete.sci102
-rw-r--r--scilab/modules/metanet/macros/editor/ge_do_delete_region.sci81
-rw-r--r--scilab/modules/metanet/macros/editor/ge_do_export.sci65
-rw-r--r--scilab/modules/metanet/macros/editor/ge_do_find.sci86
-rw-r--r--scilab/modules/metanet/macros/editor/ge_do_information.sci245
-rw-r--r--scilab/modules/metanet/macros/editor/ge_do_load.sci31
-rw-r--r--scilab/modules/metanet/macros/editor/ge_do_move.sci77
-rw-r--r--scilab/modules/metanet/macros/editor/ge_do_move_region.sci90
-rw-r--r--scilab/modules/metanet/macros/editor/ge_do_new.sci23
-rw-r--r--scilab/modules/metanet/macros/editor/ge_do_options.sci29
-rw-r--r--scilab/modules/metanet/macros/editor/ge_do_paste.sci53
-rw-r--r--scilab/modules/metanet/macros/editor/ge_do_properties.sci164
-rw-r--r--scilab/modules/metanet/macros/editor/ge_do_quit.sci25
-rw-r--r--scilab/modules/metanet/macros/editor/ge_do_replot.sci23
-rw-r--r--scilab/modules/metanet/macros/editor/ge_do_salesman.sci25
-rw-r--r--scilab/modules/metanet/macros/editor/ge_do_save.sci15
-rw-r--r--scilab/modules/metanet/macros/editor/ge_do_select.sci33
-rw-r--r--scilab/modules/metanet/macros/editor/ge_do_settings.sci234
-rw-r--r--scilab/modules/metanet/macros/editor/ge_do_shortestpath.sci54
-rw-r--r--scilab/modules/metanet/macros/editor/ge_do_undo.sci214
-rw-r--r--scilab/modules/metanet/macros/editor/ge_do_version.sci20
-rw-r--r--scilab/modules/metanet/macros/editor/ge_do_zoom.sci30
-rw-r--r--scilab/modules/metanet/macros/editor/ge_draw_edge.sci84
-rw-r--r--scilab/modules/metanet/macros/editor/ge_draw_graph.sci41
-rw-r--r--scilab/modules/metanet/macros/editor/ge_draw_loop_arcs.sci67
-rw-r--r--scilab/modules/metanet/macros/editor/ge_draw_node.sci162
-rw-r--r--scilab/modules/metanet/macros/editor/ge_draw_std_arcs.sci52
-rw-r--r--scilab/modules/metanet/macros/editor/ge_drawarcs.sci32
-rw-r--r--scilab/modules/metanet/macros/editor/ge_drawtitle.sci15
-rw-r--r--scilab/modules/metanet/macros/editor/ge_edge_fields.sci16
-rw-r--r--scilab/modules/metanet/macros/editor/ge_edit.sci19
-rw-r--r--scilab/modules/metanet/macros/editor/ge_enablemenus.sci24
-rw-r--r--scilab/modules/metanet/macros/editor/ge_eventhandler.sci247
-rw-r--r--scilab/modules/metanet/macros/editor/ge_file.sci16
-rw-r--r--scilab/modules/metanet/macros/editor/ge_font.sci14
-rw-r--r--scilab/modules/metanet/macros/editor/ge_get_arcs_id.sci31
-rw-r--r--scilab/modules/metanet/macros/editor/ge_get_edge_font.sci18
-rw-r--r--scilab/modules/metanet/macros/editor/ge_get_edge_id.sci32
-rw-r--r--scilab/modules/metanet/macros/editor/ge_get_edge_profile.sci23
-rw-r--r--scilab/modules/metanet/macros/editor/ge_get_edge_style.sci25
-rw-r--r--scilab/modules/metanet/macros/editor/ge_get_info.sci19
-rw-r--r--scilab/modules/metanet/macros/editor/ge_get_new_window.sci18
-rw-r--r--scilab/modules/metanet/macros/editor/ge_get_node_border.sci18
-rw-r--r--scilab/modules/metanet/macros/editor/ge_get_node_colors.sci20
-rw-r--r--scilab/modules/metanet/macros/editor/ge_get_node_diam.sci18
-rw-r--r--scilab/modules/metanet/macros/editor/ge_get_node_font.sci21
-rw-r--r--scilab/modules/metanet/macros/editor/ge_get_node_id.sci32
-rw-r--r--scilab/modules/metanet/macros/editor/ge_get_nodes_in_rect.sci18
-rw-r--r--scilab/modules/metanet/macros/editor/ge_get_region.sci40
-rw-r--r--scilab/modules/metanet/macros/editor/ge_getarc.sci44
-rw-r--r--scilab/modules/metanet/macros/editor/ge_getedge.sci29
-rw-r--r--scilab/modules/metanet/macros/editor/ge_getnode.sci36
-rw-r--r--scilab/modules/metanet/macros/editor/ge_help.sci13
-rw-r--r--scilab/modules/metanet/macros/editor/ge_hilite_arcs.sci17
-rw-r--r--scilab/modules/metanet/macros/editor/ge_hilite_edges.sci22
-rw-r--r--scilab/modules/metanet/macros/editor/ge_hilite_nodes.sci24
-rw-r--r--scilab/modules/metanet/macros/editor/ge_new_edge.sci91
-rw-r--r--scilab/modules/metanet/macros/editor/ge_new_graph.sci78
-rw-r--r--scilab/modules/metanet/macros/editor/ge_new_node.sci44
-rw-r--r--scilab/modules/metanet/macros/editor/ge_node_fields.sci17
-rw-r--r--scilab/modules/metanet/macros/editor/ge_profile2real.sci87
-rw-r--r--scilab/modules/metanet/macros/editor/ge_record.sci81
-rw-r--r--scilab/modules/metanet/macros/editor/ge_set_arcs_id.sci25
-rw-r--r--scilab/modules/metanet/macros/editor/ge_set_node_id.sci47
-rw-r--r--scilab/modules/metanet/macros/editor/ge_set_nodes_id.sci23
-rw-r--r--scilab/modules/metanet/macros/editor/ge_set_viewport.sci14
-rw-r--r--scilab/modules/metanet/macros/editor/ge_set_winsize.sci65
-rw-r--r--scilab/modules/metanet/macros/editor/ge_shortcut.sci30
-rw-r--r--scilab/modules/metanet/macros/editor/ge_show_new.sci26
-rw-r--r--scilab/modules/metanet/macros/editor/ge_unhilite_edges.sci23
-rw-r--r--scilab/modules/metanet/macros/editor/ge_unhilite_nodes.sci24
-rw-r--r--scilab/modules/metanet/macros/editor/ge_update_edges.sci37
-rw-r--r--scilab/modules/metanet/macros/editor/ge_update_gprops.sci22
-rw-r--r--scilab/modules/metanet/macros/editor/ge_view.sci16
-rw-r--r--scilab/modules/metanet/macros/graph_tools/%c_i_graph.sci34
-rw-r--r--scilab/modules/metanet/macros/graph_tools/%edgedata_c_edgedata.sci20
-rw-r--r--scilab/modules/metanet/macros/graph_tools/%edgedata_e.sci18
-rw-r--r--scilab/modules/metanet/macros/graph_tools/%edgedata_i_edgedata.sci20
-rw-r--r--scilab/modules/metanet/macros/graph_tools/%edgedata_p.sci16
-rw-r--r--scilab/modules/metanet/macros/graph_tools/%edgedata_size.sci18
-rw-r--r--scilab/modules/metanet/macros/graph_tools/%edges_e.sci16
-rw-r--r--scilab/modules/metanet/macros/graph_tools/%edges_i_edges.sci16
-rw-r--r--scilab/modules/metanet/macros/graph_tools/%edges_p.sci27
-rw-r--r--scilab/modules/metanet/macros/graph_tools/%edges_size.sci13
-rw-r--r--scilab/modules/metanet/macros/graph_tools/%egraphic_c_egraphic.sci19
-rw-r--r--scilab/modules/metanet/macros/graph_tools/%egraphic_e.sci19
-rw-r--r--scilab/modules/metanet/macros/graph_tools/%egraphic_i_egraphic.sci19
-rw-r--r--scilab/modules/metanet/macros/graph_tools/%egraphic_p.sci19
-rw-r--r--scilab/modules/metanet/macros/graph_tools/%egraphic_size.sci14
-rw-r--r--scilab/modules/metanet/macros/graph_tools/%gindex_i_h.sci13
-rw-r--r--scilab/modules/metanet/macros/graph_tools/%graph_e.sci79
-rw-r--r--scilab/modules/metanet/macros/graph_tools/%graph_p.sci21
-rw-r--r--scilab/modules/metanet/macros/graph_tools/%ngraphic_c_ngraphic.sci19
-rw-r--r--scilab/modules/metanet/macros/graph_tools/%ngraphic_e.sci19
-rw-r--r--scilab/modules/metanet/macros/graph_tools/%ngraphic_i_ngraphic.sci19
-rw-r--r--scilab/modules/metanet/macros/graph_tools/%ngraphic_p.sci19
-rw-r--r--scilab/modules/metanet/macros/graph_tools/%ngraphic_size.sci14
-rw-r--r--scilab/modules/metanet/macros/graph_tools/%nodedata_c_nodedata.sci20
-rw-r--r--scilab/modules/metanet/macros/graph_tools/%nodedata_e.sci18
-rw-r--r--scilab/modules/metanet/macros/graph_tools/%nodedata_i_nodedata.sci18
-rw-r--r--scilab/modules/metanet/macros/graph_tools/%nodedata_p.sci16
-rw-r--r--scilab/modules/metanet/macros/graph_tools/%nodedata_size.sci18
-rw-r--r--scilab/modules/metanet/macros/graph_tools/%nodes_e.sci14
-rw-r--r--scilab/modules/metanet/macros/graph_tools/%nodes_i_nodes.sci17
-rw-r--r--scilab/modules/metanet/macros/graph_tools/%nodes_p.sci16
-rw-r--r--scilab/modules/metanet/macros/graph_tools/%nodes_size.sci13
-rw-r--r--scilab/modules/metanet/macros/graph_tools/%s_i_edgedata.sci17
-rw-r--r--scilab/modules/metanet/macros/graph_tools/%s_i_edges.sci18
-rw-r--r--scilab/modules/metanet/macros/graph_tools/%s_i_egraphic.sci19
-rw-r--r--scilab/modules/metanet/macros/graph_tools/%s_i_graph.sci66
-rw-r--r--scilab/modules/metanet/macros/graph_tools/%s_i_ngraphic.sci18
-rw-r--r--scilab/modules/metanet/macros/graph_tools/%s_i_nodedata.sci17
-rw-r--r--scilab/modules/metanet/macros/graph_tools/%s_i_nodes.sci17
-rw-r--r--scilab/modules/metanet/macros/graph_tools/add_edge.sci73
-rw-r--r--scilab/modules/metanet/macros/graph_tools/add_edge_data.sci25
-rw-r--r--scilab/modules/metanet/macros/graph_tools/add_node.sci67
-rw-r--r--scilab/modules/metanet/macros/graph_tools/add_node_data.sci25
-rw-r--r--scilab/modules/metanet/macros/graph_tools/adj_lists.sci52
-rw-r--r--scilab/modules/metanet/macros/graph_tools/arc_graph.sci43
-rw-r--r--scilab/modules/metanet/macros/graph_tools/arc_length.sci28
-rw-r--r--scilab/modules/metanet/macros/graph_tools/arc_number.sci15
-rw-r--r--scilab/modules/metanet/macros/graph_tools/articul.sci36
-rw-r--r--scilab/modules/metanet/macros/graph_tools/bandwr.sci132
-rw-r--r--scilab/modules/metanet/macros/graph_tools/best_match.sci24
-rw-r--r--scilab/modules/metanet/macros/graph_tools/buildmacros.bat11
-rw-r--r--scilab/modules/metanet/macros/graph_tools/buildmacros.sce15
-rw-r--r--scilab/modules/metanet/macros/graph_tools/chain_struct.sci59
-rw-r--r--scilab/modules/metanet/macros/graph_tools/check_graph.sci227
-rw-r--r--scilab/modules/metanet/macros/graph_tools/circuit.sci31
-rw-r--r--scilab/modules/metanet/macros/graph_tools/cleanmacros.bat13
-rw-r--r--scilab/modules/metanet/macros/graph_tools/con_nodes.sci20
-rw-r--r--scilab/modules/metanet/macros/graph_tools/connex.sci29
-rw-r--r--scilab/modules/metanet/macros/graph_tools/contract_edge.sci40
-rw-r--r--scilab/modules/metanet/macros/graph_tools/convex_hull.sci23
-rw-r--r--scilab/modules/metanet/macros/graph_tools/cycle_basis.sci78
-rw-r--r--scilab/modules/metanet/macros/graph_tools/delete_arcs.sci14
-rw-r--r--scilab/modules/metanet/macros/graph_tools/delete_edges.sci41
-rw-r--r--scilab/modules/metanet/macros/graph_tools/delete_nodes.sci25
-rw-r--r--scilab/modules/metanet/macros/graph_tools/dist2polylines.sci58
-rw-r--r--scilab/modules/metanet/macros/graph_tools/edge_number.sci15
-rw-r--r--scilab/modules/metanet/macros/graph_tools/edgedatafields.sci18
-rw-r--r--scilab/modules/metanet/macros/graph_tools/edit_graph.sci96
-rw-r--r--scilab/modules/metanet/macros/graph_tools/editgraph_arc.sci23
-rw-r--r--scilab/modules/metanet/macros/graph_tools/editgraph_diagram.sci71
-rw-r--r--scilab/modules/metanet/macros/graph_tools/editgraph_node.sci36
-rw-r--r--scilab/modules/metanet/macros/graph_tools/editgraph_ver.sci13
-rw-r--r--scilab/modules/metanet/macros/graph_tools/find_path.sci34
-rw-r--r--scilab/modules/metanet/macros/graph_tools/format_struct.sci41
-rw-r--r--scilab/modules/metanet/macros/graph_tools/gen_net.sci74
-rw-r--r--scilab/modules/metanet/macros/graph_tools/girth.sci34
-rw-r--r--scilab/modules/metanet/macros/graph_tools/graph_2_mat.sci48
-rw-r--r--scilab/modules/metanet/macros/graph_tools/graph_center.sci33
-rw-r--r--scilab/modules/metanet/macros/graph_tools/graph_complement.sci56
-rw-r--r--scilab/modules/metanet/macros/graph_tools/graph_diameter.sci35
-rw-r--r--scilab/modules/metanet/macros/graph_tools/graph_power.sci41
-rw-r--r--scilab/modules/metanet/macros/graph_tools/graph_simp.sci39
-rw-r--r--scilab/modules/metanet/macros/graph_tools/graph_sum.sci30
-rw-r--r--scilab/modules/metanet/macros/graph_tools/graph_union.sci50
-rw-r--r--scilab/modules/metanet/macros/graph_tools/hamilton.sci28
-rw-r--r--scilab/modules/metanet/macros/graph_tools/hilite_edges.sci32
-rw-r--r--scilab/modules/metanet/macros/graph_tools/hilite_nodes.sci33
-rw-r--r--scilab/modules/metanet/macros/graph_tools/index_from_tail_head.sci45
-rw-r--r--scilab/modules/metanet/macros/graph_tools/initial_editgraph_tables.sci36
-rw-r--r--scilab/modules/metanet/macros/graph_tools/is_connex.sci30
-rw-r--r--scilab/modules/metanet/macros/graph_tools/knapsack.sci64
-rw-r--r--scilab/modules/metanet/macros/graph_tools/line_graph.sci35
-rw-r--r--scilab/modules/metanet/macros/graph_tools/load_graph.sci67
-rw-r--r--scilab/modules/metanet/macros/graph_tools/make_graph.sci82
-rw-r--r--scilab/modules/metanet/macros/graph_tools/mat_2_graph.sci87
-rw-r--r--scilab/modules/metanet/macros/graph_tools/max_cap_path.sci40
-rw-r--r--scilab/modules/metanet/macros/graph_tools/max_clique.sci47
-rw-r--r--scilab/modules/metanet/macros/graph_tools/max_flow.sci46
-rw-r--r--scilab/modules/metanet/macros/graph_tools/mesh2d.sci72
-rw-r--r--scilab/modules/metanet/macros/graph_tools/metanet.sci20
-rw-r--r--scilab/modules/metanet/macros/graph_tools/metanet_module_path.sci17
-rw-r--r--scilab/modules/metanet/macros/graph_tools/min_lcost_cflow.sci61
-rw-r--r--scilab/modules/metanet/macros/graph_tools/min_lcost_flow1.sci58
-rw-r--r--scilab/modules/metanet/macros/graph_tools/min_lcost_flow2.sci61
-rw-r--r--scilab/modules/metanet/macros/graph_tools/min_qcost_flow.sci77
-rw-r--r--scilab/modules/metanet/macros/graph_tools/min_weight_tree.sci57
-rw-r--r--scilab/modules/metanet/macros/graph_tools/neighbors.sci25
-rw-r--r--scilab/modules/metanet/macros/graph_tools/netclose.sci28
-rw-r--r--scilab/modules/metanet/macros/graph_tools/netwindow.sci22
-rw-r--r--scilab/modules/metanet/macros/graph_tools/netwindows.sci24
-rw-r--r--scilab/modules/metanet/macros/graph_tools/node_number.sci16
-rw-r--r--scilab/modules/metanet/macros/graph_tools/nodedatafields.sci18
-rw-r--r--scilab/modules/metanet/macros/graph_tools/nodes_2_path.sci35
-rw-r--r--scilab/modules/metanet/macros/graph_tools/nodes_degrees.sci23
-rw-r--r--scilab/modules/metanet/macros/graph_tools/path_2_nodes.sci32
-rw-r--r--scilab/modules/metanet/macros/graph_tools/perfect_match.sci31
-rw-r--r--scilab/modules/metanet/macros/graph_tools/pipe_network.sci53
-rw-r--r--scilab/modules/metanet/macros/graph_tools/plot_graph.sci82
-rw-r--r--scilab/modules/metanet/macros/graph_tools/predecessors.sci27
-rw-r--r--scilab/modules/metanet/macros/graph_tools/qassign.sci38
-rw-r--r--scilab/modules/metanet/macros/graph_tools/salesman.sci42
-rw-r--r--scilab/modules/metanet/macros/graph_tools/save_graph.sci29
-rw-r--r--scilab/modules/metanet/macros/graph_tools/set_edges_id.sci58
-rw-r--r--scilab/modules/metanet/macros/graph_tools/set_nodes_id.sci59
-rw-r--r--scilab/modules/metanet/macros/graph_tools/shortest_path.sci69
-rw-r--r--scilab/modules/metanet/macros/graph_tools/show_arcs.sci16
-rw-r--r--scilab/modules/metanet/macros/graph_tools/show_edges.sci44
-rw-r--r--scilab/modules/metanet/macros/graph_tools/show_graph.sci63
-rw-r--r--scilab/modules/metanet/macros/graph_tools/show_nodes.sci46
-rw-r--r--scilab/modules/metanet/macros/graph_tools/split_edge.sci45
-rw-r--r--scilab/modules/metanet/macros/graph_tools/splitfilepath.sci45
-rw-r--r--scilab/modules/metanet/macros/graph_tools/strong_con_nodes.sci21
-rw-r--r--scilab/modules/metanet/macros/graph_tools/strong_connex.sci26
-rw-r--r--scilab/modules/metanet/macros/graph_tools/subgraph.sci49
-rw-r--r--scilab/modules/metanet/macros/graph_tools/successors.sci27
-rw-r--r--scilab/modules/metanet/macros/graph_tools/supernode.sci57
-rw-r--r--scilab/modules/metanet/macros/graph_tools/trans_closure.sci38
-rw-r--r--scilab/modules/metanet/macros/graph_tools/unhilite_edges.sci32
-rw-r--r--scilab/modules/metanet/macros/graph_tools/unhilite_nodes.sci32
-rw-r--r--scilab/modules/metanet/macros/graph_tools/update_graph.sci81
-rw-r--r--scilab/modules/metanet/readme.txt1
-rw-r--r--scilab/modules/metanet/sci_gateway/c/gw_metanet.c79
-rw-r--r--scilab/modules/metanet/sci_gateway/fortran/sci_m6bandred.f115
-rw-r--r--scilab/modules/metanet/sci_gateway/fortran/sci_m6bmatch.f192
-rw-r--r--scilab/modules/metanet/sci_gateway/fortran/sci_m6busack.f125
-rw-r--r--scilab/modules/metanet/sci_gateway/fortran/sci_m6cent.f89
-rw-r--r--scilab/modules/metanet/sci_gateway/fortran/sci_m6chcm.f87
-rw-r--r--scilab/modules/metanet/sci_gateway/fortran/sci_m6clique.f95
-rw-r--r--scilab/modules/metanet/sci_gateway/fortran/sci_m6clique1.f84
-rw-r--r--scilab/modules/metanet/sci_gateway/fortran/sci_m6compc.f77
-rw-r--r--scilab/modules/metanet/sci_gateway/fortran/sci_m6compfc.f83
-rw-r--r--scilab/modules/metanet/sci_gateway/fortran/sci_m6concom.f59
-rw-r--r--scilab/modules/metanet/sci_gateway/fortran/sci_m6deumesh.f117
-rw-r--r--scilab/modules/metanet/sci_gateway/fortran/sci_m6dfs.f80
-rw-r--r--scilab/modules/metanet/sci_gateway/fortran/sci_m6dfs2.f85
-rw-r--r--scilab/modules/metanet/sci_gateway/fortran/sci_m6diam.f109
-rw-r--r--scilab/modules/metanet/sci_gateway/fortran/sci_m6dijkst.f87
-rw-r--r--scilab/modules/metanet/sci_gateway/fortran/sci_m6dmtree.f76
-rw-r--r--scilab/modules/metanet/sci_gateway/fortran/sci_m6edge2st.f55
-rw-r--r--scilab/modules/metanet/sci_gateway/fortran/sci_m6findiso.f65
-rw-r--r--scilab/modules/metanet/sci_gateway/fortran/sci_m6flomax.f113
-rw-r--r--scilab/modules/metanet/sci_gateway/fortran/sci_m6floqua.f119
-rw-r--r--scilab/modules/metanet/sci_gateway/fortran/sci_m6ford.f87
-rw-r--r--scilab/modules/metanet/sci_gateway/fortran/sci_m6fordfulk.f122
-rw-r--r--scilab/modules/metanet/sci_gateway/fortran/sci_m6frang.f77
-rw-r--r--scilab/modules/metanet/sci_gateway/fortran/sci_m6hamil.f97
-rw-r--r--scilab/modules/metanet/sci_gateway/fortran/sci_m6hullcvex.f78
-rw-r--r--scilab/modules/metanet/sci_gateway/fortran/sci_m6johns.f93
-rw-r--r--scilab/modules/metanet/sci_gateway/fortran/sci_m6kilter.f109
-rw-r--r--scilab/modules/metanet/sci_gateway/fortran/sci_m6knapsk.f142
-rw-r--r--scilab/modules/metanet/sci_gateway/fortran/sci_m6loadg.f210
-rw-r--r--scilab/modules/metanet/sci_gateway/fortran/sci_m6lp2tad.f80
-rw-r--r--scilab/modules/metanet/sci_gateway/fortran/sci_m6lp2tau.f84
-rw-r--r--scilab/modules/metanet/sci_gateway/fortran/sci_m6mesh2b.f115
-rw-r--r--scilab/modules/metanet/sci_gateway/fortran/sci_m6meshmesh.f229
-rw-r--r--scilab/modules/metanet/sci_gateway/fortran/sci_m6ns2p.f73
-rw-r--r--scilab/modules/metanet/sci_gateway/fortran/sci_m6p2ns.f77
-rw-r--r--scilab/modules/metanet/sci_gateway/fortran/sci_m6pcchna.f80
-rw-r--r--scilab/modules/metanet/sci_gateway/fortran/sci_m6permuto.f93
-rw-r--r--scilab/modules/metanet/sci_gateway/fortran/sci_m6prevn2p.f82
-rw-r--r--scilab/modules/metanet/sci_gateway/fortran/sci_m6prevn2st.f69
-rw-r--r--scilab/modules/metanet/sci_gateway/fortran/sci_m6prfmatch.f116
-rw-r--r--scilab/modules/metanet/sci_gateway/fortran/sci_m6relax.f139
-rw-r--r--scilab/modules/metanet/sci_gateway/fortran/sci_m6saveg.f225
-rw-r--r--scilab/modules/metanet/sci_gateway/fortran/sci_m6sconcom.f59
-rw-r--r--scilab/modules/metanet/sci_gateway/fortran/sci_m6ta2lpd.f91
-rw-r--r--scilab/modules/metanet/sci_gateway/fortran/sci_m6ta2lpu.f95
-rw-r--r--scilab/modules/metanet/sci_gateway/fortran/sci_m6tconex.f72
-rw-r--r--scilab/modules/metanet/sci_gateway/fortran/sci_m6transc.f75
-rw-r--r--scilab/modules/metanet/sci_gateway/fortran/sci_m6umtree.f74
-rw-r--r--scilab/modules/metanet/sci_gateway/fortran/sci_m6umtree1.f77
-rw-r--r--scilab/modules/metanet/sci_gateway/fortran/sci_m6visitor.f68
-rw-r--r--scilab/modules/metanet/sci_gateway/metanet_gateway.xml84
-rw-r--r--scilab/modules/metanet/src/c/LibScilab_Import.def8
-rw-r--r--scilab/modules/metanet/src/c/connex.h31
-rw-r--r--scilab/modules/metanet/src/c/defs.h29
-rw-r--r--scilab/modules/metanet/src/c/dmtree.c85
-rw-r--r--scilab/modules/metanet/src/c/files.c146
-rw-r--r--scilab/modules/metanet/src/c/hashtable_metanet.c189
-rw-r--r--scilab/modules/metanet/src/c/loadg.h41
-rw-r--r--scilab/modules/metanet/src/c/metanet_f_Import.def59
-rw-r--r--scilab/modules/metanet/src/c/nometanet/nometanet.c23
-rw-r--r--scilab/modules/metanet/src/c/nometanet/nometanet.rc97
-rw-r--r--scilab/modules/metanet/src/c/nometanet/nometanet.vcproj399
-rw-r--r--scilab/modules/metanet/src/c/nometanet/resource.h27
-rw-r--r--scilab/modules/metanet/src/c/paths.h71
-rw-r--r--scilab/modules/metanet/src/c/saveg.h44
-rw-r--r--scilab/modules/metanet/src/c/scilab_windows_Import.def8
-rw-r--r--scilab/modules/metanet/src/c/transc.c106
-rw-r--r--scilab/modules/metanet/src/fortran/LibScilab_Import.def38
-rw-r--r--scilab/modules/metanet/src/fortran/arbor.f133
-rw-r--r--scilab/modules/metanet/src/fortran/bmatch.f1140
-rw-r--r--scilab/modules/metanet/src/fortran/busack.f146
-rw-r--r--scilab/modules/metanet/src/fortran/cent.f29
-rw-r--r--scilab/modules/metanet/src/fortran/chcm.f54
-rw-r--r--scilab/modules/metanet/src/fortran/clique.f114
-rw-r--r--scilab/modules/metanet/src/fortran/compc.f29
-rw-r--r--scilab/modules/metanet/src/fortran/compfc.f31
-rw-r--r--scilab/modules/metanet/src/fortran/deumesh.f988
-rw-r--r--scilab/modules/metanet/src/fortran/dfs1.f29
-rw-r--r--scilab/modules/metanet/src/fortran/dfs2.f52
-rw-r--r--scilab/modules/metanet/src/fortran/diam.f32
-rw-r--r--scilab/modules/metanet/src/fortran/dijkst.f50
-rw-r--r--scilab/modules/metanet/src/fortran/flomax.f94
-rw-r--r--scilab/modules/metanet/src/fortran/floqua.f64
-rw-r--r--scilab/modules/metanet/src/fortran/ford.f47
-rw-r--r--scilab/modules/metanet/src/fortran/fordfulk.f192
-rw-r--r--scilab/modules/metanet/src/fortran/ftrans.f49
-rw-r--r--scilab/modules/metanet/src/fortran/getran.f40
-rw-r--r--scilab/modules/metanet/src/fortran/hamil.f564
-rw-r--r--scilab/modules/metanet/src/fortran/hullcvex.f332
-rw-r--r--scilab/modules/metanet/src/fortran/johns.f92
-rw-r--r--scilab/modules/metanet/src/fortran/kilter.f136
-rw-r--r--scilab/modules/metanet/src/fortran/kiltq.f136
-rw-r--r--scilab/modules/metanet/src/fortran/knapsk.f575
-rw-r--r--scilab/modules/metanet/src/fortran/l2que.f64
-rw-r--r--scilab/modules/metanet/src/fortran/match.f412
-rw-r--r--scilab/modules/metanet/src/fortran/mesh2b.f839
-rw-r--r--scilab/modules/metanet/src/fortran/meshmesh.f314
-rw-r--r--scilab/modules/metanet/src/fortran/metanet_Import.def15
-rw-r--r--scilab/modules/metanet/src/fortran/metanet_f2c.vcproj1230
-rw-r--r--scilab/modules/metanet/src/fortran/metanet_f_header.def7
-rw-r--r--scilab/modules/metanet/src/fortran/minty.f129
-rw-r--r--scilab/modules/metanet/src/fortran/mintyq.f138
-rw-r--r--scilab/modules/metanet/src/fortran/pcchna.f52
-rw-r--r--scilab/modules/metanet/src/fortran/prfmatch.f755
-rw-r--r--scilab/modules/metanet/src/fortran/prim1.f89
-rw-r--r--scilab/modules/metanet/src/fortran/seed.f54
-rw-r--r--scilab/modules/metanet/src/fortran/tconex.f45
-rw-r--r--scilab/modules/metanet/tests/nonreg_tests/bug_3294.dia.ref15
-rw-r--r--scilab/modules/metanet/tests/nonreg_tests/bug_3294.tst17
-rw-r--r--scilab/modules/metanet/tests/unit_tests/Max_clique.dia.ref22
-rw-r--r--scilab/modules/metanet/tests/unit_tests/Max_clique.tst26
-rw-r--r--scilab/modules/metanet/tests/unit_tests/add_edge.dia.ref18
-rw-r--r--scilab/modules/metanet/tests/unit_tests/add_edge.tst23
-rw-r--r--scilab/modules/metanet/tests/unit_tests/add_node.dia.ref19
-rw-r--r--scilab/modules/metanet/tests/unit_tests/add_node.tst23
-rw-r--r--scilab/modules/metanet/tests/unit_tests/adj_lists.dia.ref24
-rw-r--r--scilab/modules/metanet/tests/unit_tests/adj_lists.tst29
-rw-r--r--scilab/modules/metanet/tests/unit_tests/arc_graph.dia.ref17
-rw-r--r--scilab/modules/metanet/tests/unit_tests/arc_graph.tst23
-rw-r--r--scilab/modules/metanet/tests/unit_tests/articul.dia.ref21
-rw-r--r--scilab/modules/metanet/tests/unit_tests/articul.tst23
-rw-r--r--scilab/modules/metanet/tests/unit_tests/bandwr.dia.ref49
-rw-r--r--scilab/modules/metanet/tests/unit_tests/best_match.dia.ref37
-rw-r--r--scilab/modules/metanet/tests/unit_tests/best_match.tst42
-rw-r--r--scilab/modules/metanet/tests/unit_tests/chain_struct.dia.ref42
-rw-r--r--scilab/modules/metanet/tests/unit_tests/chain_struct.tst22
-rw-r--r--scilab/modules/metanet/tests/unit_tests/circuit.dia.ref30
-rw-r--r--scilab/modules/metanet/tests/unit_tests/circuit.tst26
-rw-r--r--scilab/modules/metanet/tests/unit_tests/colored.graph89
-rw-r--r--scilab/modules/metanet/tests/unit_tests/con_nodes.dia.ref27
-rw-r--r--scilab/modules/metanet/tests/unit_tests/connex.dia.ref32
-rw-r--r--scilab/modules/metanet/tests/unit_tests/connex.tst24
-rw-r--r--scilab/modules/metanet/tests/unit_tests/contract_edge.dia.ref17
-rw-r--r--scilab/modules/metanet/tests/unit_tests/contract_edge.tst21
-rw-r--r--scilab/modules/metanet/tests/unit_tests/convex_hull.dia.ref28
-rw-r--r--scilab/modules/metanet/tests/unit_tests/convex_hull.tst27
-rw-r--r--scilab/modules/metanet/tests/unit_tests/cycle_basis.dia.ref28
-rw-r--r--scilab/modules/metanet/tests/unit_tests/cycle_basis.tst32
-rw-r--r--scilab/modules/metanet/tests/unit_tests/delete_arcs.dia.ref21
-rw-r--r--scilab/modules/metanet/tests/unit_tests/delete_arcs.tst26
-rw-r--r--scilab/modules/metanet/tests/unit_tests/delete_nodes.dia.ref18
-rw-r--r--scilab/modules/metanet/tests/unit_tests/delete_nodes.tst23
-rw-r--r--scilab/modules/metanet/tests/unit_tests/find_path.dia.ref18
-rw-r--r--scilab/modules/metanet/tests/unit_tests/find_path.tst23
-rw-r--r--scilab/modules/metanet/tests/unit_tests/gen_net.tst21
-rw-r--r--scilab/modules/metanet/tests/unit_tests/girth.dia.ref19
-rw-r--r--scilab/modules/metanet/tests/unit_tests/graph_2_mat.dia.ref84
-rw-r--r--scilab/modules/metanet/tests/unit_tests/graph_2_mat.tst16
-rw-r--r--scilab/modules/metanet/tests/unit_tests/graph_center.dia.ref24
-rw-r--r--scilab/modules/metanet/tests/unit_tests/graph_center.tst23
-rw-r--r--scilab/modules/metanet/tests/unit_tests/graph_complement.dia.ref22
-rw-r--r--scilab/modules/metanet/tests/unit_tests/graph_complement.tst25
-rw-r--r--scilab/modules/metanet/tests/unit_tests/graph_diameter.dia.ref24
-rw-r--r--scilab/modules/metanet/tests/unit_tests/graph_diameter.tst23
-rw-r--r--scilab/modules/metanet/tests/unit_tests/graph_power.dia.ref18
-rw-r--r--scilab/modules/metanet/tests/unit_tests/graph_power.tst22
-rw-r--r--scilab/modules/metanet/tests/unit_tests/graph_simp.dia.ref18
-rw-r--r--scilab/modules/metanet/tests/unit_tests/graph_simp.tst22
-rw-r--r--scilab/modules/metanet/tests/unit_tests/graph_sum.dia.ref32
-rw-r--r--scilab/modules/metanet/tests/unit_tests/graph_sum.tst37
-rw-r--r--scilab/modules/metanet/tests/unit_tests/graph_union.dia.ref30
-rw-r--r--scilab/modules/metanet/tests/unit_tests/graph_union.tst35
-rw-r--r--scilab/modules/metanet/tests/unit_tests/hamilton.dia.ref28
-rw-r--r--scilab/modules/metanet/tests/unit_tests/hamilton.tst23
-rw-r--r--scilab/modules/metanet/tests/unit_tests/is_connex.dia.ref19
-rw-r--r--scilab/modules/metanet/tests/unit_tests/is_connex.tst18
-rw-r--r--scilab/modules/metanet/tests/unit_tests/knapsack.dia.ref42
-rw-r--r--scilab/modules/metanet/tests/unit_tests/knapsack.tst18
-rw-r--r--scilab/modules/metanet/tests/unit_tests/line_graph.dia.ref17
-rw-r--r--scilab/modules/metanet/tests/unit_tests/line_graph.tst22
-rw-r--r--scilab/modules/metanet/tests/unit_tests/load_graph.dia.ref14
-rw-r--r--scilab/modules/metanet/tests/unit_tests/load_graph.tst17
-rw-r--r--scilab/modules/metanet/tests/unit_tests/make_graph.dia.ref29
-rw-r--r--scilab/modules/metanet/tests/unit_tests/make_graph.tst29
-rw-r--r--scilab/modules/metanet/tests/unit_tests/mat_2_graph.dia.ref20
-rw-r--r--scilab/modules/metanet/tests/unit_tests/mat_2_graph.tst22
-rw-r--r--scilab/modules/metanet/tests/unit_tests/max_cap_path.dia.ref21
-rw-r--r--scilab/modules/metanet/tests/unit_tests/max_cap_path.tst27
-rw-r--r--scilab/modules/metanet/tests/unit_tests/max_flow.dia.ref34
-rw-r--r--scilab/modules/metanet/tests/unit_tests/max_flow.tst38
-rw-r--r--scilab/modules/metanet/tests/unit_tests/mesh100.graph885
-rw-r--r--scilab/modules/metanet/tests/unit_tests/mesh1000.graph8691
-rw-r--r--scilab/modules/metanet/tests/unit_tests/mesh2d.dia.ref114
-rw-r--r--scilab/modules/metanet/tests/unit_tests/mesh2d.tst110
-rw-r--r--scilab/modules/metanet/tests/unit_tests/min_lcost_cflow.dia.ref33
-rw-r--r--scilab/modules/metanet/tests/unit_tests/min_lcost_cflow.tst36
-rw-r--r--scilab/modules/metanet/tests/unit_tests/min_lcost_flow1.dia.ref31
-rw-r--r--scilab/modules/metanet/tests/unit_tests/min_lcost_flow1.tst35
-rw-r--r--scilab/modules/metanet/tests/unit_tests/min_lcost_flow2.dia.ref36
-rw-r--r--scilab/modules/metanet/tests/unit_tests/min_lcost_flow2.tst42
-rw-r--r--scilab/modules/metanet/tests/unit_tests/min_qcost_flow.dia.ref32
-rw-r--r--scilab/modules/metanet/tests/unit_tests/min_qcost_flow.tst36
-rw-r--r--scilab/modules/metanet/tests/unit_tests/min_weight_tree.dia.ref22
-rw-r--r--scilab/modules/metanet/tests/unit_tests/min_weight_tree.tst26
-rw-r--r--scilab/modules/metanet/tests/unit_tests/neighbors.dia.ref20
-rw-r--r--scilab/modules/metanet/tests/unit_tests/neighbors.tst23
-rw-r--r--scilab/modules/metanet/tests/unit_tests/node_2_path.dia.ref24
-rw-r--r--scilab/modules/metanet/tests/unit_tests/node_2_path.tst29
-rw-r--r--scilab/modules/metanet/tests/unit_tests/nodes_degrees.dia.ref36
-rw-r--r--scilab/modules/metanet/tests/unit_tests/nodes_degrees.tst23
-rw-r--r--scilab/modules/metanet/tests/unit_tests/path_2_nodes.dia.ref24
-rw-r--r--scilab/modules/metanet/tests/unit_tests/path_2_nodes.tst29
-rw-r--r--scilab/modules/metanet/tests/unit_tests/perfect_match.dia.ref26
-rw-r--r--scilab/modules/metanet/tests/unit_tests/perfect_match.tst31
-rw-r--r--scilab/modules/metanet/tests/unit_tests/pipe_network.dia.ref73
-rw-r--r--scilab/modules/metanet/tests/unit_tests/pipe_network.tst28
-rw-r--r--scilab/modules/metanet/tests/unit_tests/plot_graphbug.tst33
-rw-r--r--scilab/modules/metanet/tests/unit_tests/predecessors.dia.ref20
-rw-r--r--scilab/modules/metanet/tests/unit_tests/predecessors.tst23
-rw-r--r--scilab/modules/metanet/tests/unit_tests/qassign.dia.ref28
-rw-r--r--scilab/modules/metanet/tests/unit_tests/qassign.tst21
-rw-r--r--scilab/modules/metanet/tests/unit_tests/salesman.dia.ref27
-rw-r--r--scilab/modules/metanet/tests/unit_tests/salesman.tst33
-rw-r--r--scilab/modules/metanet/tests/unit_tests/shortest_path.dia.ref26
-rw-r--r--scilab/modules/metanet/tests/unit_tests/shortest_path.tst31
-rw-r--r--scilab/modules/metanet/tests/unit_tests/show_arcs.dia.ref23
-rw-r--r--scilab/modules/metanet/tests/unit_tests/show_arcs.tst28
-rw-r--r--scilab/modules/metanet/tests/unit_tests/show_graph.dia.ref26
-rw-r--r--scilab/modules/metanet/tests/unit_tests/show_graph.tst33
-rw-r--r--scilab/modules/metanet/tests/unit_tests/split_edge.dia.ref18
-rw-r--r--scilab/modules/metanet/tests/unit_tests/split_edge.tst22
-rw-r--r--scilab/modules/metanet/tests/unit_tests/strong_con_nodes.dia.ref23
-rw-r--r--scilab/modules/metanet/tests/unit_tests/strong_con_nodes.tst28
-rw-r--r--scilab/modules/metanet/tests/unit_tests/strong_connex.dia.ref18
-rw-r--r--scilab/modules/metanet/tests/unit_tests/strong_connex.tst23
-rw-r--r--scilab/modules/metanet/tests/unit_tests/subgraph.dia.ref27
-rw-r--r--scilab/modules/metanet/tests/unit_tests/subgraph.tst32
-rw-r--r--scilab/modules/metanet/tests/unit_tests/successors.dia.ref20
-rw-r--r--scilab/modules/metanet/tests/unit_tests/successors.tst22
-rw-r--r--scilab/modules/metanet/tests/unit_tests/supernodebug.dia.ref22
-rw-r--r--scilab/modules/metanet/tests/unit_tests/supernodebug.tst27
-rw-r--r--scilab/modules/metanet/tests/unit_tests/trans_closure.dia.ref25
-rw-r--r--scilab/modules/metanet/tests/unit_tests/trans_closure.tst29
-rw-r--r--scilab/modules/metanet/version.xml21
549 files changed, 0 insertions, 45418 deletions
diff --git a/scilab/modules/metanet/help/en_US/netwindow.xml b/scilab/modules/metanet/help/en_US/netwindow.xml
deleted file mode 100644
index 48103b9..0000000
--- a/scilab/modules/metanet/help/en_US/netwindow.xml
+++ /dev/null
@@ -1,64 +0,0 @@
1<?xml version="1.0" encoding="UTF-8"?>
2<!--
3 * Scilab ( http://www.scilab.org/ ) - This file is part of Scilab
4 * Copyright (C) 2008 - INRIA
5 *
6 * This file must be used under the terms of the CeCILL.
7 * This source file is licensed as described in the file COPYING, which
8 * you should have received as part of this distribution. The terms
9 * are also available at
10 * http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
11 *
12 -->
13<refentry xmlns="http://docbook.org/ns/docbook" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:svg="http://www.w3.org/2000/svg" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:db="http://docbook.org/ns/docbook" version="5.0-subset Scilab" xml:lang="en" xml:id="netwindow">
14 <info>
15 <pubdate>$LastChangedDate$</pubdate>
16 </info>
17 <refnamediv>
18 <refname>netwindow</refname>
19 <refpurpose> selects the current edit_graph window</refpurpose>
20 </refnamediv>
21 <refsynopsisdiv>
22 <title>Calling Sequence</title>
23 <synopsis>netwindow(window)</synopsis>
24 </refsynopsisdiv>
25 <refsection>
26 <title>Parameters</title>
27 <variablelist>
28 <varlistentry>
29 <term>window</term>
30 <listitem>
31 <para>integer, window number</para>
32 </listitem>
33 </varlistentry>
34 </variablelist>
35 </refsection>
36 <refsection>
37 <title>Description</title>
38 <para>
39 This function is used to change the current edit_graph
40 window to those given by the <literal>window</literal> argument.
41
42 Current edit_graph window is used by show_arcs, show_nodes,.. functions.
43
44 The numbers of existing windows are given by the function
45 <literal>netwindows</literal>.</para>
46 </refsection>
47 <refsection>
48 <title>See Also</title>
49 <simplelist type="inline">
50 <member>
51 <link linkend="edit_graph">edit_graph</link>
52 </member>
53 <member>
54 <link linkend="netclose">netclose</link>
55 </member>
56 <member>
57 <link linkend="netwindows">netwindows</link>
58 </member>
59 <member>
60 <link linkend="show_graph">show_graph</link>
61 </member>
62 </simplelist>
63 </refsection>
64</refentry>
diff --git a/scilab/modules/metanet/help/en_US/netwindows.xml b/scilab/modules/metanet/help/en_US/netwindows.xml
deleted file mode 100644
index 54e9e489..0000000
--- a/scilab/modules/metanet/help/en_US/netwindows.xml
+++ /dev/null
@@ -1,61 +0,0 @@
1<?xml version="1.0" encoding="UTF-8"?>
2<!--
3 * Scilab ( http://www.scilab.org/ ) - This file is part of Scilab
4 * Copyright (C) 2008 - INRIA
5 *
6 * This file must be used under the terms of the CeCILL.
7 * This source file is licensed as described in the file COPYING, which
8 * you should have received as part of this distribution. The terms
9 * are also available at
10 * http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
11 *
12 -->
13<refentry xmlns="http://docbook.org/ns/docbook" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:svg="http://www.w3.org/2000/svg" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:db="http://docbook.org/ns/docbook" version="5.0-subset Scilab" xml:lang="en" xml:id="netwindows">
14 <info>
15 <pubdate>$LastChangedDate$</pubdate>
16 </info>
17 <refnamediv>
18 <refname>netwindows</refname>
19 <refpurpose> gets the numbers of edit_graph windows</refpurpose>
20 </refnamediv>
21 <refsynopsisdiv>
22 <title>Calling Sequence</title>
23 <synopsis>l = netwindows()</synopsis>
24 </refsynopsisdiv>
25 <refsection>
26 <title>Parameters</title>
27 <variablelist>
28 <varlistentry>
29 <term>l</term>
30 <listitem>
31 <para>list</para>
32 </listitem>
33 </varlistentry>
34 </variablelist>
35 </refsection>
36 <refsection>
37 <title>Description</title>
38 <para>
39 This function returns a list <literal>l</literal>. Its first element is the row vector of
40 all the edit_graph windows and the second element is the number of the
41 current edit_graph window. This number is equal to 0 if no current Metanet
42 window exists.</para>
43 </refsection>
44 <refsection>
45 <title>See Also</title>
46 <simplelist type="inline">
47 <member>
48 <link linkend="edit_graph">edit_graph</link>
49 </member>
50 <member>
51 <link linkend="netclose">netclose</link>
52 </member>
53 <member>
54 <link linkend="netwindow">netwindow</link>
55 </member>
56 <member>
57 <link linkend="show_graph">show_graph</link>
58 </member>
59 </simplelist>
60 </refsection>
61</refentry>
diff --git a/scilab/modules/metanet/help/en_US/ngraphic_data_structure.xml b/scilab/modules/metanet/help/en_US/ngraphic_data_structure.xml
deleted file mode 100644
index 4d96dc1..0000000
--- a/scilab/modules/metanet/help/en_US/ngraphic_data_structure.xml
+++ /dev/null
@@ -1,115 +0,0 @@
1<?xml version="1.0" encoding="UTF-8"?>
2<!--
3 * Scilab ( http://www.scilab.org/ ) - This file is part of Scilab
4 * Copyright (C) 2008 - INRIA
5 *
6 * This file must be used under the terms of the CeCILL.
7 * This source file is licensed as described in the file COPYING, which
8 * you should have received as part of this distribution. The terms
9 * are also available at
10 * http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
11 *
12 -->
13<refentry xmlns="http://docbook.org/ns/docbook" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:svg="http://www.w3.org/2000/svg" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:db="http://docbook.org/ns/docbook" version="5.0-subset Scilab" xml:lang="en" xml:id="ngraphic_data_structure">
14 <info>
15 <pubdate>$LastChangedDate$</pubdate>
16 </info>
17 <refnamediv>
18 <refname>ngraphic_data_structure</refname>
19 <refpurpose>data structure representing the graphic properties used for nodes graphical display</refpurpose>
20 </refnamediv>
21 <refsection>
22 <title>Description</title>
23 <para> A data structure represented by a Scilab <literal>mlist</literal> with type <literal>ngraphic</literal>
24 and 10 fields:</para>
25 <itemizedlist>
26 <listitem>
27 <para><literal>display</literal> a string. Gives the information that
28 is displayed with the nodes. The possible values are
29 <literal>'nothing'</literal>, <literal>'number'</literal>,
30 <literal>'name'</literal> or any node data field name as given by
31 the <literal>nodedatafields</literal> function. Of course if
32 <literal>display</literal> is set to <literal>'nothing'</literal> no
33 information is displayed.</para>
34 </listitem>
35 <listitem>
36 <para><literal>defaults</literal> A Scilab tlist data structure of
37 type <literal>nodedefs</literal>. Contains the default values for
38 <literal>'type'</literal>, <literal>'diam'</literal>,<literal>'border'</literal>,
39 <literal>'font'</literal>, <literal>'colors'</literal>
40 properties.</para>
41 </listitem>
42 <listitem>
43 <para><literal>name</literal> A row vector of strings. The name associated with each node.</para>
44 </listitem>
45 <listitem>
46 <para><literal>x</literal> A row vector which gives the abscissae of each node.</para>
47 </listitem>
48 <listitem>
49 <para><literal>y</literal> A row vector which gives the ordinate of each node.</para>
50 </listitem>
51 <listitem>
52 <para><literal>type</literal> A row vector with integer values
53 which stores the type index for each node. A zero value stands for the default value.</para>
54 </listitem>
55 <listitem>
56 <para><literal>diam</literal> A row vector
57 which stores the diameter of each node. A zero value stands for the default value.</para>
58 </listitem>
59 <listitem>
60 <para><literal>border</literal>a row vector. The thickness of the
61 polyline used to draw the border of each node. A zero value stands for the default value.</para>
62 </listitem>
63 <listitem>
64 <para><literal>colors</literal>a matrix with to rows. The first row
65 contains the color index of the node border, the second row
66 contains the index of the node's background color. A zero
67 value of either color index stands for the corresponding default value.</para>
68 </listitem>
69 <listitem>
70 <para><literal>font</literal>a matrix with 3
71 rows: <literal>font(1,i)</literal> is the font size,
72 <literal>font(2,i)</literal> is the font
73 style,<literal>font(2,i)</literal> is the font color used to draw
74 information on the i th node.A zero
75 value of either entry stands for the corresponding default value.</para>
76 </listitem>
77 </itemizedlist>
78 </refsection>
79 <refsection>
80 <title>Examples</title>
81 <programlisting role="example"><![CDATA[
82//create a simple graph
83ta=[1 1 2 7 8 9 10 10 10 10 11 12 13 13 4];
84he=[2 10 7 8 9 7 7 11 13 13 12 13 9 10 4];
85g=make_graph('simple',1,13,ta,he);
86g.nodes.graphics.x=[40,33,29,63,146,233,75,42,114,156,237,260,159];
87g.nodes.graphics.y=[7,61,103,142,145,143,43,120,145,18,36,107,107];
88show_graph(g,'new')
89
90g.nodes.graphics.defaults.border=2;
91g.nodes.graphics.defaults.diam=22;
92g.nodes.graphics.defaults.colors=[color('red');color('blue')];
93show_graph(g)
94
95g.nodes.graphics.border(1:5)=1;
96g.nodes.graphics.diam(6)=40;
97g.nodes.graphics.type(11)=1;
98
99show_graph(g)
100
101g.nodes.graphics.display='number';
102show_graph(g)
103
104g.nodes.graphics
105 ]]></programlisting>
106 </refsection>
107 <refsection>
108 <title>See Also</title>
109 <simplelist type="inline">
110 <member>
111 <link linkend="graph_data_structure">graph_data_structure</link>
112 </member>
113 </simplelist>
114 </refsection>
115</refentry>
diff --git a/scilab/modules/metanet/help/en_US/node_number.xml b/scilab/modules/metanet/help/en_US/node_number.xml
deleted file mode 100644
index 704b5b6..0000000
--- a/scilab/modules/metanet/help/en_US/node_number.xml
+++ /dev/null
@@ -1,57 +0,0 @@
1<?xml version="1.0" encoding="UTF-8"?>
2<!--
3 * Scilab ( http://www.scilab.org/ ) - This file is part of Scilab
4 * Copyright (C) 2008 - INRIA
5 *
6 * This file must be used under the terms of the CeCILL.
7 * This source file is licensed as described in the file COPYING, which
8 * you should have received as part of this distribution. The terms
9 * are also available at
10 * http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
11 *
12 -->
13<refentry xmlns="http://docbook.org/ns/docbook" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:svg="http://www.w3.org/2000/svg" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:db="http://docbook.org/ns/docbook" version="5.0-subset Scilab" xml:lang="en" xml:id="node_number">
14 <info>
15 <pubdate>$LastChangedDate$</pubdate>
16 </info>
17 <refnamediv>
18 <refname>node_number</refname>
19 <refpurpose> number of nodes of a graph</refpurpose>
20 </refnamediv>
21 <refsynopsisdiv>
22 <title>Calling Sequence</title>
23 <synopsis>n = node_number(g)</synopsis>
24 </refsynopsisdiv>
25 <refsection>
26 <title>Parameters</title>
27 <variablelist>
28 <varlistentry>
29 <term>g</term>
30 <listitem>
31 <para>graph list</para>
32 </listitem>
33 </varlistentry>
34 <varlistentry>
35 <term>n</term>
36 <listitem>
37 <para>integer, number of nodes</para>
38 </listitem>
39 </varlistentry>
40 </variablelist>
41 </refsection>
42 <refsection>
43 <title>Description</title>
44 <para><literal>node_number</literal> returns the number <literal>n</literal> of nodes of the graph.</para>
45 </refsection>
46 <refsection>
47 <title>See Also</title>
48 <simplelist type="inline">
49 <member>
50 <link linkend="arc_number">arc_number</link>
51 </member>
52 <member>
53 <link linkend="edge_number">edge_number</link>
54 </member>
55 </simplelist>
56 </refsection>
57</refentry>
diff --git a/scilab/modules/metanet/help/en_US/nodedatafields.xml b/scilab/modules/metanet/help/en_US/nodedatafields.xml
deleted file mode 100644
index 9d898e6..0000000
--- a/scilab/modules/metanet/help/en_US/nodedatafields.xml
+++ /dev/null
@@ -1,82 +0,0 @@
1<?xml version="1.0" encoding="UTF-8"?>
2<!--
3 * Scilab ( http://www.scilab.org/ ) - This file is part of Scilab
4 * Copyright (C) 2008 - INRIA
5 *
6 * This file must be used under the terms of the CeCILL.
7 * This source file is licensed as described in the file COPYING, which
8 * you should have received as part of this distribution. The terms
9 * are also available at
10 * http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
11 *
12 -->
13<refentry xmlns="http://docbook.org/ns/docbook" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:svg="http://www.w3.org/2000/svg" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:db="http://docbook.org/ns/docbook" version="5.0-subset Scilab" xml:lang="en" xml:id="nodedatafields">
14 <info>
15 <pubdate>$LastChangedDate$</pubdate>
16 </info>
17 <refnamediv>
18 <refname>nodedatafields</refname>
19 <refpurpose> returns the vector of node data fields names</refpurpose>
20 </refnamediv>
21 <refsynopsisdiv>
22 <title>Calling Sequence</title>
23 <synopsis>F = nodedatafields(g)</synopsis>
24 </refsynopsisdiv>
25 <refsection>
26 <title>Parameters</title>
27 <variablelist>
28 <varlistentry>
29 <term>g</term>
30 <listitem>
31 <para>a graph data structure (see <link linkend="graph_data_structure">graph_data_structure</link> )
32 </para>
33 </listitem>
34 </varlistentry>
35 <varlistentry>
36 <term>F</term>
37 <listitem>
38 <para>a row vector of strings. Each element is a field name of the nodes data data structure.
39 </para>
40 </listitem>
41 </varlistentry>
42 </variablelist>
43 </refsection>
44 <refsection>
45 <title>Description</title>
46 <para>It is possible to associate data to the nodes of a graph. This
47 can be done with the <link linkend="add_node_data">add_node_data</link> function. the
48 <literal>nodedatafields</literal> function allows to retreive the field
49 names of these data. A given node data can be referenced by its field name
50 <literal>g.nodes.data(field_name)</literal>.</para>
51 </refsection>
52 <refsection>
53 <title>Examples</title>
54 <programlisting role="example"><![CDATA[
55//create a simple graph
56ta=[1 1 2 7 8 9 10 10 10 10 11 12 13 13];
57he=[2 10 7 8 9 7 7 11 13 13 12 13 9 10];
58g=make_graph('simple',1,13,ta,he);
59g.nodes.graphics.x=[40,33,29,63,146,233,75,42,114,156,237,260,159];
60g.nodes.graphics.y=[7,61,103,142,145,143,43,120,145,18,36,107,107];
61show_graph(g,'new')
62nodedatafields(g)
63
64
65g=add_node_data(g,'demand',round(10*rand(1,13,'u')));
66g=add_node_data(g,'label','e'+string(1:13));
67nodedatafields(g)
68g.nodes.data.label
69 ]]></programlisting>
70 </refsection>
71 <refsection>
72 <title>See Also</title>
73 <simplelist type="inline">
74 <member>
75 <link linkend="graph_data_structure">graph_data_structure</link>
76 </member>
77 <member>
78 <link linkend="add_node_data">add_node_data</link>
79 </member>
80 </simplelist>
81 </refsection>
82</refentry>
diff --git a/scilab/modules/metanet/help/en_US/nodes_2_path.xml b/scilab/modules/metanet/help/en_US/nodes_2_path.xml
deleted file mode 100644
index dac75c5..0000000
--- a/scilab/modules/metanet/help/en_US/nodes_2_path.xml
+++ /dev/null
@@ -1,80 +0,0 @@
1<?xml version="1.0" encoding="UTF-8"?>
2<!--
3 * Scilab ( http://www.scilab.org/ ) - This file is part of Scilab
4 * Copyright (C) 2008 - INRIA
5 *
6 * This file must be used under the terms of the CeCILL.
7 * This source file is licensed as described in the file COPYING, which
8 * you should have received as part of this distribution. The terms
9 * are also available at
10 * http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
11 *
12 -->
13<refentry xmlns="http://docbook.org/ns/docbook" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:svg="http://www.w3.org/2000/svg" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:db="http://docbook.org/ns/docbook" version="5.0-subset Scilab" xml:lang="en" xml:id="nodes_2_path">
14 <info>
15 <pubdate>$LastChangedDate$</pubdate>
16 </info>
17 <refnamediv>
18 <refname>nodes_2_path</refname>
19 <refpurpose> path from a set of nodes</refpurpose>
20 </refnamediv>
21 <refsynopsisdiv>
22 <title>Calling Sequence</title>
23 <synopsis>p = nodes_2_path(ns,g)</synopsis>
24 </refsynopsisdiv>
25 <refsection>
26 <title>Parameters</title>
27 <variablelist>
28 <varlistentry>
29 <term>ns</term>
30 <listitem>
31 <para>row vector of integer numbers of the set of nodes</para>
32 </listitem>
33 </varlistentry>
34 <varlistentry>
35 <term>g</term>
36 <listitem>
37 <para> a <link linkend="graph_data_structure">graph_data_structure</link>.</para>
38 </listitem>
39 </varlistentry>
40 <varlistentry>
41 <term>p</term>
42 <listitem>
43 <para>row vector of integer numbers of the arcs of the path if it exists</para>
44 </listitem>
45 </varlistentry>
46 </variablelist>
47 </refsection>
48 <refsection>
49 <title>Description</title>
50 <para><literal>nodes_2_path</literal> returns the path <literal>p</literal> corresponding to the node
51 sequence <literal>ns</literal> given by its node numbers if it exists ; it returns
52 the empty vector <literal>[]</literal> otherwise.</para>
53 </refsection>
54 <refsection>
55 <title>Examples</title>
56 <programlisting role="example"><![CDATA[
57ta=[1 1 2 2 2 3 4 5 5 7 8 8 9 10 10 10 11 12 13 13 13 14 15 16 16 17 17];
58he=[2 10 3 5 7 4 2 4 6 8 6 9 7 7 11 15 12 13 9 10 14 11 16 1 17 14 15];
59g=make_graph('foo',1,17,ta,he);
60g.nodes.graphics.x=[283 163 63 57 164 164 273 271 339 384 504 513 439 623 631 757 642]/2;
61g.nodes.graphics.y=[59 133 223 318 227 319 221 324 432 141 209 319 428 443 187 151 301]/2;
62show_graph(g);
63ns=[1 10 15 16 17 14 11 12 13 9 7 8 6];
64g.nodes.graphics.colors(2,ns)=color('red');
65show_graph(g);
66
67p=nodes_2_path(ns,g);
68g.edges.graphics.foreground(p)=color('red');
69show_graph(g);
70 ]]></programlisting>
71 </refsection>
72 <refsection>
73 <title>See Also</title>
74 <simplelist type="inline">
75 <member>
76 <link linkend="path_2_nodes">path_2_nodes</link>
77 </member>
78 </simplelist>
79 </refsection>
80</refentry>
diff --git a/scilab/modules/metanet/help/en_US/nodes_data_structure.xml b/scilab/modules/metanet/help/en_US/nodes_data_structure.xml
deleted file mode 100644
index 598064b..0000000
--- a/scilab/modules/metanet/help/en_US/nodes_data_structure.xml
+++ /dev/null
@@ -1,85 +0,0 @@
1<?xml version="1.0" encoding="UTF-8"?>
2<!--
3 * Scilab ( http://www.scilab.org/ ) - This file is part of Scilab
4 * Copyright (C) 2008 - INRIA
5 *
6 * This file must be used under the terms of the CeCILL.
7 * This source file is licensed as described in the file COPYING, which
8 * you should have received as part of this distribution. The terms
9 * are also available at
10 * http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
11 *
12 -->
13<refentry xmlns="http://docbook.org/ns/docbook" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:svg="http://www.w3.org/2000/svg" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:db="http://docbook.org/ns/docbook" version="5.0-subset Scilab" xml:lang="en" xml:id="nodes_data_structure">
14 <info>
15 <pubdate>$LastChangedDate$</pubdate>
16 </info>
17 <refnamediv>
18 <refname>nodes_data_structure</refname>
19 <refpurpose> description of the data structure representing the nodes of a graph </refpurpose>
20 </refnamediv>
21 <refsection>
22 <title>Description</title>
23 <para> A nodes data structure is represented by a Scilab <literal>mlist</literal> with type <literal>nodes</literal>
24 and 3 fields:</para>
25 <itemizedlist>
26 <listitem>
27 <para><literal>number</literal> the number of nodes.</para>
28 </listitem>
29 <listitem>
30 <para><literal>graphics</literal>&gt; A Scilab <literal>mlist</literal> data structure of type <literal>ngraphic</literal>
31 which stores the information relative to nodes display (see <link linkend="ngraphic_data_structure">ngraphic_data_structure</link></para>
32 </listitem>
33 <listitem>
34 <para><literal>data</literal> A Scilab <literal>mlist</literal> data structure of type
35 <literal>nodedata</literal>. which stores the data associated with
36 nodes. By defaut this data structure is empty. User can add
37 its own fields using the <literal>add_node_data</literal>
38 function..</para>
39 <para> For a given field the associated data should be a
40 row vector or a matrix. In the matrix case a column is
41 associated to a node.</para>
42 </listitem>
43 </itemizedlist>
44 </refsection>
45 <refsection>
46 <title>Examples</title>
47 <programlisting role="example"><![CDATA[
48//create a simple graph
49ta=[1 1 2 7 8 9 10 10 10 10 11 12 13 13];
50he=[2 10 7 8 9 7 7 11 13 13 12 13 9 10];
51g=make_graph('simple',1,13,ta,he);
52g.nodes.graphics.x=[40,33,29,63,146,233,75,42,114,156,237,260,159];
53g.nodes.graphics.y=[7,61,103,142,145,143,43,120,145,18,36,107,107];
54show_graph(g,'new')
55
56g.nodes.number
57g.nodes
58
59g=add_node_data(g,'Size',rand(1,g.nodes.number,'u'));
60g.nodes(1:10)
61
62nodedatafields(g)
63 ]]></programlisting>
64 </refsection>
65 <refsection>
66 <title>See Also</title>
67 <simplelist type="inline">
68 <member>
69 <link linkend="graph_data_structure">graph_data_structure</link>
70 </member>
71 <member>
72 <link linkend="add_node">add_node</link>
73 </member>
74 <member>
75 <link linkend="delete_nodes">delete_nodes</link>
76 </member>
77 <member>
78 <link linkend="nodedatafields">nodedatafields</link>
79 </member>
80 <member>
81 <link linkend="add_node_data">add_node_data</link>
82 </member>
83 </simplelist>
84 </refsection>
85</refentry>
diff --git a/scilab/modules/metanet/help/en_US/nodes_degrees.xml b/scilab/modules/metanet/help/en_US/nodes_degrees.xml
deleted file mode 100644
index 4bec090..0000000
--- a/scilab/modules/metanet/help/en_US/nodes_degrees.xml
+++ /dev/null
@@ -1,81 +0,0 @@
1<?xml version="1.0" encoding="UTF-8"?>
2<!--
3 * Scilab ( http://www.scilab.org/ ) - This file is part of Scilab
4 * Copyright (C) 2008 - INRIA
5 *
6 * This file must be used under the terms of the CeCILL.
7 * This source file is licensed as described in the file COPYING, which
8 * you should have received as part of this distribution. The terms
9 * are also available at
10 * http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
11 *
12 -->
13<refentry xmlns="http://docbook.org/ns/docbook" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:svg="http://www.w3.org/2000/svg" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:db="http://docbook.org/ns/docbook" version="5.0-subset Scilab" xml:lang="en" xml:id="nodes_degrees">
14 <info>
15 <pubdate>$LastChangedDate$</pubdate>
16 </info>
17 <refnamediv>
18 <refname>nodes_degrees</refname>
19 <refpurpose> degrees of the nodes of a graph</refpurpose>
20 </refnamediv>
21 <refsynopsisdiv>
22 <title>Calling Sequence</title>
23 <synopsis>[outdegree,indegree] = graph_degree(g)</synopsis>
24 </refsynopsisdiv>
25 <refsection>
26 <title>Parameters</title>
27 <variablelist>
28 <varlistentry>
29 <term>g</term>
30 <listitem>
31 <para>a <link linkend="graph_data_structure">graph_data_structure</link>.</para>
32 </listitem>
33 </varlistentry>
34 <varlistentry>
35 <term>outdegree</term>
36 <listitem>
37 <para>row vector of the out degrees of the nodes</para>
38 </listitem>
39 </varlistentry>
40 <varlistentry>
41 <term>indegree</term>
42 <listitem>
43 <para>row vector of the in degrees of the nodes</para>
44 </listitem>
45 </varlistentry>
46 </variablelist>
47 </refsection>
48 <refsection>
49 <title>Description</title>
50 <para><literal>nodes_degrees</literal> returns the 2 row vectors of the out and in degrees of the
51 nodes of the graph <literal>g</literal>.</para>
52 </refsection>
53 <refsection>
54 <title>Examples</title>
55 <programlisting role="example"><![CDATA[
56ta=[1 1 2 2 2 3 4 5 5 7 8 8 9 10 10 10 11 12 13 13 13 14 15 16 16 17 17];
57he=[2 10 3 5 7 4 2 4 6 8 6 9 7 7 11 15 12 13 9 10 14 11 16 1 17 14 15];
58g=make_graph('foo',1,17,ta,he);
59g.nodes.graphics.x=[283 163 63 57 164 164 273 271 339 384 504 513 439 623 631 757 642]/2;
60g.nodes.graphics.y=[59 133 223 318 227 319 221 324 432 141 209 319 428 443 187 151 301]/2;
61show_graph(g);
62[outdegree,indegree]=nodes_degrees(g)
63
64g=add_node_data(g,'outdegree',outdegree)
65g.nodes.graphics.display='outdegree';
66show_graph(g);
67
68g=add_node_data(g,'indegree',indegree)
69g.nodes.graphics.display='indegree';
70show_graph(g,'new');
71 ]]></programlisting>
72 </refsection>
73 <refsection>
74 <title>See Also</title>
75 <simplelist type="inline">
76 <member>
77 <link linkend="adj_lists">adj_lists</link>
78 </member>
79 </simplelist>
80 </refsection>
81</refentry>
diff --git a/scilab/modules/metanet/help/en_US/path_2_nodes.xml b/scilab/modules/metanet/help/en_US/path_2_nodes.xml
deleted file mode 100644
index b743f04..0000000
--- a/scilab/modules/metanet/help/en_US/path_2_nodes.xml
+++ /dev/null
@@ -1,78 +0,0 @@
1<?xml version="1.0" encoding="UTF-8"?>
2<!--
3 * Scilab ( http://www.scilab.org/ ) - This file is part of Scilab
4 * Copyright (C) 2008 - INRIA
5 *
6 * This file must be used under the terms of the CeCILL.
7 * This source file is licensed as described in the file COPYING, which
8 * you should have received as part of this distribution. The terms
9 * are also available at
10 * http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
11 *
12 -->
13<refentry xmlns="http://docbook.org/ns/docbook" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:svg="http://www.w3.org/2000/svg" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:db="http://docbook.org/ns/docbook" version="5.0-subset Scilab" xml:lang="en" xml:id="path_2_nodes">
14 <info>
15 <pubdate>$LastChangedDate$</pubdate>
16 </info>
17 <refnamediv>
18 <refname>path_2_nodes</refname>
19 <refpurpose> set of nodes from a path</refpurpose>
20 </refnamediv>
21 <refsynopsisdiv>
22 <title>Calling Sequence</title>
23 <synopsis>ns = path_2_nodes(p,g)</synopsis>
24 </refsynopsisdiv>
25 <refsection>
26 <title>Parameters</title>
27 <variablelist>
28 <varlistentry>
29 <term>p</term>
30 <listitem>
31 <para>row vector of integer numbers of the arcs of the path</para>
32 </listitem>
33 </varlistentry>
34 <varlistentry>
35 <term>g</term>
36 <listitem>
37 <para> a <link linkend="graph_data_structure">graph_data_structure</link>.</para>
38 </listitem>
39 </varlistentry>
40 <varlistentry>
41 <term>ns</term>
42 <listitem>
43 <para>row vector of integer numbers of the set of nodes</para>
44 </listitem>
45 </varlistentry>
46 </variablelist>
47 </refsection>
48 <refsection>
49 <title>Description</title>
50 <para><literal>path_2_nodes</literal> returns the set of nodes <literal>ns</literal> corresponding to the
51 path <literal>p</literal> given by its arc numbers ; if <literal>p</literal> is not a path, the
52 empty vector <literal>[]</literal> is returned.</para>
53 </refsection>
54 <refsection>
55 <title>Examples</title>
56 <programlisting role="example"><![CDATA[
57ta=[1 1 2 2 2 3 4 5 5 7 8 8 9 10 10 10 11 12 13 13 13 14 15 16 16 17 17];
58he=[2 10 3 5 7 4 2 4 6 8 6 9 7 7 11 15 12 13 9 10 14 11 16 1 17 14 15];
59g=make_graph('foo',1,17,ta,he);
60g.nodes.graphics.x=[283 163 63 57 164 164 273 271 339 384 504 513 439 623 631 757 642]/2;
61g.nodes.graphics.y=[59 133 223 318 227 319 221 324 432 141 209 319 428 443 187 151 301]/2;
62p=[2 16 23 25 26 22 17 18 19 13 10 11];
63g.edges.graphics.foreground(p)=color('red')
64show_graph(g);
65
66ns=path_2_nodes(p,g);
67hilite_nodes(ns);
68 ]]></programlisting>
69 </refsection>
70 <refsection>
71 <title>See Also</title>
72 <simplelist type="inline">
73 <member>
74 <link linkend="nodes_2_path">nodes_2_path</link>
75 </member>
76 </simplelist>
77 </refsection>
78</refentry>
diff --git a/scilab/modules/metanet/help/en_US/perfect_match.xml b/scilab/modules/metanet/help/en_US/perfect_match.xml
deleted file mode 100644
index 3f37321..0000000
--- a/scilab/modules/metanet/help/en_US/perfect_match.xml
+++ /dev/null
@@ -1,97 +0,0 @@
1<?xml version="1.0" encoding="UTF-8"?>
2<!--
3 * Scilab ( http://www.scilab.org/ ) - This file is part of Scilab
4 * Copyright (C) 2008 - INRIA
5 *
6 * This file must be used under the terms of the CeCILL.
7 * This source file is licensed as described in the file COPYING, which
8 * you should have received as part of this distribution. The terms
9 * are also available at
10 * http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
11 *
12 -->
13<refentry xmlns="http://docbook.org/ns/docbook" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:svg="http://www.w3.org/2000/svg" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:db="http://docbook.org/ns/docbook" version="5.0-subset Scilab" xml:lang="en" xml:id="perfect_match">
14 <info>
15 <pubdate>$LastChangedDate$</pubdate>
16 </info>
17 <refnamediv>
18 <refname>perfect_match</refname>
19 <refpurpose> min-cost perfect matching</refpurpose>
20 </refnamediv>
21 <refsynopsisdiv>
22 <title>Calling Sequence</title>
23 <synopsis>[cst,nmatch] = perfect_match(g,arcost)</synopsis>
24 </refsynopsisdiv>
25 <refsection>
26 <title>Parameters</title>
27 <variablelist>
28 <varlistentry>
29 <term>g</term>
30 <listitem>
31 <para>:a undirected graph (see <link linkend="graph_data_structure">graph_data_structure</link>).</para>
32 </listitem>
33 </varlistentry>
34 <varlistentry>
35 <term>arcost</term>
36 <listitem>
37 <para>integer row vector</para>
38 </listitem>
39 </varlistentry>
40 <varlistentry>
41 <term>cst</term>
42 <listitem>
43 <para>integer</para>
44 </listitem>
45 </varlistentry>
46 <varlistentry>
47 <term>nmatch</term>
48 <listitem>
49 <para>integer row vector</para>
50 </listitem>
51 </varlistentry>
52 </variablelist>
53 </refsection>
54 <refsection>
55 <title>Description</title>
56 <para><literal>perfect_match</literal> finds a perfect min-cost matching for the graph <literal>g</literal>.
57 <literal>g</literal> must be an undirected graph with an even number of nodes.
58 <literal>arcost</literal> is the vector of the (integer) costs of the arcs (the dimension
59 of <literal>arcost</literal> is twice the number of edges of the graph).
60 The output is the vector <literal>nmatch</literal> of the perfect matching and the
61 corresponding cost <literal>cst</literal>.</para>
62 </refsection>
63 <refsection>
64 <title>Examples</title>
65 <programlisting role="example"><![CDATA[
66ta=[27 27 3 12 11 12 27 26 26 25 25 24 23 23 21 22 21 20 19 18 18];
67ta=[ta 16 15 15 14 12 9 10 6 9 17 8 17 10 20 11 23 23 12 18 28];
68he=[ 1 2 2 4 5 11 13 1 25 22 24 22 22 19 13 13 14 16 16 9 16];
69he=[he 10 10 11 12 2 6 5 5 7 8 7 9 6 11 4 18 13 3 28 17];
70n=28;
71g=make_graph('foo',0,n,ta,he);
72xx=[46 120 207 286 366 453 543 544 473 387 300 206 136 250 346 408];
73g.nodes.graphics.x=[xx 527 443 306 326 196 139 264 55 58 46 118 513];
74yy=[36 34 37 40 38 40 35 102 102 98 93 96 167 172 101 179];
75g.nodes.graphics.y=[yy 198 252 183 148 172 256 259 258 167 109 104 253];
76show_graph(g);
77
78m2=2*size(ta,2);
79arcost=round(100.*rand(1,m2));
80[cst,nmatch] = perfect_match(g,arcost);
81v=index_from_tail_head(g,1:n,nmatch)
82hilite_edges(v);
83 ]]></programlisting>
84 </refsection>
85 <refsection>
86 <title>See Also</title>
87 <simplelist type="inline">
88 <member>
89 <link linkend="best_match">best_match</link>
90 </member>
91 </simplelist>
92 </refsection>
93 <refsection>
94 <title>Bibliography</title>
95 <para> U. Derigs "Solving non-bipartite matching problems via shortest path techniques" Annals of operations research 7, 1988. </para>
96 </refsection>
97</refentry>
diff --git a/scilab/modules/metanet/help/en_US/pipe_network.xml b/scilab/modules/metanet/help/en_US/pipe_network.xml
deleted file mode 100644
index 4b7b376..0000000
--- a/scilab/modules/metanet/help/en_US/pipe_network.xml
+++ /dev/null
@@ -1,99 +0,0 @@
1<?xml version="1.0" encoding="UTF-8"?>
2<!--
3 * Scilab ( http://www.scilab.org/ ) - This file is part of Scilab
4 * Copyright (C) 2008 - INRIA
5 *
6 * This file must be used under the terms of the CeCILL.
7 * This source file is licensed as described in the file COPYING, which
8 * you should have received as part of this distribution. The terms
9 * are also available at
10 * http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
11 *
12 -->
13<refentry xmlns="http://docbook.org/ns/docbook" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:svg="http://www.w3.org/2000/svg" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:db="http://docbook.org/ns/docbook" version="5.0-subset Scilab" xml:lang="en" xml:id="pipe_network">
14 <info>
15 <pubdate>$LastChangedDate$</pubdate>
16 </info>
17 <refnamediv>
18 <refname>pipe_network</refname>
19 <refpurpose> solves the pipe network problem</refpurpose>
20 </refnamediv>
21 <refsynopsisdiv>
22 <title>Calling Sequence</title>
23 <synopsis>[x,pi] = pipe_network(g)</synopsis>
24 </refsynopsisdiv>
25 <refsection>
26 <title>Parameters</title>
27 <variablelist>
28 <varlistentry>
29 <term>g</term>
30 <listitem>
31 <para> a <link linkend="graph_data_structure">graph_data_structure</link>.</para>
32 </listitem>
33 </varlistentry>
34 <varlistentry>
35 <term>x</term>
36 <listitem>
37 <para>row vector of the value of the flow on the arcs</para>
38 </listitem>
39 </varlistentry>
40 <varlistentry>
41 <term>pi</term>
42 <listitem>
43 <para>row vector of the value of the potential on the nodes</para>
44 </listitem>
45 </varlistentry>
46 </variablelist>
47 </refsection>
48 <refsection>
49 <title>Description</title>
50 <para>
51 <literal>pipe_network</literal> returns the value of the flows
52 and of the potentials for the pipe network problem: flow problem
53 with two Kirchhoff laws. The graph must be directed. The
54 problem must be feasible (the sum of the node demands must be
55 equal to 0).
56 </para>
57 <para>
58 The resistances on the arcs are given by the field
59 <literal>g.edges.data.weight</literal> of the graph data
60 structure. If this field is not present it may be added and set
61 using the function <link
62 linkend="add_edge_data">add_edge_data</link>. The values of the resistances must be strictly positive.
63 </para>
64 <para>
65 THe demands on nodes are given by the field
66 <literal>g.nodes.data.demand</literal> of the graph data
67 structure. If this field is not present it may be added and set
68 using the function <link
69 linkend="add_node_data">add_node_data</link>. The sum of the node demands must be
70 equal to 0.
71 </para>
72 <para>
73 The problem is solved by using sparse matrices LU factorization.
74 </para>
75 </refsection>
76 <refsection>
77 <title>Examples</title>
78 <programlisting role="example"><![CDATA[
79ta=[1 1 2 2 3 3 4 4 5 5 5 5 6 6 6 7 7 15 15 15 15 15 15 15 8 9 10 11 12 13 14];
80he=[10 13 9 14 8 11 9 11 8 10 12 13 8 9 12 8 11 1 2 3 4 5 6 7 16 16 16 16 16 16 16];
81g=make_graph('foo',1,16,ta,he);
82g.nodes.graphics.x=[42 615 231 505 145 312 403 233 506 34 400 312 142 614 260 257];
83g.nodes.graphics.y=[143 145 154 154 147 152 157 270 273 279 269 273 273 274 50 376];
84g.nodes.graphics.diam(15:16)=30;
85g=add_node_data(g,'demand',[0 0 0 0 0 0 0 0 0 0 0 0 0 0 -100 100]);
86w = [1 3 2 6 4 7 8 1 2 2 2 4 7 8 9 2 3 5 7 3 2 5 8 2 5 8 6 4 3 5 6];
87g=add_edge_data(g,'weight',w);
88g.nodes.graphics.display='demand';
89g.edges.graphics.display='weight';
90show_graph(g);
91
92[x,pi] = pipe_network(g)
93g=add_edge_data(g,'flow',round(100*x)/100);
94g.edges.graphics.display='flow';
95
96show_graph(g);
97 ]]></programlisting>
98 </refsection>
99</refentry>
diff --git a/scilab/modules/metanet/help/en_US/plot_graph.xml b/scilab/modules/metanet/help/en_US/plot_graph.xml
deleted file mode 100644
index 7e881ef..0000000
--- a/scilab/modules/metanet/help/en_US/plot_graph.xml
+++ /dev/null
@@ -1,125 +0,0 @@
1<?xml version="1.0" encoding="UTF-8"?>
2<!--
3 * Scilab ( http://www.scilab.org/ ) - This file is part of Scilab
4 * Copyright (C) 2008 - INRIA
5 *
6 * This file must be used under the terms of the CeCILL.
7 * This source file is licensed as described in the file COPYING, which
8 * you should have received as part of this distribution. The terms
9 * are also available at
10 * http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
11 *
12 -->
13<refentry xmlns="http://docbook.org/ns/docbook" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:svg="http://www.w3.org/2000/svg" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:db="http://docbook.org/ns/docbook" version="5.0-subset Scilab" xml:lang="en" xml:id="plot_graph">
14 <info>
15 <pubdate>$LastChangedDate$</pubdate>
16 </info>
17 <refnamediv>
18 <refname>plot_graph</refname>
19 <refpurpose> general plot of a graph (obsolete)</refpurpose>
20 </refnamediv>
21 <refsynopsisdiv>
22 <title>Calling Sequence</title>
23 <synopsis>plot_graph(g,[rep,rep1])</synopsis>
24 </refsynopsisdiv>
25 <refsection>
26 <title>Parameters</title>
27 <variablelist>
28 <varlistentry>
29 <term>g</term>
30 <listitem>
31 <para>a <link linkend="graph_data_structure">graph_data_structure</link>.</para>
32 </listitem>
33 </varlistentry>
34 <varlistentry>
35 <term>rep</term>
36 <listitem>
37 <para>row vector of 13 values for the parameters of the plot</para>
38 </listitem>
39 </varlistentry>
40 <varlistentry>
41 <term>rep1</term>
42 <listitem>
43 <para>row vector of 4 values defining the plotting rectangle</para>
44 </listitem>
45 </varlistentry>
46 </variablelist>
47 </refsection>
48 <refsection>
49 <title>Description</title>
50 <para> This function is osolete, use show_graph instead</para>
51 <para><literal>plot_graph</literal> plots graph <literal>g</literal> in a Scilab graphical window.
52 The optional arguments <literal>rep</literal> and <literal>rep1</literal> define the parameters
53 of the plot. If there are not given, a dialog box for the definition
54 of these parameters is opened.</para>
55 <para><literal>rep</literal> must be a row vector with 13 integer numbers which must be 1 or 2.
56 The meaning of the values of <literal>rep</literal> are:</para>
57 <para>
58 Frame definition: 1 = Automatic
59 2 = Given (see below)</para>
60 <para>
61 Plotting arrows: 1 = yes, 2 = no</para>
62 <para>
63 Plotting sink and source nodes: 1 = yes, 2 = no</para>
64 <para>
65 Plotting node names: 1 = yes, 2 = no</para>
66 <para>
67 Plotting node labels: 1 = yes, 2 = no</para>
68 <para>
69 Plotting arc names : 1 = yes, 2 = no</para>
70 <para>
71 Plotting arc labels: 1 = yes, 2 = no</para>
72 <para>
73 Plotting node demand: 1 = yes, 2 = no</para>
74 <para>
75 Plotting edge length: 1 = yes, 2 = no</para>
76 <para>
77 Plotting edge cost: 1 = yes, 2 = no</para>
78 <para>
79 Plotting edge min cap: 1 = yes, 2 = no</para>
80 <para>
81 Plotting edge max cap: 1 = yes, 2 = no</para>
82 <para>
83 Plotting edge weight: 1 = yes, 2 = no</para>
84 <para>
85 If <literal>rep(1)</literal> is 2, the frame definition must be given by
86 <literal>rep1</literal>. Otherwise, <literal>rep1</literal>can be omitted.
87 <literal>rep1</literal> must be a row vector <literal>[orx,ory,w,h]</literal> giving respectively the coordinates of the upper-left point, the width and the height of the
88 plotting rectangle.</para>
89 </refsection>
90 <refsection>
91 <title>Examples</title>
92 <programlisting role="example"><![CDATA[
93// simple graph with different choices for the plot
94ta=[2 2 1 1 2 4 3 3 4];
95he=[2 2 3 2 3 2 1 2 1];
96g=make_graph('foo',1,4,ta,he);
97g.nodes.graphics.type=[1 1 1 2];
98g.nodes.graphics.name=string([1:4]);
99g.nodes.graphics.x=[73 737 381 391];
100g.nodes.graphics.y=[283 337 458 142];
101g.nodes.graphics.colors(1,:)=[3 3 3 11];
102g.nodes.graphics.diam=[30 30 30 60];
103g.edges.graphics.foreground=[10 0 2 6 11 11 0 0 11];
104rep=[2 2 1 1 2 2 2 2 2 2 2 2 2];
105rep1=[0 0 850 500];
106clf(); plot_graph(g,rep,rep1);
107
108rep=[2 1 1 1 2 2 2 2 2 2 2 2 2];
109clf(); plot_graph(g,rep,rep1);
110// plotting using dialogs
111clf(); plot_graph(g);
112xset("thickness",4);
113clf();
114plot_graph(g);
115 ]]></programlisting>
116 </refsection>
117 <refsection>
118 <title>See Also</title>
119 <simplelist type="inline">
120 <member>
121 <link linkend="show_graph">show_graph</link>
122 </member>
123 </simplelist>
124 </refsection>
125</refentry>
diff --git a/scilab/modules/metanet/help/en_US/predecessors.xml b/scilab/modules/metanet/help/en_US/predecessors.xml
deleted file mode 100644
index 74fb7ae..0000000
--- a/scilab/modules/metanet/help/en_US/predecessors.xml
+++ /dev/null
@@ -1,79 +0,0 @@
1<?xml version="1.0" encoding="UTF-8"?>
2<!--
3 * Scilab ( http://www.scilab.org/ ) - This file is part of Scilab
4 * Copyright (C) 2008 - INRIA
5 *
6 * This file must be used under the terms of the CeCILL.
7 * This source file is licensed as described in the file COPYING, which
8 * you should have received as part of this distribution. The terms
9 * are also available at
10 * http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
11 *
12 -->
13<refentry xmlns="http://docbook.org/ns/docbook" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:svg="http://www.w3.org/2000/svg" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:db="http://docbook.org/ns/docbook" version="5.0-subset Scilab" xml:lang="en" xml:id="predecessors">
14 <info>
15 <pubdate>$LastChangedDate$</pubdate>
16 </info>
17 <refnamediv>
18 <refname>predecessors</refname>
19 <refpurpose> tail nodes of incoming arcs of a node</refpurpose>
20 </refnamediv>
21 <refsynopsisdiv>
22 <title>Calling Sequence</title>
23 <synopsis>a = predecessors(i,g)</synopsis>
24 </refsynopsisdiv>
25 <refsection>
26 <title>Parameters</title>
27 <variablelist>
28 <varlistentry>
29 <term>i</term>
30 <listitem>
31 <para>integer</para>
32 </listitem>
33 </varlistentry>
34 <varlistentry>
35 <term>g</term>
36 <listitem>
37 <para>a <link linkend="graph_data_structure">graph_data_structure</link>.</para>
38 </listitem>
39 </varlistentry>
40 <varlistentry>
41 <term>a</term>
42 <listitem>
43 <para>row vector of integers</para>
44 </listitem>
45 </varlistentry>
46 </variablelist>
47 </refsection>
48 <refsection>
49 <title>Description</title>
50 <para><literal>predecessors</literal> returns the row vector of the numbers of the tail nodes of
51 the incoming arcs to node <literal>i</literal> for a directed graph <literal>g</literal> .</para>
52 </refsection>
53 <refsection>
54 <title>Examples</title>
55 <programlisting role="example"><![CDATA[
56ta=[1 6 2 4 7 5 6 8 4 3 5 1];
57he=[2 1 3 6 4 8 8 7 2 7 3 5];
58g=make_graph('foo',1,8,ta,he);
59g.nodes.graphics.x=[285 284 335 160 405 189 118 45];
60g.nodes.graphics.y=[266 179 83 176 368 252 64 309];
61g.nodes.graphics.colors(2,8)=color('red');
62
63show_graph(g);
64a=predecessors(8,g)
65hilite_nodes(a);
66 ]]></programlisting>
67 </refsection>
68 <refsection>
69 <title>See Also</title>
70 <simplelist type="inline">
71 <member>
72 <link linkend="neighbors">neighbors</link>
73 </member>
74 <member>
75 <link linkend="successors">successors</link>
76 </member>
77 </simplelist>
78 </refsection>
79</refentry>
diff --git a/scilab/modules/metanet/help/en_US/qassign.xml b/scilab/modules/metanet/help/en_US/qassign.xml
deleted file mode 100644
index 4420aa7..0000000
--- a/scilab/modules/metanet/help/en_US/qassign.xml
+++ /dev/null
@@ -1,91 +0,0 @@
1<?xml version="1.0" encoding="UTF-8"?>
2<!--
3 * Scilab ( http://www.scilab.org/ ) - This file is part of Scilab
4 * Copyright (C) 2008 - INRIA
5 *
6 * This file must be used under the terms of the CeCILL.
7 * This source file is licensed as described in the file COPYING, which
8 * you should have received as part of this distribution. The terms
9 * are also available at
10 * http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
11 *
12 -->
13<refentry xmlns="http://docbook.org/ns/docbook" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:svg="http://www.w3.org/2000/svg" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:db="http://docbook.org/ns/docbook" version="5.0-subset Scilab" xml:lang="en" xml:id="qassign">
14 <info>
15 <pubdate>$LastChangedDate$</pubdate>
16 </info>
17 <refnamediv>
18 <refname>qassign</refname>
19 <refpurpose> solves a quadratic assignment problem</refpurpose>
20 </refnamediv>
21 <refsynopsisdiv>
22 <title>Calling Sequence</title>
23 <synopsis>[crit,order] = qassign(c,f,d)</synopsis>
24 </refsynopsisdiv>
25 <refsection>
26 <title>Parameters</title>
27 <variablelist>
28 <varlistentry>
29 <term>c</term>
30 <listitem>
31 <para>real matrix</para>
32 </listitem>
33 </varlistentry>
34 <varlistentry>
35 <term>f</term>
36 <listitem>
37 <para>real matrix</para>
38 </listitem>
39 </varlistentry>
40 <varlistentry>
41 <term>d</term>
42 <listitem>
43 <para>real matrix</para>
44 </listitem>
45 </varlistentry>
46 <varlistentry>
47 <term>crit</term>
48 <listitem>
49 <para>real scalar</para>
50 </listitem>
51 </varlistentry>
52 <varlistentry>
53 <term>order</term>
54 <listitem>
55 <para>integer row vector</para>
56 </listitem>
57 </varlistentry>
58 </variablelist>
59 </refsection>
60 <refsection>
61 <title>Description</title>
62 <para><literal>qassign</literal> solves the quadratic assignment problem i.e.
63 minimize the global criterium:
64 <literal> crit = e(1)+...+e(n) </literal>
65 where
66 <literal> e(i) = c(i,l(i))+ fd(i) </literal>
67 where
68 <literal> fd(i) = f(i,1)*d(l(i),l(1))+...+f(i,n)*d(l(i),l(n)) </literal></para>
69 <para><literal>c</literal>, <literal>f</literal> and <literal>d</literal> are n x n real arrays; their diagonal entries
70 are zero.</para>
71 </refsection>
72 <refsection>
73 <title>Examples</title>
74 <programlisting role="example"><![CDATA[
75n=15;
76d=100*rand(15,15);
77d=d-diag(diag(d));
78c=zeros(n,n);f=c;
79f(2:n,1)=ones(1:n-1)';
80[crit,order]=qassign(c,f,d)
81 ]]></programlisting>
82 </refsection>
83 <refsection>
84 <title>See Also</title>
85 <simplelist type="inline">
86 <member>
87 <link linkend="knapsack">knapsack</link>
88 </member>
89 </simplelist>
90 </refsection>
91</refentry>
diff --git a/scilab/modules/metanet/help/en_US/salesman.xml b/scilab/modules/metanet/help/en_US/salesman.xml
deleted file mode 100644
index c921538..0000000
--- a/scilab/modules/metanet/help/en_US/salesman.xml
+++ /dev/null
@@ -1,83 +0,0 @@
1<?xml version="1.0" encoding="UTF-8"?>
2<!--
3 * Scilab ( http://www.scilab.org/ ) - This file is part of Scilab
4 * Copyright (C) 2008 - INRIA
5 *
6 * This file must be used under the terms of the CeCILL.
7 * This source file is licensed as described in the file COPYING, which
8 * you should have received as part of this distribution. The terms
9 * are also available at
10 * http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
11 *
12 -->
13<refentry xmlns="http://docbook.org/ns/docbook" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:svg="http://www.w3.org/2000/svg" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:db="http://docbook.org/ns/docbook" version="5.0-subset Scilab" xml:lang="en" xml:id="salesman">
14 <info>
15 <pubdate>$LastChangedDate$</pubdate>
16 </info>
17 <refnamediv>
18 <refname>salesman</refname>
19 <refpurpose> solves the travelling salesman problem</refpurpose>
20 </refnamediv>
21 <refsynopsisdiv>
22 <title>Calling Sequence</title>
23 <synopsis>cir = salesman(g,[nstac])</synopsis>
24 </refsynopsisdiv>
25 <refsection>
26 <title>Parameters</title>
27 <variablelist>
28 <varlistentry>
29 <term>g</term>
30 <listitem>
31 <para>a <link linkend="graph_data_structure">graph_data_structure</link>.</para>
32 </listitem>
33 </varlistentry>
34 <varlistentry>
35 <term>nstac</term>
36 <listitem>
37 <para>integer</para>
38 </listitem>
39 </varlistentry>
40 <varlistentry>
41 <term>cir</term>
42 <listitem>
43 <para>integer row vector</para>
44 </listitem>
45 </varlistentry>
46 </variablelist>
47 </refsection>
48 <refsection>
49 <title>Description</title>
50 <para><literal>salesman</literal> solves the travelling salesman problem. <literal>g</literal> is a directed
51 graph; <literal>nstac</literal> is an optional integer which is a given bound for
52 the allowed memory size for solving this problem. Its value is 100*n*n by
53 default where n is the number of nodes.</para>
54 </refsection>
55 <refsection>
56 <title>Examples</title>
57 <programlisting role="example"><![CDATA[
58ta=[2 1 3 2 2 4 4 5 6 7 8 8 9 10 10 10 10 11 12 13 13 14 15 16 16 17 17];
59he=[1 10 2 5 7 3 2 4 5 8 6 9 7 7 11 13 15 12 13 9 14 11 16 1 17 14 15];
60g=make_graph('foo',0,17,ta,he);
61g.nodes.graphics.x=[283 163 63 57 164 164 273 271 339 384 504 513 439 623 631 757 642]*0.7;
62g.nodes.graphics.y=[59 133 223 318 227 319 221 324 432 141 209 319 428 443 187 151 301]*0.7;
63show_graph(g);
64
65//replace edges by a couple of arcs
66g1=make_graph('foo1',1,17,[ta he],[he ta]);
67m=arc_number(g1);
68g1=add_edge_data(g1,'length',5+round(30*rand(1,m)));
69cir = salesman(g1);
70
71ii=find(cir > edge_number(g));
72if(ii <> []) then cir(ii)=cir(ii)-edge_number(g);end;
73hilite_edges(cir);
74 ]]></programlisting>
75 </refsection>
76 <refsection>
77 <title>Bibliography</title>
78 <para>Applegate, D.; Bixby, R.; Chvatal, V.; and Cook, W. "Solving Traveling Salesman Problems." <ulink url="http://www.tsp.gatech.edu/">http://www.tsp.gatech.edu/</ulink>.</para>
79 <para>Hoffman, P. The Man Who Loved Only Numbers: The Story of Paul Erdos and the Search for Mathematical Truth. New York: Hyperion, pp. 168-169, 1998.</para>
80 <para>Kruskal, J. B. "On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem." Proc. Amer. Math. Soc. 7, 48-50, 1956.</para>
81 <para>Lawler, E.; Lenstra, J.; Rinnooy Kan, A.; and Shmoys, D. The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. New York: Wiley, 1985. </para>
82 </refsection>
83</refentry>
diff --git a/scilab/modules/metanet/help/en_US/save_graph.xml b/scilab/modules/metanet/help/en_US/save_graph.xml
deleted file mode 100644
index 7026e6d..0000000
--- a/scilab/modules/metanet/help/en_US/save_graph.xml
+++ /dev/null
@@ -1,86 +0,0 @@
1<?xml version="1.0" encoding="UTF-8"?>
2<!--
3 * Scilab ( http://www.scilab.org/ ) - This file is part of Scilab
4 * Copyright (C) 2008 - INRIA
5 *
6 * This file must be used under the terms of the CeCILL.
7 * This source file is licensed as described in the file COPYING, which
8 * you should have received as part of this distribution. The terms
9 * are also available at
10 * http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
11 *
12 -->
13<refentry xmlns="http://docbook.org/ns/docbook" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:svg="http://www.w3.org/2000/svg" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:db="http://docbook.org/ns/docbook" version="5.0-subset Scilab" xml:lang="en" xml:id="save_graph">
14 <info>
15 <pubdate>$LastChangedDate$</pubdate>
16 </info>
17 <refnamediv>
18 <refname>save_graph</refname>
19 <refpurpose>saves a graph in a file</refpurpose>
20 </refnamediv>
21 <refsynopsisdiv>
22 <title>Calling Sequence</title>
23 <synopsis>save_graph(g,path)</synopsis>
24 </refsynopsisdiv>
25 <refsection>
26 <title>Parameters</title>
27 <variablelist>
28 <varlistentry>
29 <term>g</term>
30 <listitem>
31 <para>a <link linkend="graph_data_structure">graph_data_structure</link>.</para>
32 </listitem>
33 </varlistentry>
34 <varlistentry>
35 <term>path</term>
36 <listitem>
37 <para>string, the path of the graph to save</para>
38 </listitem>
39 </varlistentry>
40 </variablelist>
41 </refsection>
42 <refsection>
43 <title>Description</title>
44 <para><literal>save_graph</literal> saves the graph <literal>g</literal> in a graph file.
45 <literal>path</literal> is the name of the graph file where the graph will be saved.
46 <literal>path</literal> can be the name or the pathname of the file; if the
47 <literal>"graph"</literal> extension is missing in <literal>path</literal>, it is assumed.
48 If <literal>path</literal> is the name of a directory, the name of the graph is
49 used as the name of the file.</para>
50 <para> Standard <link linkend="save">save</link> function may also be used to save a
51 graph in a file. In this case take care to save only a single
52 graph data structure in the file (without any other variable) if
53 you want to reload this file with <link linkend="load_graph">load_graph</link> or
54 <link linkend="edit_graph">edit_graph</link>.</para>
55 </refsection>
56 <refsection>
57 <title>Examples</title>
58 <programlisting role="example"><![CDATA[
59g=load_graph(metanet_module_path()+'/demos/mesh100.graph');
60show_graph(g);
61save_graph(g,'mymesh100.graph');
62g=load_graph('mymesh100.graph');
63show_graph(g,'new');
64 ]]></programlisting>
65 </refsection>
66 <refsection>
67 <title>See Also</title>
68 <simplelist type="inline">
69 <member>
70 <link linkend="load_graph">load_graph</link>
71 </member>
72 <member>
73 <link linkend="edit_graph">edit_graph</link>
74 </member>
75 <member>
76 <link linkend="graph_data_structure">graph_data_structure</link>
77 </member>
78 <member>
79 <link linkend="save">save</link>
80 </member>
81 <member>
82 <link linkend="load">load</link>
83 </member>
84 </simplelist>
85 </refsection>
86</refentry>
diff --git a/scilab/modules/metanet/help/en_US/set_nodes_id.xml b/scilab/modules/metanet/help/en_US/set_nodes_id.xml
deleted file mode 100644
index 362ac1d..0000000
--- a/scilab/modules/metanet/help/en_US/set_nodes_id.xml
+++ /dev/null
@@ -1,100 +0,0 @@
1<?xml version="1.0" encoding="UTF-8"?>
2<!--
3 * Scilab ( http://www.scilab.org/ ) - This file is part of Scilab
4 * Copyright (C) 2008 - INRIA
5 *
6 * This file must be used under the terms of the CeCILL.
7 * This source file is licensed as described in the file COPYING, which
8 * you should have received as part of this distribution. The terms
9 * are also available at
10 * http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
11 *
12 -->
13<refentry xmlns="http://docbook.org/ns/docbook" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:svg="http://www.w3.org/2000/svg" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:db="http://docbook.org/ns/docbook" version="5.0-subset Scilab" xml:lang="en" xml:id="set_nodes_id">
14 <info>
15 <pubdate>$LastChangedDate$</pubdate>
16 </info>
17 <refnamediv>
18 <refname>set_nodes_id</refname>
19 <refpurpose>displays labels near selected nodes in a graph display.</refpurpose>
20 </refnamediv>
21 <refsynopsisdiv>
22 <title>Calling Sequence</title>
23 <synopsis>set_nodes_id(nodes,Id,loc)</synopsis>
24 </refsynopsisdiv>
25 <refsection>
26 <title>Parameters</title>
27 <variablelist>
28 <varlistentry>
29 <term>nodes</term>
30 <listitem>
31 <para> vector of integers, the selected nodes
32 </para>
33 </listitem>
34 </varlistentry>
35 <varlistentry>
36 <term>Id</term>
37 <listitem>
38 <para>vector of strings: the labels to be drawn with the nodes;
39 </para>
40 </listitem>
41 </varlistentry>
42 <varlistentry>
43 <term>loc</term>
44 <listitem>
45 <para>string, with possible values : <literal>"center"</literal>,
46 <literal>"right"</literal>, <literal>"left"</literal>, <literal>"up"</literal>
47 and <literal>"downn</literal>. Specify where the labels will be
48 drawn.
49 </para>
50 </listitem>
51 </varlistentry>
52 </variablelist>
53 </refsection>
54 <refsection>
55 <title>Description</title>
56 <para><literal>set_nodes_id(nodes,Id,loc) </literal> allows to display
57 labels near selected nodes of the displayed graph in the current
58 <literal>edit_graph</literal> window (see <link linkend="netwindow">netwindow</link>). Note that these
59 labels are not stored in the corresponding graph data
60 structure.</para>
61 </refsection>
62 <refsection>
63 <title>Examples</title>
64 <programlisting role="example"><![CDATA[
65 ta=[1 1 2 2 2 3 4 5 5 7 8 8 9 10 10 10 11 12 13 13 13 14 15 16 16 17 17];
66he=[2 10 3 5 7 4 2 4 6 8 6 9 7 7 11 15 12 13 9 10 14 11 16 1 17 14 15];
67g=make_graph('foo',1,17,ta,he);
68g.nodes.graphics.x=[283 163 63 57 164 164 273 271 339 384 504 513 439 623 631 757 642]/2;
69g.nodes.graphics.y=[59 133 223 318 227 319 221 324 432 141 209 319 428 443 187 151 301]/2;
70show_graph(g);
71set_nodes_id(1:3,'n'+string(1:3),'right')
72 ]]></programlisting>
73 </refsection>
74 <refsection>
75 <title>See Also</title>
76 <simplelist type="inline">
77 <member>
78 <link linkend="edit_graph">edit_graph</link>
79 </member>
80 <member>
81 <link linkend="hilite_nodes">hilite_nodes</link>
82 </member>
83 <member>
84 <link linkend="unhilite_nodes">unhilite_nodes</link>
85 </member>
86 <member>
87 <link linkend="ngraphic_data_structure">ngraphic_data_structure</link>
88 </member>
89 <member>
90 <link linkend="show_nodes">show_nodes</link>
91 </member>
92 <member>
93 <link linkend="netwindow">netwindow</link>
94 </member>
95 <member>
96 <link linkend="netwindows">netwindows</link>
97 </member>
98 </simplelist>
99 </refsection>
100</refentry>
diff --git a/scilab/modules/metanet/help/en_US/shortest_path.xml b/scilab/modules/metanet/help/en_US/shortest_path.xml
deleted file mode 100644
index 2936748..0000000
--- a/scilab/modules/metanet/help/en_US/shortest_path.xml
+++ /dev/null
@@ -1,112 +0,0 @@
1<?xml version="1.0" encoding="UTF-8"?>
2<!--
3 * Scilab ( http://www.scilab.org/ ) - This file is part of Scilab
4 * Copyright (C) 2008 - INRIA
5 *
6 * This file must be used under the terms of the CeCILL.
7 * This source file is licensed as described in the file COPYING, which
8 * you should have received as part of this distribution. The terms
9 * are also available at
10 * http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
11 *
12 -->
13<refentry xmlns="http://docbook.org/ns/docbook" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:svg="http://www.w3.org/2000/svg" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:db="http://docbook.org/ns/docbook" version="5.0-subset Scilab" xml:lang="en" xml:id="shortest_path">
14 <info>
15 <pubdate>$LastChangedDate$</pubdate>
16 </info>
17 <refnamediv>
18 <refname>shortest_path</refname>
19 <refpurpose>shortest path</refpurpose>
20 </refnamediv>
21 <refsynopsisdiv>
22 <title>Calling Sequence</title>
23 <synopsis>[p,lp] = shortest_path(i,j,g,[typ])</synopsis>
24 </refsynopsisdiv>
25 <refsection>
26 <title>Parameters</title>
27 <variablelist>
28 <varlistentry>
29 <term>i</term>
30 <listitem>
31 <para>integer, number of start node</para>
32 </listitem>
33 </varlistentry>
34 <varlistentry>
35 <term>j</term>
36 <listitem>
37 <para>integer, number of end node</para>
38 </listitem>
39 </varlistentry>
40 <varlistentry>
41 <term>g</term>
42 <listitem>
43 <para>a <link linkend="graph_data_structure">graph_data_structure</link>.</para>
44 </listitem>
45 </varlistentry>
46 <varlistentry>
47 <term>typ</term>
48 <listitem>
49 <para>string, type of shortest path</para>
50 </listitem>
51 </varlistentry>
52 <varlistentry>
53 <term>p</term>
54 <listitem>
55 <para>row vector of integer numbers of the arcs of the shortest path
56 if it exists</para>
57 </listitem>
58 </varlistentry>
59 <varlistentry>
60 <term>lp</term>
61 <listitem>
62 <para>length of shortest path</para>
63 </listitem>
64 </varlistentry>
65 </variablelist>
66 </refsection>
67 <refsection>
68 <title>Description</title>
69 <para><literal>shortest_path</literal> returns the shortest path <literal>p</literal>
70 from node <literal>i</literal> to node <literal>j</literal> if it exists, and the
71 empty vector <literal>[]</literal> otherwise. The optional argument
72 <literal>typ</literal> is a string which defines the type of shortest path,
73 'arc' for the shortest path with respect to the number of arcs and
74 'length' for the shortest path with respect to the length of the edges
75 <literal>edge_length</literal>.</para>
76 <para>For the shortest path with respect to the length of the edges, the
77 lengths are given by the element <literal>edge_length</literal> of the graph
78 list. If its value is not given (empty vector <literal>[]</literal>), it is
79 assumed to be equal to 0 on each edge. Lengths can be positive, equal to 0
80 or negative.</para>
81 <para>When a shortest path exists, <literal>lp</literal> is the length of this
82 path.</para>
83 </refsection>
84 <refsection>
85 <title>Examples</title>
86 <programlisting role="example"><![CDATA[
87rand('uniform');
88
89ta=[1 1 2 2 2 3 4 4 5 6 6 6 7 7 7 8 9 10 12 12 13 13 13 14 15 14 9 11 10];
90he=[2 6 3 4 5 1 3 5 1 7 10 11 5 8 9 5 8 11 10 11 9 11 15 13 14 4 6 9 1];
91g=make_graph('foo',1,15,ta,he);
92g.nodes.graphics.x=[194 191 106 194 296 305 305 418 422 432 552 550 549 416 548]*0.7;
93g.nodes.graphics.y=[56 181 276 278 276 103 174 281 177 86 175 90 290 397 399]*0.7;
94g=add_edge_data(g,'length',int(20*rand(ta)));
95g.edges.graphics.display='length';
96show_graph(g);
97[p,lp]=shortest_path(13,1,g,'length');p
98hilite_edges(p);
99 ]]></programlisting>
100 </refsection>
101 <refsection>
102 <title>See Also</title>
103 <simplelist type="inline">
104 <member>
105 <link linkend="find_path">find_path</link>
106 </member>
107 <member>
108 <link linkend="nodes_2_path">nodes_2_path</link>
109 </member>
110 </simplelist>
111 </refsection>
112</refentry>
diff --git a/scilab/modules/metanet/help/en_US/show_arcs.xml b/scilab/modules/metanet/help/en_US/show_arcs.xml
deleted file mode 100644
index 939359e..0000000
--- a/scilab/modules/metanet/help/en_US/show_arcs.xml
+++ /dev/null
@@ -1,85 +0,0 @@
1<?xml version="1.0" encoding="UTF-8"?>
2<!--
3 * Scilab ( http://www.scilab.org/ ) - This file is part of Scilab
4 * Copyright (C) 2008 - INRIA
5 *
6 * This file must be used under the terms of the CeCILL.
7 * This source file is licensed as described in the file COPYING, which
8 * you should have received as part of this distribution. The terms
9 * are also available at
10 * http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
11 *
12 -->
13<refentry xmlns="http://docbook.org/ns/docbook" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:svg="http://www.w3.org/2000/svg" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:db="http://docbook.org/ns/docbook" version="5.0-subset Scilab" xml:lang="en" xml:id="show_arcs">
14 <info>
15 <pubdate>$LastChangedDate$</pubdate>
16 </info>
17 <refnamediv>
18 <refname>show_arcs</refname>
19 <refpurpose> highlights a set of arcs</refpurpose>
20 </refnamediv>
21 <refsynopsisdiv>
22 <title>Calling Sequence</title>
23 <synopsis>show_arcs(p,[sup])</synopsis>
24 </refsynopsisdiv>
25 <refsection>
26 <title>Parameters</title>
27 <variablelist>
28 <varlistentry>
29 <term>p</term>
30 <listitem>
31 <para>row vector of arc numbers (directed graph) or edge numbers (undirected graph)</para>
32 </listitem>
33 </varlistentry>
34 <varlistentry>
35 <term>sup</term>
36 <listitem>
37 <para>string, superposition flag</para>
38 </listitem>
39 </varlistentry>
40 </variablelist>
41 </refsection>
42 <refsection>
43 <title>Description</title>
44 <para><literal>show_arcs</literal> highlights the set of arcs or edges <literal>p</literal> of the
45 displayed graph in the current edit_graph window.
46 If the optional argument <literal>sup</literal> is equal to the string 'sup',
47 the highlighting is superposed on the previous one.</para>
48 </refsection>
49 <refsection>
50 <title>Examples</title>
51 <programlisting role="example"><![CDATA[
52ta=[1 1 2 2 2 3 4 5 5 7 8 8 9 10 10 10 11 12 13 13 13 14 15 16 16 17 17];
53he=[2 10 3 5 7 4 2 4 6 8 6 9 7 7 11 15 12 13 9 10 14 11 16 1 17 14 15];
54g=make_graph('foo',1,17,ta,he);
55g.nodes.graphics.x=[283 163 63 57 164 164 273 271 339 384 504 513 439 623 631 757 642]/2;
56g.nodes.graphics.y=[59 133 223 318 227 319 221 324 432 141 209 319 428 443 187 151 301]/2;
57show_graph(g);
58t=min_weight_tree(1,g); g1=g; ma=edge_number(g1);
59edgecolor=1*ones(1,ma); g1.edges.graphics.foreground=edgecolor;
60edgewidth=1*ones(1,ma); edgewidth(t)=4*ones(t); g1.edges.graphics.width=edgewidth;
61for i=8:12,
62 edgecolor(t)=i*ones(t); g1.edges.graphics.foreground=edgecolor;
63 xpause(3d5); show_graph(g1);
64 show_arcs(t);
65end;
66 ]]></programlisting>
67 </refsection>
68 <refsection>
69 <title>See Also</title>
70 <simplelist type="inline">
71 <member>
72 <link linkend="edit_graph">edit_graph</link>
73 </member>
74 <member>
75 <link linkend="show_nodes">show_nodes</link>
76 </member>
77 <member>
78 <link linkend="netwindow">netwindow</link>
79 </member>
80 <member>
81 <link linkend="netwindows">netwindows</link>
82 </member>
83 </simplelist>
84 </refsection>
85</refentry>
diff --git a/scilab/modules/metanet/help/en_US/show_edges.xml b/scilab/modules/metanet/help/en_US/show_edges.xml
deleted file mode 100644
index 6e4d7f8..0000000
--- a/scilab/modules/metanet/help/en_US/show_edges.xml
+++ /dev/null
@@ -1,105 +0,0 @@
1<?xml version="1.0" encoding="UTF-8"?>
2<!--
3 * Scilab ( http://www.scilab.org/ ) - This file is part of Scilab
4 * Copyright (C) 2008 - INRIA
5 *
6 * This file must be used under the terms of the CeCILL.
7 * This source file is licensed as described in the file COPYING, which
8 * you should have received as part of this distribution. The terms
9 * are also available at
10 * http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
11 *
12 -->
13<refentry xmlns="http://docbook.org/ns/docbook" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:svg="http://www.w3.org/2000/svg" xmlns:ns3="http://www.w3.org/1999/xhtml" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:db="http://docbook.org/ns/docbook" version="5.0-subset Scilab" xml:id="show_edges" xml:lang="en">
14 <info>
15 <pubdate>$LastChangedDate$</pubdate>
16 </info>
17 <refnamediv>
18 <refname>show_edges</refname>
19 <refpurpose>highlights a set of edges</refpurpose>
20 </refnamediv>
21 <refsynopsisdiv>
22 <title>Calling Sequence</title>
23 <synopsis>show_edges(p [,sup])
24show_edges(p ,sup=value)
25show_edges(p ,leg=value)
26show_edges(p ,sup=value,leg=value)</synopsis>
27 </refsynopsisdiv>
28 <refsection>
29 <title>Parameters</title>
30 <variablelist>
31 <varlistentry>
32 <term>p</term>
33 <listitem>
34 <para>vector of arc numbers (directed graph) or edge numbers
35 (undirected graph)</para>
36 </listitem>
37 </varlistentry>
38 <varlistentry>
39 <term>sup</term>
40 <listitem>
41 <para>string, superposition flag. The default value is
42 <literal>'no'</literal>.</para>
43 </listitem>
44 </varlistentry>
45 <varlistentry>
46 <term>leg</term>
47 <listitem>
48 <para>string, data field to be displayed. The default value is
49 <literal>'nothing'</literal>.</para>
50 </listitem>
51 </varlistentry>
52 </variablelist>
53 </refsection>
54 <refsection>
55 <title>Description</title>
56 <para><literal>show_edges</literal> highlights the set of arcs or edges
57 <literal>p</literal> of the displayed graph in the current <link linkend="edit_graph">edit_graph</link> window (see <link linkend="netwindow">netwindow</link>). If the optional argument
58 <literal>sup</literal> is equal to the string 'sup', the highlighting is
59 superposed on the previous one.</para>
60 <para>If leg is equal to <literal>'number'</literal> the edge numbers are
61 also drawn.</para>
62 <para>If leg is equal to <literal>'name'</literal> the edge names are also
63 drawn.</para>
64 <para>If leg is equal to one of the edges data fields
65 <literal>'name'</literal> the corresponding values are also drawn.</para>
66 </refsection>
67 <refsection>
68 <title>Examples</title>
69 <programlisting role="example"><![CDATA[
70ta=[1 1 2 2 2 3 4 5 5 7 8 8 9 10 10 10 11 12 13 13 13 14 15 16 16 17 17];
71he=[2 10 3 5 7 4 2 4 6 8 6 9 7 7 11 15 12 13 9 10 14 11 16 1 17 14 15];
72g=make_graph('foo',1,17,ta,he);
73g.nodes.graphics.x=[283 163 63 57 164 164 273 271 339 384 504 513 439 623 631 757 642]/2;
74g.nodes.graphics.y=[59 133 223 318 227 319 221 324 432 141 209 319 428 443 187 151 301]/2;
75show_graph(g);
76
77t=min_weight_tree(1,g);
78show_edges(t);
79show_edges(t,leg='number');
80 ]]></programlisting>
81 </refsection>
82 <refsection>
83 <title>See Also</title>
84 <simplelist type="inline">
85 <member>
86 <link linkend="edit_graph">edit_graph</link>
87 </member>
88 <member>
89 <link linkend="hilite_edges">hilite_edges</link>
90 </member>
91 <member>
92 <link linkend="unhilite_edges">unhilite_edges</link>
93 </member>
94 <member>
95 <link linkend="show_nodes">show_nodes</link>
96 </member>
97 <member>
98 <link linkend="netwindow">netwindow</link>
99 </member>
100 <member>
101 <link linkend="netwindows">netwindows</link>
102 </member>
103 </simplelist>
104 </refsection>
105</refentry>
diff --git a/scilab/modules/metanet/help/en_US/show_graph.xml b/scilab/modules/metanet/help/en_US/show_graph.xml
deleted file mode 100644
index 8808bad..0000000
--- a/scilab/modules/metanet/help/en_US/show_graph.xml
+++ /dev/null
@@ -1,107 +0,0 @@
1<?xml version="1.0" encoding="UTF-8"?>
2<!--
3 * Scilab ( http://www.scilab.org/ ) - This file is part of Scilab
4 * Copyright (C) 2008 - INRIA
5 *
6 * This file must be used under the terms of the CeCILL.
7 * This source file is licensed as described in the file COPYING, which
8 * you should have received as part of this distribution. The terms
9 * are also available at
10 * http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
11 *
12 -->
13<refentry xmlns="http://docbook.org/ns/docbook" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:svg="http://www.w3.org/2000/svg" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:db="http://docbook.org/ns/docbook" version="5.0-subset Scilab" xml:lang="en" xml:id="show_graph">
14 <info>
15 <pubdate>$LastChangedDate$</pubdate>
16 </info>
17 <refnamediv>
18 <refname>show_graph</refname>
19 <refpurpose> displays a graph</refpurpose>
20 </refnamediv>
21 <refsynopsisdiv>
22 <title>Calling Sequence</title>
23 <synopsis>nw = show_graph(g,[smode,scale])
24nw = show_graph(g,[scale,winsize])</synopsis>
25 </refsynopsisdiv>
26 <refsection>
27 <title>Parameters</title>
28 <variablelist>
29 <varlistentry>
30 <term>g</term>
31 <listitem>
32 <para>a <link linkend="graph_data_structure">graph_data_structure</link>.</para>
33 </listitem>
34 </varlistentry>
35 <varlistentry>
36 <term>smode</term>
37 <listitem>
38 <para>string, mode value</para>
39 </listitem>
40 </varlistentry>
41 <varlistentry>
42 <term>winsize</term>
43 <listitem>
44 <para>row vector defining the size of edit_graph window</para>
45 </listitem>
46 </varlistentry>
47 <varlistentry>
48 <term>scale</term>
49 <listitem>
50 <para>real value, scale factor</para>
51 </listitem>
52 </varlistentry>
53 <varlistentry>
54 <term>nw</term>
55 <listitem>
56 <para>integer</para>
57 </listitem>
58 </varlistentry>
59 </variablelist>
60 </refsection>
61 <refsection>
62 <title>Description</title>
63 <para><literal>show_graph</literal> displays the graph <literal>g</literal> in the current edit_graph window.
64 If there is no current edit_graph window, a edit_graph window is created.
65 The return value <literal>nw</literal> is the number of the edit_graph window where
66 the graph is displayed.</para>
67 <para>
68 If the optional argument <literal>smode</literal> is equal to the string 'rep' or is not
69 given and if there is already a graph displayed in the current edit_graph window,
70 the new graph is displayed instead.</para>
71 <para>
72 If the optional argument <literal>smode</literal> is equal to the string 'new', a new
73 edit_graph window is created. In this case, if the optional argument
74 <literal>winsize</literal> is given as a row vector <literal>[width height]</literal>, it is
75 the size in pixels of edit_graph window. The default is <literal>[600,400]</literal>.</para>
76 <para>
77 The optional argument <literal>scale</literal> is the value of the scale factor when
78 drawing the graph. The default value is 1.</para>
79 </refsection>
80 <refsection>
81 <title>Examples</title>
82 <programlisting role="example"><![CDATA[
83ta=[1 1 2 2 2 3 4 5 5 7 8 8 9 10 10 10 11 12 13 13 13 14 15 16 16 17 17];
84he=[2 10 3 5 7 4 2 4 6 8 6 9 7 7 11 15 12 13 9 10 14 11 16 1 17 14 15];
85g=make_graph('foo',1,17,ta,he);
86g.nodes.graphics.x=[283 163 63 57 164 164 273 271 339 384 504 513 439 623 631 757 642];
87g.nodes.graphics.y=[59 133 223 318 227 319 221 324 432 141 209 319 428 443 187 151 301];
88show_graph(g,2);
89show_graph(g,0.5);
90show_graph(g,1);
91 ]]></programlisting>
92 </refsection>
93 <refsection>
94 <title>See Also</title>
95 <simplelist type="inline">
96 <member>
97 <link linkend="edit_graph">edit_graph</link>
98 </member>
99 <member>
100 <link linkend="netwindow">netwindow</link>
101 </member>
102 <member>
103 <link linkend="netwindows">netwindows</link>
104 </member>
105 </simplelist>
106 </refsection>
107</refentry>
diff --git a/scilab/modules/metanet/help/en_US/show_nodes.xml b/scilab/modules/metanet/help/en_US/show_nodes.xml
deleted file mode 100644
index dce7957..0000000
--- a/scilab/modules/metanet/help/en_US/show_nodes.xml
+++ /dev/null
@@ -1,99 +0,0 @@
1<?xml version="1.0" encoding="UTF-8"?>
2<!--
3 * Scilab ( http://www.scilab.org/ ) - This file is part of Scilab
4 * Copyright (C) 2008 - INRIA
5 *
6 * This file must be used under the terms of the CeCILL.
7 * This source file is licensed as described in the file COPYING, which
8 * you should have received as part of this distribution. The terms
9 * are also available at
10 * http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
11 *
12 -->
13<refentry xmlns="http://docbook.org/ns/docbook" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:svg="http://www.w3.org/2000/svg" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:db="http://docbook.org/ns/docbook" version="5.0-subset Scilab" xml:lang="en" xml:id="show_nodes">
14 <info>
15 <pubdate>$LastChangedDate$</pubdate>
16 </info>
17 <refnamediv>
18 <refname>show_nodes</refname>
19 <refpurpose> highlights a set of nodes</refpurpose>
20 </refnamediv>
21 <refsynopsisdiv>
22 <title>Calling Sequence</title>
23 <synopsis>show_nodes(nodes [,sup])
24show_nodes(nodes ,sup=value)
25show_nodes(nodes ,leg=value)
26show_nodes(nodes ,sup=value,leg=value)</synopsis>
27 </refsynopsisdiv>
28 <refsection>
29 <title>Parameters</title>
30 <variablelist>
31 <varlistentry>
32 <term>nodes</term>
33 <listitem>
34 <para>row vector of node numbers</para>
35 </listitem>
36 </varlistentry>
37 <varlistentry>
38 <term>sup</term>
39 <listitem>
40 <para>string, superposition flag. The default value is <literal>'no'</literal>.</para>
41 </listitem>
42 </varlistentry>
43 <varlistentry>
44 <term>leg</term>
45 <listitem>
46 <para>string, data field to be displayed. The default value is <literal>'nothing'</literal>.</para>
47 </listitem>
48 </varlistentry>
49 </variablelist>
50 </refsection>
51 <refsection>
52 <title>Description</title>
53 <para><literal>show_nodes</literal> highlights the set of nodes
54 <literal>nodes</literal> of the displayed graph in the current
55 <literal>edit_graph</literal> window (see <link linkend="netwindow">netwindow</link>). If
56 the optional argument <literal>sup</literal> is equal to the string
57 'sup', the highlighting is superposed on the previous one.</para>
58 <para>If leg is equal to <literal>'number'</literal> the node numbers are also drawn.</para>
59 <para>If leg is equal to <literal>'name'</literal> the node names are also drawn.</para>
60 <para>If leg is equal to one of the node data fields the corresponding values are also drawn.</para>
61 </refsection>
62 <refsection>
63 <title>Examples</title>
64 <programlisting role="example"><![CDATA[
65ta=[1 1 2 2 2 3 4 5 5 7 8 8 9 10 10 10 11 12 13 13 13 14 15 16 16 17 17];
66he=[2 10 3 5 7 4 2 4 6 8 6 9 7 7 11 15 12 13 9 10 14 11 16 1 17 14 15];
67g=make_graph('foo',1,17,ta,he);
68g.nodes.graphics.x=[283 163 63 57 164 164 273 271 339 384 504 513 439 623 631 757 642]/2;
69g.nodes.graphics.y=[59 133 223 318 227 319 221 324 432 141 209 319 428 443 187 151 301]/2;
70show_graph(g);
71for i=2:3:g.nodes.number, show_nodes(i); end;
72for i=1:3:g.nodes.number, show_nodes(i,'sup'); end;
73show_nodes(1:3:g.nodes.number,leg='number')
74 ]]></programlisting>
75 </refsection>
76 <refsection>
77 <title>See Also</title>
78 <simplelist type="inline">
79 <member>
80 <link linkend="edit_graph">edit_graph</link>
81 </member>
82 <member>
83 <link linkend="hilite_nodes">hilite_nodes</link>
84 </member>
85 <member>
86 <link linkend="unhilite_nodes">unhilite_nodes</link>
87 </member>
88 <member>
89 <link linkend="show_arcs">show_arcs</link>
90 </member>
91 <member>
92 <link linkend="netwindow">netwindow</link>
93 </member>
94 <member>
95 <link linkend="netwindows">netwindows</link>
96 </member>
97 </simplelist>
98 </refsection>
99</refentry>
diff --git a/scilab/modules/metanet/help/en_US/split_edge.xml b/scilab/modules/metanet/help/en_US/split_edge.xml
deleted file mode 100644
index 0dd1cbb..0000000
--- a/scilab/modules/metanet/help/en_US/split_edge.xml
+++ /dev/null
@@ -1,104 +0,0 @@
1<?xml version="1.0" encoding="UTF-8"?>
2<!--
3 * Scilab ( http://www.scilab.org/ ) - This file is part of Scilab
4 * Copyright (C) 2008 - INRIA
5 *
6 * This file must be used under the terms of the CeCILL.
7 * This source file is licensed as described in the file COPYING, which
8 * you should have received as part of this distribution. The terms
9 * are also available at
10 * http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
11 *
12 -->
13<refentry xmlns="http://docbook.org/ns/docbook" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:svg="http://www.w3.org/2000/svg" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:db="http://docbook.org/ns/docbook" version="5.0-subset Scilab" xml:lang="en" xml:id="split_edge">
14 <info>
15 <pubdate>$LastChangedDate$</pubdate>
16 </info>
17 <refnamediv>
18 <refname>split_edge</refname>
19 <refpurpose> splits an edge by inserting a node</refpurpose>
20 </refnamediv>
21 <refsynopsisdiv>
22 <title>Calling Sequence</title>
23 <synopsis>g1 = split_edge(i,j,g,name)</synopsis>
24 </refsynopsisdiv>
25 <refsection>
26 <title>Parameters</title>
27 <variablelist>
28 <varlistentry>
29 <term>i</term>
30 <listitem>
31 <para>integer, number of start node of edge</para>
32 </listitem>
33 </varlistentry>
34 <varlistentry>
35 <term>j</term>
36 <listitem>
37 <para>integer, number of end node of edge</para>
38 </listitem>
39 </varlistentry>
40 <varlistentry>
41 <term>g</term>
42 <listitem>
43 <para>a <link linkend="graph_data_structure">graph_data_structure</link>.</para>
44 </listitem>
45 </varlistentry>
46 <varlistentry>
47 <term>name</term>
48 <listitem>
49 <para>optional name of the added node</para>
50 </listitem>
51 </varlistentry>
52 <varlistentry>
53 <term>g1</term>
54 <listitem>
55 <para>graph data structure of the new graph</para>
56 </listitem>
57 </varlistentry>
58 </variablelist>
59 </refsection>
60 <refsection>
61 <title>Description</title>
62 <para><literal>split_edge</literal> returns the graph <literal>g1</literal>, the edge from node
63 number <literal>i</literal> to node number <literal>j</literal> being splitted: a new node is created
64 and located at the middle point between the 2 previous nodes. This new node
65 is linked with the 2 nodes <literal>i</literal> and <literal>j</literal>.
66 If <literal>name</literal> is given, it is the name of the new node, otherwise the number
67 of nodes plus 1 is taken as the name of the new node.</para>
68 </refsection>
69 <refsection>
70 <title>Examples</title>
71 <programlisting role="example"><![CDATA[
72ta=[1 1 2 2 2 3 4 5 5 7 8 8 9 10 10 10 10 10 11 12 13 13 13 14 15 16 16 17 17];
73he=[2 10 3 5 7 4 2 4 6 8 6 9 7 7 11 13 13 15 12 13 9 10 14 11 16 1 17 14 15];
74g=make_graph('foo',1,17,ta,he);
75g.nodes.graphics.x=[283 163 63 57 164 164 273 271 339 384 504 513 439 623 631 757 642]/2;
76g.nodes.graphics.y=[59 133 223 318 227 319 221 324 432 141 209 319 428 443 187 151 301]/2;
77g.edges.graphics.foreground(index_from_tail_head(g,1,2))=5;
78g.nodes.graphics.display='number';
79show_graph(g);
80
81gt=split_edge(1,2,g);
82gt.nodes.graphics.colors(2,$)=color('red')
83gt.edges.graphics.foreground($-1:$)=color('red')
84show_graph(gt,'new');
85 ]]></programlisting>
86 </refsection>
87 <refsection>
88 <title>See Also</title>
89 <simplelist type="inline">
90 <member>
91 <link linkend="add_edge">add_edge</link>
92 </member>
93 <member>
94 <link linkend="add_node">add_node</link>
95 </member>
96 <member>
97 <link linkend="delete_arcs">delete_arcs</link>
98 </member>
99 <member>
100 <link linkend="delete_nodes">delete_nodes</link>
101 </member>
102 </simplelist>
103 </refsection>
104</refentry>
diff --git a/scilab/modules/metanet/help/en_US/strong_con_nodes.xml b/scilab/modules/metanet/help/en_US/strong_con_nodes.xml
deleted file mode 100644
index 2248a67..0000000
--- a/scilab/modules/metanet/help/en_US/strong_con_nodes.xml
+++ /dev/null
@@ -1,82 +0,0 @@
1<?xml version="1.0" encoding="UTF-8"?>
2<!--
3 * Scilab ( http://www.scilab.org/ ) - This file is part of Scilab
4 * Copyright (C) 2008 - INRIA
5 *
6 * This file must be used under the terms of the CeCILL.
7 * This source file is licensed as described in the file COPYING, which
8 * you should have received as part of this distribution. The terms
9 * are also available at
10 * http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
11 *
12 -->
13<refentry xmlns="http://docbook.org/ns/docbook" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:svg="http://www.w3.org/2000/svg" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:db="http://docbook.org/ns/docbook" version="5.0-subset Scilab" xml:lang="en" xml:id="strong_con_nodes">
14 <info>
15 <pubdate>$LastChangedDate$</pubdate>
16 </info>
17 <refnamediv>
18 <refname>strong_con_nodes</refname>
19 <refpurpose> set of nodes of a strong connected component</refpurpose>
20 </refnamediv>
21 <refsynopsisdiv>
22 <title>Calling Sequence</title>
23 <synopsis>ns = strong_con_nodes(i,g)</synopsis>
24 </refsynopsisdiv>
25 <refsection>
26 <title>Parameters</title>
27 <variablelist>
28 <varlistentry>
29 <term>i</term>
30 <listitem>
31 <para>integer, number of the strong connected component</para>
32 </listitem>
33 </varlistentry>
34 <varlistentry>
35 <term>g</term>
36 <listitem>
37 <para>a <link linkend="graph_data_structure">graph_data_structure</link>.</para>
38 </listitem>
39 </varlistentry>
40 <varlistentry>
41 <term>ns</term>
42 <listitem>
43 <para>row vector, node numbers of the strong connected component</para>
44 </listitem>
45 </varlistentry>
46 </variablelist>
47 </refsection>
48 <refsection>
49 <title>Description</title>
50 <para><literal>strong_con_nodes</literal> returns the row vector <literal>ns</literal> of the numbers of the
51 nodes which belong to the strong connected component number <literal>i</literal>.</para>
52 </refsection>
53 <refsection>
54 <title>Examples</title>
55 <programlisting role="example"><![CDATA[
56ta=[1 1 2 2 2 3 4 4 5 6 6 6 7 7 7 8 9 10 12 12 13 13 13 14 15];
57he=[2 6 3 4 5 1 3 5 1 7 10 11 5 8 9 5 8 11 10 11 9 11 15 13 14];
58g=make_graph('foo',1,15,ta,he);
59g.nodes.graphics.x=[197 191 106 194 296 305 305 418 422 432 552 550 549 416 548];
60g.nodes.graphics.y=[76 181 276 278 276 83 174 281 177 86 175 90 290 397 399];
61show_graph(g);
62
63ncomp=strong_con_nodes(3,g);
64g.nodes.graphics.colors(2,ncomp)=color('red');
65show_graph(g);
66 ]]></programlisting>
67 </refsection>
68 <refsection>
69 <title>See Also</title>
70 <simplelist type="inline">
71 <member>
72 <link linkend="connex">connex</link>
73 </member>
74 <member>
75 <link linkend="con_nodes">con_nodes</link>
76 </member>
77 <member>
78 <link linkend="strong_connex">strong_connex</link>
79 </member>
80 </simplelist>
81 </refsection>
82</refentry>
diff --git a/scilab/modules/metanet/help/en_US/strong_connex.xml b/scilab/modules/metanet/help/en_US/strong_connex.xml
deleted file mode 100644
index 491c565..0000000
--- a/scilab/modules/metanet/help/en_US/strong_connex.xml
+++ /dev/null
@@ -1,91 +0,0 @@
1<?xml version="1.0" encoding="UTF-8"?>
2<!--
3 * Scilab ( http://www.scilab.org/ ) - This file is part of Scilab
4 * Copyright (C) 2008 - INRIA
5 *
6 * This file must be used under the terms of the CeCILL.
7 * This source file is licensed as described in the file COPYING, which
8 * you should have received as part of this distribution. The terms
9 * are also available at
10 * http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
11 *
12 -->
13<refentry xmlns="http://docbook.org/ns/docbook" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:svg="http://www.w3.org/2000/svg" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:db="http://docbook.org/ns/docbook" version="5.0-subset Scilab" xml:lang="en" xml:id="strong_connex">
14 <info>
15 <pubdate>$LastChangedDate$</pubdate>
16 </info>
17 <refnamediv>
18 <refname>strong_connex</refname>
19 <refpurpose> strong connected components</refpurpose>
20 </refnamediv>
21 <refsynopsisdiv>
22 <title>Calling Sequence</title>
23 <synopsis>[nc,ncomp] = strong_connex(g)</synopsis>
24 </refsynopsisdiv>
25 <refsection>
26 <title>Parameters</title>
27 <variablelist>
28 <varlistentry>
29 <term>g</term>
30 <listitem>
31 <para> a <link linkend="graph_data_structure">graph_data_structure</link>.</para>
32 </listitem>
33 </varlistentry>
34 <varlistentry>
35 <term>nc</term>
36 <listitem>
37 <para>integer, number of strong connected components</para>
38 </listitem>
39 </varlistentry>
40 <varlistentry>
41 <term>ncomp</term>
42 <listitem>
43 <para>row vector of strong connected components</para>
44 </listitem>
45 </varlistentry>
46 </variablelist>
47 </refsection>
48 <refsection>
49 <title>Description</title>
50 <para><literal>strong_connex</literal> returns the number <literal>nc</literal>
51 of strong connected components for the graph <literal>g</literal> and a
52 row vector <literal>ncomp</literal> giving the number of the strong
53 connected component for each node. For instance, if
54 <literal>i</literal> is a node number, <literal>ncomp(i)</literal> is the
55 number of the strong connected component to which node
56 <literal>i</literal> belongs.</para>
57 </refsection>
58 <refsection>
59 <title>Examples</title>
60 <programlisting role="example"><![CDATA[
61ta=[1 1 2 2 2 3 4 4 5 6 6 6 7 7 7 8 9 10 12 12 13 13 13 14 15];
62he=[2 6 3 4 5 1 3 5 1 7 10 11 5 8 9 5 8 11 10 11 9 11 15 13 14];
63g=make_graph('foo',1,15,ta,he);
64g.nodes.graphics.x=[197 191 106 194 296 305 305 418 422 432 552 550 549 416 548];
65g.nodes.graphics.y=[76 181 276 278 276 83 174 281 177 86 175 90 290 397 399];
66show_graph(g);
67
68[nc,ncomp]=strong_connex(g);
69colors=[2 7 5 29 24 1];
70g=add_node_data(g,'component_number',ncomp)
71g.nodes.graphics.colors(1,:)=colors(ncomp);
72g.nodes.graphics.display='component_number';
73
74show_graph(g);
75 ]]></programlisting>
76 </refsection>
77 <refsection>
78 <title>See Also</title>
79 <simplelist type="inline">
80 <member>
81 <link linkend="connex">connex</link>
82 </member>
83 <member>
84 <link linkend="con_nodes">con_nodes</link>
85 </member>
86 <member>
87 <link linkend="strong_con_nodes">strong_con_nodes</link>
88 </member>
89 </simplelist>
90 </refsection>
91</refentry>
diff --git a/scilab/modules/metanet/help/en_US/successors.xml b/scilab/modules/metanet/help/en_US/successors.xml
deleted file mode 100644
index 7aa9be3..0000000
--- a/scilab/modules/metanet/help/en_US/successors.xml
+++ /dev/null
@@ -1,78 +0,0 @@
1<?xml version="1.0" encoding="UTF-8"?>
2<!--
3 * Scilab ( http://www.scilab.org/ ) - This file is part of Scilab
4 * Copyright (C) 2008 - INRIA
5 *
6 * This file must be used under the terms of the CeCILL.
7 * This source file is licensed as described in the file COPYING, which
8 * you should have received as part of this distribution. The terms
9 * are also available at
10 * http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
11 *
12 -->
13<refentry xmlns="http://docbook.org/ns/docbook" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:svg="http://www.w3.org/2000/svg" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:db="http://docbook.org/ns/docbook" version="5.0-subset Scilab" xml:lang="en" xml:id="successors">
14 <info>
15 <pubdate>$LastChangedDate$</pubdate>
16 </info>
17 <refnamediv>
18 <refname>successors</refname>
19 <refpurpose> head nodes of outgoing arcs of a node</refpurpose>
20 </refnamediv>
21 <refsynopsisdiv>
22 <title>Calling Sequence</title>
23 <synopsis>a = successors(i,g)</synopsis>
24 </refsynopsisdiv>
25 <refsection>
26 <title>Parameters</title>
27 <variablelist>
28 <varlistentry>
29 <term>i</term>
30 <listitem>
31 <para>integer</para>
32 </listitem>
33 </varlistentry>
34 <varlistentry>
35 <term>g</term>
36 <listitem>
37 <para> a <link linkend="graph_data_structure">graph_data_structure</link>.</para>
38 </listitem>
39 </varlistentry>
40 <varlistentry>
41 <term>a</term>
42 <listitem>
43 <para>row vector of integers</para>
44 </listitem>
45 </varlistentry>
46 </variablelist>
47 </refsection>
48 <refsection>
49 <title>Description</title>
50 <para><literal>successors</literal> returns the row vector of the numbers of the head nodes of
51 the outgoing arcs from node i for a directed graph <literal>g</literal> .</para>
52 </refsection>
53 <refsection>
54 <title>Examples</title>
55 <programlisting role="example"><![CDATA[
56ta=[1 6 2 4 7 5 6 8 4 3 5 1];
57he=[2 1 3 6 4 8 8 7 2 7 3 5];
58g=make_graph('foo',1,8,ta,he);
59g.nodes.graphics.x=[285 284 335 160 405 189 118 45];
60g.nodes.graphics.y=[266 179 83 176 368 252 64 309];
61g.nodes.graphics.colors(2,6)=5;
62show_graph(g);
63a=successors(6,g)
64hilite_nodes(a);
65 ]]></programlisting>
66 </refsection>
67 <refsection>
68 <title>See Also</title>
69 <simplelist type="inline">
70 <member>
71 <link linkend="neighbors">neighbors</link>
72 </member>
73 <member>
74 <link linkend="predecessors">predecessors</link>
75 </member>
76 </simplelist>
77 </refsection>
78</refentry>
diff --git a/scilab/modules/metanet/help/en_US/trans_closure.xml b/scilab/modules/metanet/help/en_US/trans_closure.xml
deleted file mode 100644
index 6f7156e..0000000
--- a/scilab/modules/metanet/help/en_US/trans_closure.xml
+++ /dev/null
@@ -1,76 +0,0 @@
1<?xml version="1.0" encoding="UTF-8"?>
2<!--
3 * Scilab ( http://www.scilab.org/ ) - This file is part of Scilab
4 * Copyright (C) 2008 - INRIA
5 *
6 * This file must be used under the terms of the CeCILL.
7 * This source file is licensed as described in the file COPYING, which
8 * you should have received as part of this distribution. The terms
9 * are also available at
10 * http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
11 *
12 -->
13<refentry xmlns="http://docbook.org/ns/docbook" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:svg="http://www.w3.org/2000/svg" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:db="http://docbook.org/ns/docbook" version="5.0-subset Scilab" xml:lang="en" xml:id="trans_closure">
14 <info>
15 <pubdate>$LastChangedDate$</pubdate>
16 </info>
17 <refnamediv>
18 <refname>trans_closure</refname>
19 <refpurpose> transitive closure</refpurpose>
20 </refnamediv>
21 <refsynopsisdiv>
22 <title>Calling Sequence</title>
23 <synopsis>g1 = trans_closure(g)</synopsis>
24 </refsynopsisdiv>
25 <refsection>
26 <title>Parameters</title>
27 <variablelist>
28 <varlistentry>
29 <term>g</term>
30 <listitem>
31 <para>a <link linkend="graph_data_structure">graph_data_structure</link>.</para>
32 </listitem>
33 </varlistentry>
34 <varlistentry>
35 <term>g1</term>
36 <listitem>
37 <para>a graph data structure</para>
38 </listitem>
39 </varlistentry>
40 </variablelist>
41 </refsection>
42 <refsection>
43 <title>Description</title>
44 <para>The transitive closure of a graph is a graph which contains an
45 edge from node u to node v whenever there is a directed path from
46 u to v. </para>
47 <para><literal>trans_closure</literal> returns as a new graph
48 <literal>g1</literal> the transitive closure of the graph
49 <literal>g</literal>. This graph must be directed and connected. If
50 <literal>&lt;name&gt;</literal> if the name of graph <literal>g</literal>,
51 <literal>&lt;name&gt;_trans_closure</literal> is the name of the
52 transitive closure.</para>
53 </refsection>
54 <refsection>
55 <title>Examples</title>
56 <programlisting role="example"><![CDATA[
57ta=[2 3 3 5 3 4 4 5 8];
58he=[1 2 4 2 6 6 7 7 4];
59g=make_graph('foo',1,8,ta,he);
60g.nodes.graphics.x=[129 200 283 281 128 366 122 333];
61g.nodes.graphics.y=[61 125 129 189 173 135 236 249];
62show_graph(g);
63g1=trans_closure(g);
64
65vv=1*ones(ta); aa=sparse([ta' he'],vv');
66ta1=g1.edges.tail; he1=g1.edges.head;
67ww=1*ones(ta1); bb=sparse([ta1' he1'],ww');
68dif=bb-aa; lim=size(ta1); edgecolor=0*ones(ta1);
69for i=1:lim(2)
70 if dif(ta1(i),he1(i))==1 then edgecolor(i)=11; end;
71end;
72g1.edges.graphics.foreground=edgecolor;
73show_graph(g1);
74 ]]></programlisting>
75 </refsection>
76</refentry>
diff --git a/scilab/modules/metanet/help/en_US/update_graph.xml b/scilab/modules/metanet/help/en_US/update_graph.xml
deleted file mode 100644
index a43b4ae..0000000
--- a/scilab/modules/metanet/help/en_US/update_graph.xml
+++ /dev/null
@@ -1,60 +0,0 @@
1<?xml version="1.0" encoding="UTF-8"?>
2<!--
3 * Scilab ( http://www.scilab.org/ ) - This file is part of Scilab
4 * Copyright (C) 2008 - INRIA
5 *
6 * This file must be used under the terms of the CeCILL.
7 * This source file is licensed as described in the file COPYING, which
8 * you should have received as part of this distribution. The terms
9 * are also available at
10 * http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
11 *
12 -->
13<refentry xmlns="http://docbook.org/ns/docbook" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:svg="http://www.w3.org/2000/svg" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:db="http://docbook.org/ns/docbook" version="5.0-subset Scilab" xml:lang="en" xml:id="update_graph">
14 <info>
15 <pubdate>$LastChangedDate$</pubdate>
16 </info>
17 <refnamediv>
18 <refname>update_graph</refname>
19 <refpurpose> converts an old graph data structure to the current one.</refpurpose>
20 </refnamediv>
21 <refsynopsisdiv>
22 <title>Calling Sequence</title>
23 <synopsis>Gnew = update_graph(G)</synopsis>
24 </refsynopsisdiv>
25 <refsection>
26 <title>Parameters</title>
27 <variablelist>
28 <varlistentry>
29 <term>G</term>
30 <listitem>
31 <para>Scilab-4.x graph data structure.
32 </para>
33 </listitem>
34 </varlistentry>
35 <varlistentry>
36 <term>Gnew</term>
37 <listitem>
38 <para>new graph data structure (see <link linkend="graph_data_structure">graph_data_structure</link>).
39 </para>
40 </listitem>
41 </varlistentry>
42 </variablelist>
43 </refsection>
44 <refsection>
45 <title>Description</title>
46 <para>Converts a Scilab-4.x graph data structure to the new one.</para>
47 <para> In the future this function will be used to adapt graph data structures according to their versions.</para>
48 </refsection>
49 <refsection>
50 <title>See Also</title>
51 <simplelist type="inline">
52 <member>
53 <link linkend="graph_data_structure">graph_data_structure</link>
54 </member>
55 <member>
56 <link linkend="graphlist">graph-list</link>
57 </member>
58 </simplelist>
59 </refsection>
60</refentry>
diff --git a/scilab/modules/metanet/help/fr_FR/add_node.xml b/scilab/modules/metanet/help/fr_FR/add_node.xml
deleted file mode 100644
index 6d82f22..0000000
--- a/scilab/modules/metanet/help/fr_FR/add_node.xml
+++ /dev/null
@@ -1,104 +0,0 @@
1<?xml version="1.0" encoding="UTF-8"?>
2<!--
3 * Scilab ( http://www.scilab.org/ ) - This file is part of Scilab
4 * Copyright (C) 2008 - INRIA
5 *
6 * This file must be used under the terms of the CeCILL.
7 * This source file is licensed as described in the file COPYING, which
8 * you should have received as part of this distribution. The terms
9 * are also available at
10 * http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
11 *
12 -->
13<refentry xmlns="http://docbook.org/ns/docbook" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:svg="http://www.w3.org/2000/svg" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:db="http://docbook.org/ns/docbook" version="5.0-subset Scilab" xml:lang="fr" xml:id="add_node">
14 <info>
15 <pubdate>$LastChangedDate$</pubdate>
16 </info>
17 <refnamediv>
18 <refname>add_node</refname>
19 <refpurpose> ajoute un sommet déconnecté à un graphe </refpurpose>
20 </refnamediv>
21 <refsynopsisdiv>
22 <title>Séquence d'appel</title>
23 <synopsis>g1 = add_node(g,[xy,name])</synopsis>
24 </refsynopsisdiv>
25 <refsection>
26 <title>Paramètres</title>
27 <variablelist>
28 <varlistentry>
29 <term>g </term>
30 <listitem>
31 <para>graphe (liste)
32</para>
33 </listitem>
34 </varlistentry>
35 <varlistentry>
36 <term>xy </term>
37 <listitem>
38 <para>vecteur ligne optionnel des coordonnées du nouveau sommet
39</para>
40 </listitem>
41 </varlistentry>
42 <varlistentry>
43 <term>name </term>
44 <listitem>
45 <para>nom optionnel du nouveau sommet
46</para>
47 </listitem>
48 </varlistentry>
49 <varlistentry>
50 <term>g1 </term>
51 <listitem>
52 <para>nouveau graphe (liste)
53</para>
54 </listitem>
55 </varlistentry>
56 </variablelist>
57 </refsection>
58 <refsection>
59 <title>Description</title>
60 <para><literal>add_node</literal> ajoute un sommet déconnecté à un graphe <literal>g</literal> et renvoie le
61 nouveau graphe <literal>g1</literal>.
62 </para>
63 <para>
64 Les coordonnées du nouveau sommet sont éventuellement précisées dans un vecteur ligne <literal>xy</literal>. Si les sommets du graphe <literal>g</literal> n'ont pas de coordonnées, (les éléments <literal>g.nodes.graphics.x</literal> et <literal>g.nodes.graphics.y</literal> sont égaux à <literal>[]</literal>) donner <literal>xy</literal> n'a aucun effet. Si les sommets
65 du graphe <literal>g</literal> ont des coordonnées et que <literal>xy</literal> n'est pas donné, le
66 nouveau sommet a <literal>(0,0)</literal> comme coordonnées.
67 </para>
68 <para>
69 Si <literal>name</literal> est donné, il est le nom du nouveau sommet, sinon le nombre
70 de sommets plus 1 est pris comme nouveau nom.
71 </para>
72 </refsection>
73 <refsection>
74 <title>Exemples</title>
75 <programlisting role="example"><![CDATA[
76//create a graph
77ta=[1 1 2 2 2 3 4 5 5 7 8 8 9 10 10 10 11 12 13 13 13 14 15 16 16 17 17];
78he=[2 10 3 5 7 4 2 4 6 8 6 9 7 7 11 15 12 13 9 10 14 11 16 1 17 14 15];
79g=make_graph('foo',1,17,ta,he);
80//set node coordinates for visualization
81g.nodes.graphics.x=[283 163 63 57 164 164 273 271 339 384 504 513 439 623 631 757 642]/2;
82g.nodes.graphics.y=[59 133 223 318 227 319 221 324 432 141 209 319 428 443 187 151 301]/2;
83show_graph(g);
84
85g1=add_node(g,[270 350 700;140 0 400]);
86show_graph(g1);
87hilite_nodes(18:20);
88 ]]></programlisting>
89 </refsection>
90 <refsection>
91 <title>Voir Aussi</title>
92 <simplelist type="inline">
93 <member>
94 <link linkend="add_edge">add_edge</link>
95 </member>
96 <member>
97 <link linkend="delete_arcs">delete_arcs</link>
98 </member>
99 <member>
100 <link linkend="delete_nodes">delete_nodes</link>
101 </member>
102 </simplelist>
103 </refsection>
104</refentry>
diff --git a/scilab/modules/metanet/help/fr_FR/addchapter.sce b/scilab/modules/metanet/help/fr_FR/addchapter.sce
deleted file mode 100644
index dda75df..0000000
--- a/scilab/modules/metanet/help/fr_FR/addchapter.sce
+++ /dev/null
@@ -1,11 +0,0 @@
1// Scilab ( http://www.scilab.org/ ) - This file is part of Scilab
2// Copyright (C) 2009 - DIGITEO
3//
4// This file must be used under the terms of the CeCILL.
5// This source file is licensed as described in the file COPYING, which
6// you should have received as part of this distribution. The terms
7// are also available at
8// http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
9
10add_help_chapter("Metanet : Graphes & Réseaux",SCI+"/modules/metanet/help/fr_FR",%T);
11
diff --git a/scilab/modules/metanet/help/fr_FR/adj_lists.xml b/scilab/modules/metanet/help/fr_FR/adj_lists.xml
deleted file mode 100644
index e8c343c..0000000
--- a/scilab/modules/metanet/help/fr_FR/adj_lists.xml
+++ /dev/null
@@ -1,144 +0,0 @@
1<?xml version="1.0" encoding="UTF-8"?>
2<!--
3 * Scilab ( http://www.scilab.org/ ) - This file is part of Scilab
4 * Copyright (C) 2008 - INRIA
5 *
6 * This file must be used under the terms of the CeCILL.
7 * This source file is licensed as described in the file COPYING, which
8 * you should have received as part of this distribution. The terms
9 * are also available at
10 * http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
11 *
12 -->
13<refentry xmlns="http://docbook.org/ns/docbook" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:svg="http://www.w3.org/2000/svg" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:db="http://docbook.org/ns/docbook" version="5.0-subset Scilab" xml:lang="fr" xml:id="adj_lists">
14 <info>
15 <pubdate>$LastChangedDate$</pubdate>
16 </info>
17 <refnamediv>
18 <refname>adj_lists</refname>
19 <refpurpose> calcule des listes d'adjacence </refpurpose>
20 </refnamediv>
21 <refsynopsisdiv>
22 <title>Séquence d'appel</title>
23 <synopsis>[lp,la,ls] = adj_lists(g)
24[lp,la,ls] = adj_lists(oriented,n,tail,head)</synopsis>
25 </refsynopsisdiv>
26 <refsection>
27 <title>Paramètres</title>
28 <variablelist>
29 <varlistentry>
30 <term>g </term>
31 <listitem>
32 <para>graphe (liste)
33</para>
34 </listitem>
35 </varlistentry>
36 <varlistentry>
37 <term>oriented </term>
38 <listitem>
39 <para>entier, 0 (graphe non-orienté) ou 1 (graphe orienté)
40</para>
41 </listitem>
42 </varlistentry>
43 <varlistentry>
44 <term>n </term>
45 <listitem>
46 <para>entier, le nombre de sommets du graphe
47</para>
48 </listitem>
49 </varlistentry>
50 <varlistentry>
51 <term>tail </term>
52 <listitem>
53 <para>le vecteur ligne des numéros des sommets origines du graphe (sa taille est égale au nombre d'arêtes du graphe)
54</para>
55 </listitem>
56 </varlistentry>
57 <varlistentry>
58 <term>head </term>
59 <listitem>
60 <para>le vecteur ligne des numéros des sommets extrémités du graphe (sa taille est égale au nombre d'arêtes du graphe)
61</para>
62 </listitem>
63 </varlistentry>
64 <varlistentry>
65 <term>lp </term>
66 <listitem>
67 <para>vecteur ligne, tableau de pointeurs de la description du graphe sous forme de liste d'adjacence (sa taille est égale au nombre de sommets du graphe + 1)
68</para>
69 </listitem>
70 </varlistentry>
71 <varlistentry>
72 <term>la </term>
73 <listitem>
74 <para>vecteur ligne, tableau d'arcs de la description du graphe sous forme de liste d'adjacence (sa taille est égale au nombre d'arêtes du graphe)
75</para>
76 </listitem>
77 </varlistentry>
78 <varlistentry>
79 <term>ls </term>
80 <listitem>
81 <para>vecteur ligne, tableau de sommets de la description du graphe sous forme de liste d'adjacence (sa taille est égale au nombre d'arêtes du graphe)
82</para>
83 </listitem>
84 </varlistentry>
85 </variablelist>
86 </refsection>
87 <refsection>
88 <title>Description</title>
89 <para><literal>adj_lists</literal> calcule le vecteur ligne de la description du graphe <literal>g</literal> sous forme de liste d'adjacence.
90 Il est aussi possible de donner <literal>adj_lists</literal>, la description du
91 graphe donnée par le nombre de sommets <literal>n</literal> ainsi que les vecteurs lignes <literal>tail</literal> et <literal>head</literal>.
92 </para>
93 </refsection>
94 <refsection>
95 <title>Exemples</title>
96 <programlisting role="example"><![CDATA[
97ta=[2 3 3 5 3 4 4 5 8];
98he=[1 2 4 2 6 6 7 7 4];
99g=make_graph('foo',1,8,ta,he);
100g.nodes.graphics.x=[129 200 283 281 128 366 122 333];
101g.nodes.graphics.y=[61 125 129 189 173 135 236 249];
102g.nodes.graphics.display='number';
103g.edges.graphics.display='number';
104
105show_graph(g);
106//directed graph
107[lp,la,ls]=adj_lists(g)
108[lp,la,ls]=adj_lists(1,g.nodes.number,ta,he)
109for k=1:node_number(g)
110 sel=lp(k):(lp(k+1)-1);
111 g1=g;
112 g1.nodes.graphics.colors(2,k)=color('red');
113 g1.edges.graphics.foreground(la(sel))=color('green');
114 g1.nodes.graphics.colors(1,ls(sel))=color('red');
115<