CN113704839A

CN113704839A - Method and system for automatically generating route information table based on depth priority

Info

Publication number: CN113704839A
Application number: CN202111264238.1A
Authority: CN
Inventors: 王腾飞; 付刚; 郭进; 杨明; 黄程辉; 左林华; 陈立华; 方晓君; 吴丹娜
Original assignee: CRSC Research and Design Institute Group Co Ltd
Current assignee: CRSC Research and Design Institute Group Co Ltd
Priority date: 2021-10-28
Filing date: 2021-10-28
Publication date: 2021-11-26

Abstract

The invention discloses a method and a system for automatically generating an access information table based on depth priority, belonging to the technical field of rail transit, wherein the method comprises the following steps: acquiring a signal plane layout diagram; establishing a signal equipment primitive data model according to the signal plane layout; describing and processing a signal equipment primitive data model by adopting a graph theory algorithm to obtain a station yard topological data structure; carrying out path search on the station yard topology data structure based on a depth-first algorithm to obtain access data; a route information table is generated based on the route data. The invention utilizes the characteristics of the depth-first search algorithm and fully combines the characteristics of the route information table, realizes the automatic generation of the route information table, improves the efficiency of manually compiling the route information table by designers, effectively reduces the labor cost in engineering design and simultaneously improves the accuracy.

Description

Method and system for automatically generating route information table based on depth priority

Technical Field

The invention belongs to the technical field of rail transit, and particularly relates to a method and a system for automatically generating a route information table based on depth priority.

Background

The route information table is a table of core logic relations of railway signal equipment, and the table is compiled according to a signal plane graph, a display relation and the like, and in a specific compiling process, the route information table is strictly compiled according to related design documents, such as railway signal design specifications and the like.

At present, most contents of the route information table are still compiled manually, and the quality of the compiled route information table is different from the professional level of a compiler, so that the difficulty, the workload, the working time and the like of the auditing process are increased. In actual work, the situation that reworking and recompilation of the route information table occur during later-stage compiling and testing of the interlocking software due to errors of details in the route information table often occurs, and a fault occurs during the operation of a product on the upper way due to an untested error. The condition not only reduces the quality of engineering design and prolongs the construction period, but also increases the potential safety hazard of driving.

Disclosure of Invention

In order to solve the above problems, the present invention provides a method and a system for automatically generating a route information table based on depth-first, which automatically generate a route information table.

A method for automatically generating a route information table based on depth priority comprises the following steps: acquiring a signal plane layout diagram; establishing a signal equipment primitive data model according to the signal plane layout; describing and processing a signal equipment primitive data model by adopting a graph theory algorithm to obtain a station yard topological data structure; carrying out path search on the station yard topology data structure based on a depth-first algorithm to obtain access data; a route information table is generated based on the route data.

Further, establishing a signal device primitive data model according to the signal plane layout specifically includes:

and sequentially importing attribute data of the signal equipment according to the structure of the signal plane layout, and converting the signal plane layout into a corresponding signal equipment primitive data model.

Further, the signal equipment primitive data model comprises a signal machine data model, a track section data model and a turnout data model.

Further, describing and processing the signal equipment primitive data model by adopting a graph theory algorithm to obtain a station yard topological data structure, and the method comprises the following steps:

describing signal equipment primitives in a signal equipment primitive data model as nodes by adopting a graph theory algorithm;

according to attributes contained in the signal equipment primitive data model and the relation between the front signal equipment and the rear signal equipment, pointer distribution is carried out;

abstracting each signal device into nodes with directions along with the pointer attributes of each signal device, sequentially connecting each node based on a station yard graph to form different edges, and generating a directed graph;

and naming and numbering the nodes and edges in the directed graph to obtain a station yard topological data structure.

Further, pointer assignment is performed according to switches, track sections and semaphores, and specifically as follows:

the single-action turnout is provided with a front turnout supporting pointer, a turnout positioning pointer and a turnout reverse pointer;

the double-acting points pointer comprises a front point pointer, a point positioning pointer and a point reverse pointer of two groups of single-acting points, wherein the point reverse pointers of the two groups of single-acting points are connected with each other;

the track section and the signal machine are provided with a pointer pointing to the previous signal device and a pointer pointing to the next signal device.

Further, generating the route information table based on the route data includes the steps of:

screening the changed routes in the route data to obtain a plurality of small eight-character changed routes;

and deleting the small eight characters in the route data to change the route, and generating a route information table by adopting an automatic route information table generation algorithm for the processed route data.

Further, the route information table outputs an Excel format and/or a CAD format.

Further, the method for outputting the Excel format by the route information table comprises the following steps:

s61, establishing a table in SQL, and generating an Excel format database;

s62, sequentially taking out each row of the route information table in the memory according to the rule of the route information table;

s63, inserting the content of each line of the routing information table into the table by using insert statements;

s64, judging whether the content in the memory is completely taken out, if so, finishing the taking step and outputting an access information table in an Excel format; if the removal is not completed, the flow returns to S62.

Further, the contents of the route information table include: train running direction information, train property information, route number information of the train and information of the train from the route to the corresponding station track.

The invention also provides a system for automatically generating the route information table based on depth priority, which comprises the following steps:

the image acquisition module is used for acquiring a signal plane layout image;

the model establishing module is used for establishing a signal equipment primitive data model according to the signal plane layout;

the primitive processing module is used for describing and processing a primitive data model of the signal equipment by adopting a graph theory algorithm to obtain a station yard topological data structure;

the search calculation module is used for carrying out path search on the station yard topological data structure based on a depth-first algorithm to obtain access data;

and the generating module is used for generating a route information table based on the route data.

Further, the model building module is specifically configured to:

Further, the primitive processing module is specifically configured to:

Further, the generating module is specifically configured to:

The invention has the beneficial effects that: the characteristics of a depth-first search algorithm are utilized, the characteristics of the route information table are fully combined, the automatic generation of the route information table is realized, the efficiency of manually compiling the route information table by designers is improved, the labor cost in engineering design is effectively reduced, and meanwhile, the accuracy is improved.

Additional features and advantages of the invention will be set forth in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention. The objectives and other advantages of the invention will be realized and attained by the structure particularly pointed out in the written description and claims hereof as well as the appended drawings.

Drawings

In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and those skilled in the art can also obtain other drawings according to the drawings without creative efforts.

Fig. 1 is a schematic flowchart illustrating a method for automatically generating a route information table based on depth-first according to an embodiment of the present invention;

FIG. 2 is a flow chart of a signaling device primitive data modeling method according to an embodiment of the present invention;

fig. 3 shows a signal plant model schematic according to an embodiment of the invention;

FIG. 4 is a diagram illustrating a track section primitive model according to an embodiment of the present invention;

FIG. 5 is a diagram illustrating a switch primitive model according to an embodiment of the present invention;

FIG. 6 is a diagram illustrating a primitive model of an overrun insulation joint at a switch flip according to an embodiment of the present invention;

FIG. 7 is a diagram illustrating a graphical primitive model of an overrun isolation joint at a switch location according to an embodiment of the present invention;

FIG. 8 is a schematic diagram illustrating a data structure connection of a take-over switch according to an embodiment of the present invention;

fig. 9 shows a schematic plan view of a local station yard at a certain station according to an embodiment of the present invention;

FIG. 10 is a diagram illustrating a signaling device primitive data modeling system according to an embodiment of the present invention;

FIG. 11 shows a schematic diagram of a directed graph according to an embodiment of the invention;

FIG. 12 shows a schematic diagram of an undirected graph, in accordance with an embodiment of the invention;

FIG. 13 is a diagram illustrating pointer assignment for a device primitive model, according to an embodiment of the present invention;

FIG. 14 illustrates a local yard topology structure diagram of a station according to an embodiment of the present invention;

fig. 15 is a flowchart illustrating a depth-first based train route acquisition method according to an embodiment of the present invention;

fig. 16 is a flow chart illustrating a change route determination change button according to an embodiment of the present invention;

fig. 17 is a schematic diagram illustrating a depth-first based train route acquisition system according to an embodiment of the present invention;

FIG. 18 shows a small eight-word progression diagram according to an embodiment of the invention;

FIG. 19 is a flow chart diagram illustrating the output of a routing information table to EXCEL, in accordance with an embodiment of the present invention;

fig. 20 is a schematic structural diagram illustrating an automatic generation system of a route information table based on depth-first according to an embodiment of the present invention.

Detailed Description

In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.

The route information table is a table of the core logic relationship of the railway signal equipment, most contents of the current route information table are still compiled manually, and the quality of the compiled route information table is different from the professional level of a compiler, so that the difficulty, the workload, the working time and the like of the auditing process are increased.

The embodiment of the invention realizes the automatic generation of the route information table, not only effectively reduces the labor cost in engineering design, but also improves the corresponding accuracy.

Referring to fig. 1, fig. 1 is a flowchart illustrating a method for automatically generating a route information table based on depth-first according to an embodiment of the present invention.

Specifically, the signal plan mainly includes an incoming/outgoing signal, a track circuit, a switch, and the like, and the equipment that guides the train in multiple aspects such as direction, speed, whether the train is stopped, and the like mainly includes a track circuit, an insulation point, a switch, and the like.

In specific implementation, after the station yard graph and the equipment attributes are drawn, a data structure can be obtained through software, data input and storage are finally realized, and preparation is made for automatic search of subsequent interlocking relations and automatic generation of a final route information table. When the system is used for selecting and ranking routes, the automatic search of the interlocking relationship automatically forms routes with different serial numbers according to the type and the indication direction of the signal machine, and performs attribute query on track sections and turnouts in different routes, and automatically identifies the interlocking relationship of protection turnouts, enemy signals and the like in the routes.

In specific implementation, all primitive data models are integrated through a simulation platform and are displayed in a visual field. The simulation platform comprises a basic primitive model and also comprises special models, such as double-acting turnouts and the like. If each set of transition or double-acting switches is assembled using single-acting switches, the time required would be greatly increased.

The standard station field diagram is obtained again by utilizing the existing graphic models of various signal devices, and the signals are divided into two types, namely downlink and uplink throat signal devices, based on different positions. After the drawing is finished, corresponding throat numbers are prepared for different signal devices, the name of each signal device is modified one by one, wherein the signal devices with special properties need to be independently set with attributes, and if the signal devices are not set with the attributes, the signal devices are default attributes.

In a two-dimensional plane, relatively independent points, lines, and planes are referred to as primitives, and the independent points, lines, and planes are the smallest factors having independent spatial meanings in a two-dimensional plane diagram.

Based on the theory, the primitive data model of the signal equipment can be established by combining with the actual signal plane layout diagram structure, the embodiment of the invention provides a method for establishing the primitive data model of the signal equipment, the structure for storing the data contained in the primitive is the primitive data model, all information (attributes, parameters, graphic description information and the like) contained in the primitive data model of each basic signal equipment is regarded as a whole in the memory for storage management, a corresponding independent data buffer zone is established for the primitive data model of each type of basic signal equipment, the generation of the primitive data model and the operation processing of the information of the primitive and the like are carried out in the corresponding data buffer zone, and all the information of the primitive is stored in a target storage zone after the primitive model is processed and is correct.

Referring to fig. 2, fig. 2 is a flow chart illustrating a method for building a primitive data model of a signaling device according to an embodiment of the invention.

A signal equipment primitive data model building method comprises the following steps: acquiring signal equipment primitives in a signal plane layout diagram; carrying out attribute setting on the signal equipment to obtain attribute data of the signal equipment; and associating the signal equipment attribute data with the signal equipment primitive to obtain a signal equipment primitive data model.

It should be noted that the signaling devices include semaphores, track sections, and switches. And sequentially importing attribute data of the signal equipment according to the structure of the signal plane layout diagram by combining an actual signal plane layout diagram and based on related index sequence and logic relationship, such as turnouts, track sections and signalers, and converting the signal plane layout diagram into a corresponding signal equipment primitive data model.

Specifically, the signal equipment primitive data model comprises a signal machine data model, a track section data model, a turnout data model and a special module data model.

It should be noted that the track section data model and the turnout data model in this step both include an insulation joint.

And carrying out attribute setting on the signal, wherein the set attribute data comprises signal type information, signal name information, located throat information, indication direction information and coordinate information.

In this embodiment, the various types of signals are defined as Si = { s (v1), s (v2), … …, s (vn) }, and the signal set is defined as Signali = { s1, s2, … …, sn }, where s1, s2, …, sn are inbound signals, outbound signals, receiving and dispatching vehicles, and the like.

s (v1) sets forth this type of semaphore property. Taking the inbound signal (s 1) as an example, the attributes are shown in table 1, and table 1 is an inbound signal attribute table.

Referring to fig. 3, fig. 3 is a schematic diagram illustrating a traffic signal equipment model according to an embodiment of the present invention.

The signal machine has the indication function to the operation of shunting, has the branch of red white, red blue shunting signal machine, and signal mechanism still can classify according to the height simultaneously. In accordance with the above requirements, the embodiment of the present invention establishes four semaphore models indicating different directions of travel.

The specific traffic signal data model includes a blue short traffic signal data model, a blue high traffic signal data model, a red short traffic signal data model and a red high traffic signal data model.

First, from the perspective of signal devices, track circuits, and switches, the embodiments of the present invention each pick one signal device as a typical development description. Secondly, from the safety point of view, the handling mode of the invasion limiting insulation joint in the interlocking relation is also important, and the embodiment of the invention also makes a special explanation.

TABLE 1 attribute table of station signal

Specifically, the track sections in the signal plan include turnout/turnout sections, which are mainly distinguished according to whether there is a turnout in the section range, and in the computer interlocking system, the specific train position can be reflected by the position occupied by the track circuit, as shown in table 2, where table 2 is a track section data model attribute table.

TABLE 2 track segment data model Attribute Table

The insulating section is a signal device, and is mainly used for dividing sections, and for an insulating pad in a station layout drawing, the insulating pad mainly comprises a super-insulating section, a half insulating section and the like, and the track sections are divided by the insulating sections, so that a plurality of trains can run in the station at the same time, and the train running efficiency is optimized to the greatest extent under the condition that routes are relatively independent.

The insulation segments can be divided into four categories: general insulation, overrun insulation, dead end insulation and dead end insulation. Because the insulation sections and the track sections are closely connected, the primitive models are not separately established for the insulation sections, but the insulation sections are respectively established in the models of the turnout and the track sections, and the types of the insulation sections are set according to actual conditions.

Attribute setting is performed on track sections, the track section attribute data includes track section type information, track section name information, track section length information, and track section two-side insulation segment type information, in this embodiment, each type of track section concerned is defined as Ci = { c (v1), c (v2), … …, c (vn) }, and the attributes thereof are shown in table 2.

Referring to FIG. 4, FIG. 4 is a diagram illustrating a track section primitive model according to an embodiment of the present invention.

The track sections are represented in the signal plan primarily by the presence or absence of switches therein, including uninsulated sections, general insulated sections, overrun insulated sections, dead end insulated sections, and dead end insulated sections. Actually, there are turnout sections in the turnout primitive model, and in this embodiment, only the track section data model of turnout-free sections and track is established.

It should be noted that the switch is mainly used for determining the operation path, and the switch can be mainly divided into the following types, such as single-action, double-action and multiple-type, since the section division at the crossover line needs to depend on the insulation node, the relevant characteristics of the insulation node need to be considered here, as shown in table 3, and table 3 is a switch data attribute table.

TABLE 3 Turnout data attribute table

And carrying out attribute setting on the turnout, wherein turnout attribute data comprises turnout type information, turnout name information, located throat information, turnout guide direction information, turnout coordinate information and type information of an insulating joint at a crossover.

In this embodiment, the types of switches involved are defined as SWi = { sw (v1), sw (v2), … …, sw (vn) }, and all switch sets are defined as switchhi = { sw1, sw2, … …, swn }, where sw1, sw2, …, and swn are single action, double-representation intersection, and the like, respectively, and sw (v1) represents the attribute corresponding to the type. Taking a single-action switch (sw 1) as an example, the attributes are shown in the following table:

the points in the station are divided into single-action, double-action and double-indication intersection according to the guiding function. The double-action turnout can be regarded as being formed by combining a plurality of groups of double-action turnouts, and considering that the double-action turnouts have insulation joints in the middle of a transition line, the turnouts on the same side of the cross transition line can be divided into the same section, so that a primitive data model needs to be established separately for use. The track sections connected by the double-acting turnouts can be regarded as two groups of single-acting turnout sections, so that the turnout types are divided according to whether the single-acting turnout is opened upwards at the left, downwards at the left, upwards at the right and downwards at the right and is a cross crossover line.

Referring to fig. 5, fig. 5 is a schematic diagram of a switch primitive model according to an embodiment of the present invention.

The turnout types comprise an upper right turnout, an upper left turnout, a lower right turnout, a lower left turnout and a cross crossover.

Specifically, associating the attribute data of the signal equipment with the signal equipment primitive to obtain a signal equipment primitive data model, which comprises the following steps:

and associating the attribute data information of each signal device with the graphic description information of the signal device primitive to form a signal device data set and storing the signal device data set.

In this step, each parameter in the data model, especially the attribute parameter in the primitive model, can be quickly and conveniently accessed through the signal device data set.

And establishing a data buffer zone corresponding to the primitive data model of each type of signal equipment.

In this step, the primitive data is stored in the memory in a block form, and the damage degree to the memory in the process of storing the primitive data is reduced.

And storing each signal equipment data set into a corresponding data buffer area to obtain a signal equipment primitive data model.

It should be noted that the topology structure of the station yard is formed by connecting the primitive data modules of each signal device, and when the primitive model of a certain signal device is added or deleted in the plan view of the station yard, only the corresponding modification needs to be made at the corresponding position in the topology structure, and this operation only involves the modification of the left and right connection relationship of the primitive data modules of the signal device, and does not affect the physical storage area of each data module in the memory, so that the topology structure is very suitable for reconstruction or extension of the station yard.

Furthermore, the data model of the special module comprises an overrun insulation section data model, a driving turnout data model and a data model of a shunting terminal button without the same property.

Referring to fig. 6 and 7, fig. 6 is a diagram illustrating a graphical element model of an overrun insulation joint at a switch flip according to an embodiment of the present invention; FIG. 7 shows a graphical element model diagram of an overrun isolation node at a switch location according to an embodiment of the invention.

Specifically, the overrun insulation joint data model is established as follows:

the method comprises the steps of obtaining insulation joint types in a track section data model and a turnout data model, extracting information of an overrun insulation joint in the track section data model and the turnout data model, and establishing a data structure according to a connection mode of the overrun insulation joint, a track section and the turnout to obtain the overrun insulation joint data model.

When there is an overrun insulation section in the route, there is a case where normal driving cannot be satisfied due to branching, and therefore, it is necessary to strictly check such a special case.

Specifically, the establishment of the data model for driving the turnout is as follows:

and carrying out attribute setting on a driving switch and a driving position in the turnout driving module to obtain a driving turnout data model.

It should be noted that, in order to improve the train operation efficiency, if there is a switch in the route and the switches share the same section when the routes are arranged, the switches that are not on the route should be rotated to the required positions according to the interlocking rule, so as to meet the operation requirement. Similar to the overrun isolation approach, separate definitions of drive switches and drive positions in the switch drive module are required in forming the flat data structure of the station.

Referring to fig. 8, fig. 8 is a schematic diagram illustrating a data structure connection of a switch according to an embodiment of the present invention.

Illustratively, when a train passes through the inverted paths of the turnout 17 and the turnout 19, the influence on the positioning paths of the turnout 21 and the turnout 25 is reduced to the minimum, the turnout 23 and the turnout 25 are driven to be positioned at the signal professional interlocking relation angle, the block turnout module ADD _23 is arranged between the turnout 17 and the turnout 19 according to the requirements of the railway signal specification, on the basis, the turnout 23 needing to be driven can be obtained, and the position needing to be driven is positioned. In the route searching process, the turnout 17, the turnout module ADD _23 and the turnout 19 are obtained in sequence according to the relevant rules.

Specifically, the data model establishment of the shunting terminal buttons without the same properties is explained, and if the shunting terminal buttons are placed in the shunting route and the turnout sections are arranged, if no related signal machine is used as a terminal, a button must be added as the terminal button of the shunting route according to the interlocking rule.

Referring to fig. 9, fig. 9 is a schematic plan view of a local station yard at a certain station according to an embodiment of the present invention.

For example, as shown in fig. 9, in the case where a 3G to X shunting route is a switch section, and the D5 shunting signal does not match the protection direction of the route, an XDZA button (X-port shunting terminal button) must be added to the terminal of the route.

It should be noted that there is no shunting terminal button of the same nature, i.e. there is no second rack in the access range for indicating shunting signals of the same direction of travel.

The data structure of the end terminal button includes: the starting end of the shunting route and the type of the shunting route. And in the process of searching the route, adding a data structure corresponding to the corresponding shunting route terminal button.

The signal equipment primitive data model of the embodiment of the invention considers the complexity of the station yard, summarizes the graphs related to various signal equipment in the plan view, and considers the signal equipment primitive model under the condition of special interlocking, thereby generating the station yard type data of the whole station conveniently and quickly. And when the station needs to be overhauled or rebuilt at the later stage, the corresponding signal equipment primitive model is only needed to be modified or added on the original drawn station yard graph, so that the working intensity of signal designers is reduced.

Referring to fig. 10, fig. 10 is a schematic diagram illustrating a signaling device primitive data model building system according to an embodiment of the invention.

The embodiment of the present invention further provides a system for establishing a primitive data model of a signal device, including: the data acquisition module is used for acquiring signal equipment primitives in the signal plane layout; the data input module is used for carrying out attribute setting on the signal equipment to obtain attribute data of the signal equipment; and the data processing module is used for associating the signal equipment attribute data with the signal equipment primitive to obtain a signal equipment primitive data model.

The signal equipment comprises a signal machine, a track section and a turnout.

Further, the data input module is specifically configured to: carrying out attribute setting on the annunciator to obtain annunciator attribute data;

the signal attribute data comprises signal type information, signal name information, located throat information, indication direction information and coordinate information.

Further, the data input module is specifically configured to: carrying out attribute setting on the track section to obtain track section attribute data;

the track section attribute data comprises track section type information, track section name information, track section length information and insulation section type information on two sides of the track section.

Further, the data input module is specifically configured to: carrying out attribute setting on the turnout to obtain turnout attribute data;

the turnout attribute data comprises turnout type information, turnout name information, located throat information, turnout guide direction information, turnout coordinate information and type information of an insulating joint at a crossover.

Further, the signal equipment primitive data model comprises a signal machine data model, a track section data model, a turnout data model and a special module data model.

According to the characteristics of the professional railway signals, the direction of a route from a starting end to a terminal is dominant, and according to the characteristics that the directions of a train route or a shunting route are consistent, a forward route has the characteristic of consistent direction.

The method adopts a graph theory algorithm to describe and process a signal equipment primitive data model to obtain a station yard topological data structure, and comprises the following steps:

and S11, describing the signal equipment primitive in the signal equipment primitive data model as a node by adopting a graph theory algorithm.

For ease of understanding, the following exemplary definitions of the graphs in the graph theory algorithm are provided, which are as follows:

the graph is actually intended to express a relationship and is mathematically, i.e., G is composed of V, E, and is composed of different nodes. If V = { V1, V2, …, vn } is a set of n nodes, the set of m edges E = { E1, E2, …, en }, where each edge is a binary subset { vi, vj } of the set V. Thus, the graph shows the enantiomeric connections between different elements in set V, which form edge set E.

The graph has a directed graph and an undirected graph according to the property of the edge. If the pair of binary subsets of edges { vi, vj } is ordered, and vi is a predecessor of vj, then the edge from point vi to vj is directed.

Referring to fig. 11, fig. 11 shows a schematic diagram of a directed graph according to an embodiment of the invention.

The directed graph includes a node set V = { V1, V2, V3, V4}, and an edge set composed of connected relationships between nodes, i.e., E = { E1, E2, E3, E4, E5}, where E1= (V2, V1), E2= (V2, V4), E3= (V1, V3), E4= (V4, V3), E5= (V4, V1).

An edge from node vi to node vj is said to be undirected if the pair of dyadics { vi, vj } of the edge in the graph is unordered, i.e., indistinguishable from { vj, vi } representation.

Referring to fig. 12, fig. 12 is a schematic diagram illustrating an undirected graph according to an embodiment of the invention.

The undirected graph includes a node set V = { V1, V2, V3, V4}, and the connection relationship between nodes forms an edge set E = { E1, E2, E3, E4, E5}, where E1= (V2, V1) = (V1, V2), E2= (V2, V4) = (V4, V2), E3= (V1, V3) = (V3, V1), E4= (V4, V3) = (V3, V4), E5= (V4, V1) = (V1, V4).

In this step, in the process of selecting data nodes, a primitive data model of a signal device is mainly used, and pointers are used for connecting devices, so that a set is generated, which mainly comprises vertices and edges, and finally a corresponding data structure, namely a so-called topological structure, is formed.

And S12, distributing the pointers according to the attributes contained in the signal devices in the signal device primitive data model and the relation between the front signal device and the rear signal device.

In particular, pointer assignment is performed according to switches, track sections and semaphores.

For single-acting turnouts, 3 pointers in the front direction, the rear direction and the lateral direction of the rear direction of the turnout need to be distributed, so that the double-acting turnout can be pushed out to be formed by combining 6 pointers; for the annunciator, reasonably distributing 2 pointers inside and outside the annunciator; for a track segment, 2 pointers can be assigned according to the progression of the left and right side coordinates.

The existing primitive data is generally stored in a parameter memory, and attributes of primitives and the like are acquired by reading data in the memory, and calling is realized through functions. The technology can shorten the reading time, improve the compiling efficiency and the execution speed of the program, realize dynamic memory allocation and the like through pointer allocation.

The station yard topological structure can be vividly and vividly shown through pointer distribution, and the running directions of trains passing through the equipment primitives can be reflected.

The pointer assignment is specifically as follows: the single-action turnout is provided with a front turnout supporting pointer, a turnout positioning pointer and a turnout reverse pointer; the double-acting points pointer comprises a front point pointer, a point positioning pointer and a point reverse pointer of two groups of single-acting points, wherein the point reverse pointers of the two groups of single-acting points are connected with each other; the track section and the signal machine are provided with a pointer pointing to the previous signal device and a pointer pointing to the next signal device.

Referring to FIG. 13, FIG. 13 is a diagram illustrating pointer assignment for a device primitive model according to an embodiment of the present invention.

For a single-action switch, a front switch pointer pFC, a switch positioning pointer pNC and a switch inversion pointer pRC are set.

For a double-acting turnout, because the double-acting turnout consists of two groups of single-acting turnouts, a pointer field of the double-acting turnout needs to comprise 6 pointers, namely a front turnout pointer pFC, a positioning turnout pointer pNC and a back turnout pointer pRC of the two groups of single-acting turnouts, and the back turnout pointers pRC of the two groups of single-acting turnouts are always connected together.

For track sections and semaphores their pointer field comprises only 2 pointers, pointer pZC pointing to the previous signal device and pointer pMC pointing to the next signal device.

And S13, abstracting each signal device into nodes with directions by using the pointer attributes of each signal device, sequentially connecting the nodes based on the station yard graph to form different edges, and generating the directed graph.

In this step, after deep research on the properties of the station yard and the complexity of various storage structures, the directed station yard topology is stored in the computer by selecting a form of using a binomial method.

And then abstracting each device into nodes with directions, sequentially connecting the nodes based on the station yard graph to finally form different edges, and then generating the directed graph.

Referring to fig. 14, fig. 14 is a diagram illustrating a local site topology according to an embodiment of the present invention.

And S14, naming and numbering the nodes and edges in the directed graph to obtain the topology data structure of the station yard.

Specifically, for the signal device included in the signal device primitive data model, the ID: the name is a node, and the edge is marked by two devices with connection relation to generate 'E + number', and the number is gradually increased regardless of the number sequence or the signal device.

In addition, in order to obtain all information such as an actual route, the names of the signal devices, the associated uplink and downlink throats, the coordinates of the signal devices and the like, each signal device primitive is obtained from the pointing direction of the pointer on the basis of the station topology data structure, and finally, relevant contents such as the types, the names, the associated uplink and downlink throats, the indicated running direction, the next node, whether the infringement insulated joint is involved or not and the like of the signal devices can be obtained.

Referring to fig. 15, fig. 15 is a flowchart illustrating a method for obtaining a train route based on depth-first according to an embodiment of the present invention.

The embodiment of the invention also provides a depth-first-based train route acquisition method, which comprises the following steps: obtaining the attribute of the initial end equipment of the route from a station yard topological data structure; based on a depth-first algorithm, performing route search according to the attribute of the route starting-end equipment to obtain a plurality of routes; judging whether the multiple routes form a legal route or not through a judging function, and if so, storing the routes; if not, searching the route again.

The route is a route through which a train consisting of a starting signal machine, a terminal signal machine, a plurality of turnouts, turnout positions and track sections passes when the train runs in a station.

In the graph theory, the path search algorithm includes DFS, BFS, heuristic search algorithm, and the like. According to the professional characteristics of railway signals and the characteristics of the starting end and the terminal of the route and the direction, the complete route and the actual situation can be searched by using a DFS algorithm (Depth First Search, DFS), and the basic properties of the complete route and the actual situation are consistent with those of the professional railway signals.

By utilizing the characteristic concept that the route has the direction and the direction in the graph theory and combining a database of a signal equipment primitive model, the units of each node can be sequentially and progressively increased from left to right according to the serial number to form a bundle of path data, so that the route in the station yard topological structure can be represented by a plurality of path data.

If Di is taken as a path data set, for example, from X to XI, D1 is { s (vm), c (vn), sw (vx), … }, s (vm) is an X inbound signal map metadata base, c (vn) is a map metadata base of a track section inside the X inbound signal, and sw (vx) is a first group of points passed by the inbound path, so that the inbound path search space of the total station can be set as D = { D1, D2, …, Dn }^T。

Specifically, the step of obtaining the attribute of the device at the starting end of the route from the station yard topology data structure includes the following steps:

and acquiring the serial number of the signal equipment in the station yard topological data structure, taking the signal equipment with the minimum serial number of the inbound signal equipment in the station yard topological data structure as the initial end equipment of the inbound route, and acquiring the attribute of the initial end equipment of the inbound route.

The route has clear initial end and terminal end, so that the route search firstly needs to obtain the initial end equipment of the route, and then searches all existing routes according to the attribute of the initial end equipment.

Specifically, based on a depth-first algorithm, according to the attribute of the device at the starting end of the route, the route search is performed, and the step of obtaining a plurality of routes comprises the following steps:

s21, taking the node of the route starting device as a search starting point, performing route search based on the depth-first algorithm, and searching for multiple nodes to obtain a node set, which is specifically as follows:

the point v1 represents the initial node of the route search, and the formula (3-1) represents the set of nodes visited sequentially when the node vi is searched.

V(vi)={v1，v2，…，vi} (3-1)

For a certain node vi (i >1), whose parent is vi-1, its set of children nodes can be represented as vs (vi) = { vi, j, j =0, 1, 2k }, where k represents the number of children nodes (k =0 represents no children nodes, i.e., vi, 0= ⌀).

And S22, forming the sequence of each node into multi-beam path data, wherein the multi-beam path data is a plurality of routes.

Specifically, whether a plurality of routes form a legal route or not is judged through a judging function, and if so, the routes are stored; if not, the step of searching the route again comprises the following steps:

and S31, setting a judgment function of a legal route.

For example, if the node list R = v (vi) in equation (3-1) corresponds to v1 and the inbound traffic signal vi, and the directions of the two signals are opposite, it can be determined that the train is a legal departure route.

And S32, based on the judgment function of the legal route, taking the node of the route starting end equipment as a search starting point, and carrying out recursive processing on the node set through a depth-first search algorithm to obtain the legal route.

Without loss of generality, representing the (arbitrary) current node by vc, the depth-first search algorithm (vc) recursive process is as follows:

and S321, enabling R = V (vc), judging whether a legal route is formed, if so, storing R into Rt, and turning to S324, otherwise, turning to S322.

And S322, searching a vc child node set Vs (vc), if Vs (vc) = ⌀, turning to S324, otherwise, turning to S323.

S323, recursively calling DFS (vcj) for each effective node vc, j in Vs (vc), respectively.

S324, let R = V (vc-1), return to the upper recursion state, and end if there is no upper recursion.

S33, storing each searched legal entry route in an entry route space, and sequentially performing an algorithm to obtain entry route set information Rt of the total station, wherein the Rt is as follows:

Rt=[R1，R2，…，Rn]^T (3-2)

wherein Ri is composed of all node devices sequentially passing through the starting end v1i to the ending end vki of the route, which can be represented by the following nodes:

Ri={v1i，v2i，…，vki} (3-3)

for a certain route R, information such as turnouts, track sections and the like can be correspondingly extracted according to the node set shown in the formula (3-3). The set of switches and guard switches (including switch states) in the route R is denoted by w (R), and the set of track sections in the route R is denoted by t (R).

Further, the depth-first-based train route acquisition method further comprises the steps of giving a weight to each route, determining a basic route and changing the route according to the weight.

In the actual application process of engineering, engineering designers propose rules and insights for determining basic routes and changed routes based on experience, but generally rely on the intuitive observation and understanding of route information table compiling personnel on a plan view, and the ratio of the basic routes and the changed routes has no quantitative index, so that the method is inconvenient for computer processing.

In this embodiment, a quantized route comparison algorithm is proposed based on the correlation between routes, and a corresponding weight is assigned to each route, so that a basic route and a modified route are determined according to the weight.

Specifically, the step of giving a weight to each route, and determining the basic route and the modified route according to the weight includes the steps of:

and S41, defining the two routes as independent, mutually exclusive or mutually overlapped according to the mutual relation between the state of the turnout passed by each two routes and the track section.

Specifically, the relationship between the two routes Ra and Rb is defined as follows:

independently, Ra and Rb are independent if w (Ra) and w (Rb) do not have the same switch, the positioning and flipping states of the same switch are considered to be the same switch, and t (Ra) and t (Rb) do not have the same track section.

And mutually exclusive, if W (Ra) and W (Rb) respectively comprise two states (set/flip) of at least 1 set of the same switch, Ra and Rb are mutually exclusive.

When there are not identical points in W (Ra), W (Rb), and at the same time, there are not less than 1 point in T (Rb), Ra and Rb can be said to overlap each other.

Ra and Rb overlap if w (Ra) and w (Rb) do not contain different states (position/inversion) of the same switch, and t (Rb) contains at least 1 identical track segment.

S42, for any route in the route space Rt, a weight is given to each route according to the number of routes independent from the improvement route.

It should be noted that, under the condition of special limitation, mutually independent routes can be opened simultaneously, and trains do not conflict with each other through the independent routes; mutually exclusive access paths cannot be opened simultaneously due to turnout state conflict; the routes overlapping each other can be opened at the same time, but the trains may collide through the routes overlapping each other.

Based on this, the larger the number nd (R) of routes independent of any route R in the route space Rt, the less the route affected by the number nd (R); therefore, nd (r) is used as a weight for measuring the influence of the route.

Specifically, the weighting is specifically to calculate the number of routes independent from any one route in the route space, and the number of routes independent from the route is the weight of the route.

And S43, processing a plurality of routes with the same initial end and terminal end of the given weight in the route space Rt to obtain a weighted route set.

Specifically, the route space formed by m routes having the same initial end vs and terminal end ve is shown in formula (3-4).

R(vs，ve)=[R1，R2，…，Rm]T (3-4)

And S44, sequencing the multiple routes in the weighted route set according to the weights to obtain a basic route and a changed route.

Specifically, the route space shown in the formula (3-4) is obtained by sorting the route weights from large to small.

Rs(vs，ve)=[Rs，1，Rs，2，…，Rs，m]T

The label Rs, 1 is the basic route and the rest is the alternate route.

Further, a change button is determined for the change route.

Referring to fig. 16, fig. 16 is a flow chart illustrating a change route determination change button according to an embodiment of the present invention.

In this step, each of the modified routes is taken out, and a search is performed with respect to the basic route to determine a modification button corresponding thereto.

In the case of an operation in a station, the basic route and the modified route change button are distinguished, and if the basic route cannot be handled for any reason, the route terminal button of the route start button needs to be pressed to handle the modified route of the basic route. Therefore, in the case where there are a plurality of routes at the same end, it is necessary to specify a change button for changing the route. The single, differential, and parallel shunting signal buttons on the route may be used as change buttons (the single signal button in the same direction may not be used as a change button for shunting the route), and if there is no shunting signal button that can be used as a change button, a change button BAx is added.

Specifically, the change route determination and change button includes the steps of:

and S451, determining a change point according to the type of the turnout for the changed route.

In step S452, it is determined whether or not the parallel change route is present, and if so, the process proceeds to step S454, and if not, the process proceeds to step S453.

It should be noted that the parallel change route is a network formed by inverting two or more sets of parallel double-acting switches in part of routes of the same starting terminal, and the route formed by laterally turning the switches close to the station track is used as a basic route, and the rest are parallel change routes.

In this step, for the parallel change, there are parallel switches, and if it can be determined that there is a shunting signal machine as a change button at a position between the parallel switches, a shunting signal machine opposite to the approach direction searched for the first time in the approach direction is taken as the change button, and if the train is on the approach, a shunting signal machine in the same direction as the approach direction can also be taken as the change button. If there is no shunting signal machine capable of being used as change button, the change button is added.

S453 judges whether or not the route is a eight-character change route, and if the route is a eight-character change route, the process proceeds to step S454.

It should be noted that, in the routes of the same starting terminal, the basic route in the eight-character route is composed of the straight direction of the switches, and the rest are all the changed routes in the eight-character route.

In the step, for the eight-character change, the basic route and the divergent turnout of the changed route are determined to form the eight-character shape according to the turnout opening direction, and then whether a shunting annunciator which can be used as a change button exists in the middle of the eight-character shape is judged, and if not, the change button is added.

S454, whether or not there is a traffic signal as a change button is judged, and if so, the process proceeds to step S456, and if not, the process proceeds to step S455.

S455, adding a change button.

And S456, determining the change button as a change point.

Referring to fig. 17, fig. 17 is a schematic structural diagram of a depth-first based train route acquisition system according to an embodiment of the present invention.

An embodiment of the present invention further provides a depth-first based train route acquisition system, including: the acquisition module is used for acquiring the attribute of the route starting-end equipment from the station yard topological data structure; the search module is used for searching routes according to the attribute of the equipment at the starting end of the route based on a depth-first algorithm to obtain a plurality of routes; the judging and storing module is used for judging whether the multiple routes form legal routes through a judging function, and if so, storing the routes; if not, searching the route again.

Further, the obtaining module is specifically configured to: and acquiring the serial number of the signal equipment in the station yard topological data structure, taking the signal equipment with the minimum serial number of the inbound signal equipment in the station yard topological data structure as the initial end equipment of the inbound route, and acquiring the attribute of the initial end equipment of the inbound route.

Further, the search module is specifically configured to: taking a node of the route starting end equipment as a search starting point, performing route search based on a depth-first algorithm, searching a plurality of nodes, and obtaining a node set;

and (4) sequentially forming multi-beam path data by the nodes, wherein the multi-beam path data is a plurality of routes.

Further, the determination storage module is specifically configured to: setting a judgment function of a legal route;

based on a decision function of a legal route, taking a node of route starting end equipment as a search starting point, and carrying out recursive processing on a node set through a depth-first search algorithm to obtain the legal route;

and storing each searched legal route in a route space, and sequentially performing an algorithm to obtain route set information of the total station.

Furthermore, the route acquisition system also comprises a determination module; the determining module is used for giving weight to each route, and determining a basic route and a changed route according to the weight.

Further, the determining module is specifically configured to: defining the two routes as mutually independent, mutually exclusive or mutually overlapped according to the mutual relation between the states of the turnouts where the two routes pass and the track sections;

for any route in the route space, giving weight to each route according to the number of routes independent from the improved route;

processing a plurality of routes with the same starting end and terminal end given with weight in the route space to obtain a weighted route set;

and sequencing a plurality of routes in the weighted route set according to the weights to obtain a basic route and a changed route.

Specifically, the step of generating the route information table based on the route data includes the steps of:

and S51, screening the changed routes in the route data to obtain a plurality of small eight-character changed routes.

Referring to fig. 18, fig. 18 is a diagram illustrating a small eight word path according to an embodiment of the invention.

It should be noted that the small figure route refers to a route formed by a train passing through two groups of adjacent crossover switches, one group is a left falling crossover switch and the other group is a right falling crossover switch, and the shape of the route is similar to a figure of eight, which is commonly called a small figure route.

The path via 5, 7 and the path via 13, 15 form a small eight word path.

And S52, deleting the small eight characters in the route data to change the route, and generating a route information table by the processed route data through an automatic generation algorithm of the route information table.

In actual operation on site, the small eight-character route is not used to the maximum extent. From the theoretical perspective, there is certain rationality in little eight characters change route, however, it is when changing, has two sets of switch pitches to be close to, then will make the motor car travel and have certain risk. Therefore, in designing the route information table, the small eight-letter modified route should be deleted.

The track sections which need to be occupied and checked by each route are required to be reflected in the route information table, and it needs to be stated that when one track section contains a turnout, the track section is called a turnout section; when a track segment does not contain switches, it is called a turnout-free segment. The switch segment name is generally a default XDG (X is the switch number). In some stations, switches of a sector are not specifically named. In this case, if the names of the switch sections need to be modified, the modification is completed through the switch section name modification interface.

In specific implementation, before generating the route information table, the data of the station yard graph needs to be processed and stored by using an algorithm, and the station yard type data and the interlocking data are generated in sequence. The interlocking data mainly comprises data attribute tables of signal machines, turnouts and track circuits and other scattered data attribute tables. Other scattered data attribute tables include signal floor plan attributes, semaphore coordinate tables, and the like.

After preprocessing the site map, a corresponding data structure is obtained. Based on the method, an automatic generation algorithm of the route information table is adopted, rules are compiled according to the route information table, and the method is mainly realized by software in the process of calculating and processing the chain relations of each station yard in the background, so that route data are generated and stored, and a foundation is laid for the construction and output of the information table.

Specifically, the route information table outputs an Excel format and/or a CAD format.

The searched route information is inputted into Excel and CAD in a desired format. The route information table is output to Excel, which is beneficial to the inspector to quickly search related information; the route information table is output to the CAD, engineering drawing is facilitated, and time required for filling data in another template is saved.

Referring to fig. 19, fig. 19 is a schematic diagram illustrating a flow of outputting the route information table to the EXCEL according to the embodiment of the present invention.

Specifically, the method for outputting the Excel format by the route information table comprises the following steps:

s61, establishing a table in SQL, and generating an Excel format database.

In specific implementation, in order to output the route information TABLE data to Excel, ADO technology may be adopted, and a TABLE is built by using a CREATE TABLE statement in SQL, where the contents in the TABLE include 16 fields such as direction, property, route number, route mode, route is a button, and signal name, and the SQL language for generating the Excel data TABLE is specifically as follows:

void CAutoCADDoc: :GetExcel (CString strPath)

｛

char name [ TableCoLm ] [30] = { "Direction TEXT,", "Property TEXT,", "Advance number TEXT,", "Advance TEXT,",

"route mode TEXT,", "skill button TEXT when arranging the route,", "determine the direction switch TEXT,",

"signal name TEXT,", "signal display TEXT,", "designator TEXT,",

"switch TEXT,", "enemy signal TEXT,", "track section TEXT,", "head-on train entry TEXT,",

"head-on shunting route TEXT,", "other interlocked FEXIT" };/16 columns.

And S62, sequentially taking out each row of the route information table in the memory according to the rule of the route information table.

S63, inserting the content of each line of the routing information table into the table by using insert statement.

Table 4 partial results a of routing information table output to EXCEL

TABLE 5 partial results B of routing information Table output to EXCEL

Specifically, as shown in tables 4 and 5, table 4 is a partial result a output from the route information table to the EXCEL, and table 5 is a partial result B output from the route information table to the EXCEL, and the route information table mainly includes train running direction information, train property information, route number information of the train, and information of the train route to the corresponding station track.

At present, methods such as exporting data to Excel by using NPOI, exporting data to Excel by combining microsoft Excel with Com component technology, and realizing VBA + ASPX technology are generally adopted. The embodiment adopts the ADO technology, and the Excel table data export is realized by using the SQL language, so that the method is simple to operate, high in visibility, low in requirement on system software, and high in compatibility.

The embodiment of the invention clearly shows the data format and the header sequence of the information in the route information table, is concise and vivid, and is convenient for subsequent developers to edit and perfect the part according to the relevant specifications of the new route information table.

The embodiment of the invention mainly aims at the problems that most contents of the current route information table are still compiled manually, and the quality of the compiled route information table is different from the professional level of a compiler, so that the difficulty, the workload, the working time and the like of the auditing process are increased. In actual work, the situation that reworking and recompilation of the route information table occur during later-stage compiling and testing of the interlocking software due to errors of details in the route information table often occurs, and a fault occurs during the operation of a product on the upper way due to an untested error.

Referring to fig. 20, fig. 20 is a schematic diagram illustrating a system for automatically generating a route information table based on depth-first according to an embodiment of the present invention.

The embodiment of the present invention further provides a system for automatically generating a route information table based on depth-first, including: the image acquisition module is used for acquiring a signal plane layout image; the model establishing module is used for establishing a signal equipment primitive data model according to the signal plane layout; the primitive processing module is used for describing and processing a primitive data model of the signal equipment by adopting a graph theory algorithm to obtain a station yard topological data structure; the search calculation module is used for carrying out path search on the station yard topological data structure based on a depth-first algorithm to obtain access data; and the generating module is used for generating a route information table based on the route data.

Further, the model building module is specifically configured to: and sequentially importing attribute data of the signal equipment according to the structure of the signal plane layout, and converting the signal plane layout into a corresponding signal equipment primitive data model.

Further, the primitive processing module is specifically configured to: describing signal equipment primitives in a signal equipment primitive data model as nodes by adopting a graph theory algorithm; according to attributes contained in the signal equipment primitive data model and the relation between the front signal equipment and the rear signal equipment, pointer distribution is carried out;

Further, the generating module is specifically configured to: screening the changed routes in the route data to obtain a plurality of small eight-character changed routes; and deleting the small eight characters in the route data to change the route, and generating a route information table by adopting an automatic route information table generation algorithm for the processed route data.

The embodiment of the invention utilizes the characteristics of the depth-first search algorithm and fully combines the characteristics of the route information table, realizes the automatic generation of the route information table, improves the efficiency of manually compiling the route information table by designers, adopts a computer to automatically generate the information of routes and the like, effectively reduces the labor cost in engineering design and simultaneously improves the corresponding accuracy.

Although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention.

Claims

1. A method for automatically generating a route information table based on depth priority is characterized by comprising the following steps:

acquiring a signal plane layout diagram;

establishing a signal equipment primitive data model according to the signal plane layout;

describing and processing a signal equipment primitive data model by adopting a graph theory algorithm to obtain a station yard topological data structure;

carrying out path search on the station yard topology data structure based on a depth-first algorithm to obtain access data;

a route information table is generated based on the route data.

2. The method for automatically generating the depth-first-based routing information table according to claim 1, wherein the establishment of the primitive data model of the signal device according to the signal plane layout map is specifically as follows:

3. The automatic generation method of the depth-first-based route information table according to claim 1, wherein the signal device primitive data model includes a signal machine data model, a track section data model, and a switch data model.

4. The automatic generation method of the depth-first-based route information table according to claim 3, wherein a graph theory algorithm is used for describing and processing a signal device primitive data model to obtain a station yard topology data structure, and the method comprises the following steps:

5. The method for automatically generating the depth-first-based route information table according to claim 4, wherein the pointer assignment is performed according to switches, track sections and semaphores, and specifically as follows:

6. The automatic generation method of the route information table based on depth-first according to any one of claims 1 to 5, wherein generating the route information table based on the route data includes the steps of:

7. The automatic generation method of the route information table based on depth-first as claimed in claim 6, wherein the route information table outputs Excel format and/or CAD format.

8. The method for automatically generating the route information table based on depth-first as claimed in claim 7, wherein outputting Excel format of the route information table comprises the steps of:

s61, establishing a table in SQL, and generating an Excel format database;

9. The method according to claim 8, wherein the contents of the route information table include: train running direction information, train property information, route number information of the train and information of the train from the route to the corresponding station track.

10. An automatic generation system of a route information table based on depth-first, comprising:

the image acquisition module is used for acquiring a signal plane layout image;

11. The system for automatically generating a depth-first-based routing information table according to claim 10, wherein the model building module is specifically configured to:

12. The system according to claim 10, wherein the primitive processing module is specifically configured to:

13. The system for automatically generating a depth-first-based routing information table according to any one of claims 10 to 12, wherein the generating module is specifically configured to: