Program and information processing method

Abstract

To extract an appropriate breadcrumb list.SOLUTION: A processing unit 12, based on screen information 20, 21, 22,...including a link from a screen to another screen, with a first screen belonging to a highest hierarchy among a plurality of screens indicated by the screen information 20, 21, 22,... as a reference, determines a hierarchy to which each of the plurality of screens belongs. The processing unit 12 obtains a plurality of candidates for a route from the first screen to a second screen out of the plurality of screens, which is the route of screen transition represented by the link. The processing unit 12 extracts a route from the plurality of candidates based on at least one of: a first relationship between the hierarchy of a screen for a link source and the hierarchy of a screen for a link destination; and a second relationship between the screen of a link source according to the screen of a specific hierarchy corresponding to each screen of lower hierarchies than the specific hierarchy and the screen for the link destination. The processing unit 12 outputs a breadcrumb list 51 indicating the extracted route.SELECTED DRAWING: Figure 1

Description

[Technical Field]

[0001] The present invention relates to a program and an information processing method. [Background technology]

[0002] A GUI (Graphical User Interface) screen may include a breadcrumb list. A breadcrumb list is a list of identification information for the screens that are the main link sources for the screen the user is viewing. An example of a screen is a web page. A web page includes hyperlinks for transitioning to other web pages. For example, by including a breadcrumb list on each web page in a website that has multiple web pages, the user can easily understand where the web page they are viewing is located within the entire website.

[0003] Considerations have been made for using information processing devices to support the generation of breadcrumb lists. For example, a server has been proposed that manages screen transition information for generating breadcrumb lists and screen data for each screen separately. With the proposed server, even if the screen transition order is changed or added, there is no need to modify the data for each screen, and the amount of data that needs to be modified or changed can be reduced compared to a method of managing the data for each screen with the breadcrumb list embedded.

[0004] There has also been a proposal for a web page providing device that provides "forward," "back," and "interrupt" buttons on a web page and stores a list of return destinations for each web page based on a task flow that represents the overall structure of the site in a tree structure. The proposed web page providing device analyzes request information such as "forward" and "back" sent from the user terminal, and based on the determined request information, obtains candidate web page transition destinations using the task flow and return list information, and presents these to the user. [Prior art documents] [Patent documents]

[0005] [Patent Document 1] Japanese Patent Application Laid-Open No. 2014-215857 [Patent Document 2] Japanese Patent Application Laid-Open No. 2007-264893 Summary of the Invention [Problem to be solved by the invention]

[0006] It is conceivable to obtain the transitions between screens by analyzing screen information using an information processing device, and extract all possible transition routes leading to a certain screen as a breadcrumb list for that screen. However, this method may extract transition routes with little utility, such as transition routes that are estimated to be used infrequently by users, as breadcrumb lists.

[0007] In one aspect, the present invention aims to provide a program and an information processing method for extracting an appropriate breadcrumb list. [Means for solving the problem]

[0008] In one aspect, a program is provided that causes a computer to execute the following process: based on a plurality of screen information items including links from the screens to other screens, determine a hierarchical level to which each of the plurality of screens indicated by the plurality of screen information belongs, using a first screen that belongs to the highest hierarchical level among the plurality of screens indicated by the plurality of screen information as a reference; obtain a plurality of candidates for a route of screen transition indicated by links, which route leads from the first screen to a second screen among the plurality of screens; extract a route from the plurality of candidates based on at least one of a first relationship between the hierarchical level of the link source screen and the hierarchical level of the link destination screen, which is included in each of the plurality of candidates, and a second relationship between the link source screen and the link destination screen according to a screen of a specific hierarchical level corresponding to each screen of a hierarchical level lower than the specific hierarchical level; and output a breadcrumb trail indicating the extracted route.

[0009] Also, in one aspect, an information processing method is provided. [Effects of the Invention]

[0010] On the one hand, it can extract the appropriate breadcrumbs. [Brief explanation of the drawings]

[0011] [Figure 1] FIG. 1 is a diagram illustrating an information processing apparatus according to a first embodiment. [Figure 2] FIG. 10 illustrates an example of hardware of an information processing apparatus according to a second embodiment. [Figure 3] FIG. 10 is a diagram showing an example of a breadcrumb list display. [Figure 4] FIG. 2 is a diagram illustrating an example of functions of an information processing device. [Figure 5] FIG. 1 is a diagram illustrating an example of a folder tree of a website. [Figure 6] FIG. 10 is a diagram illustrating an example of a determination file. [Figure 7] FIG. 10 is a diagram illustrating an example of a transition destination table. [Figure 8] FIG. 10 is a diagram showing an example of link relationships on a screen. [Figure 9] FIG. 10 is a diagram illustrating an example of a parent information table. [Figure 10] FIG. 10 is a diagram illustrating an example of a parent table. [Figure 11] FIG. 10 is a diagram illustrating an example of a layer number table. [Figure 12] FIG. 10 is a diagram illustrating an example of a classification table. [Figure 13] FIG. 10 is a diagram illustrating a first example of a record in a transition possibility table. [Figure 14] FIG. 10 is a diagram illustrating a second example of a record in the transition possibility table. [Figure 15] FIG. 10 is a diagram illustrating a third example of a record in the transition possibility table. [Figure 16] FIG. 10 is a diagram illustrating an example of a transition possibility table. [Figure 17] FIG. 10 is a diagram showing an example of link relationships and a hierarchical structure of a screen. [Figure 18] 10A and 10B are diagrams illustrating examples of screen transitions that are determined to be unacceptable based on a determination pattern. [Figure 19] FIG. 10 is a diagram illustrating an example of an extracted breadcrumb list. [Figure 20] FIG. 10 is a diagram illustrating an example of a breadcrumbs list table. [Figure 21] 10 is a flowchart illustrating an example of processing by the information processing device. [Figure 22] 10 is a flowchart illustrating an example of setting parent information in a hierarchy construction process. [Figure 23] 10 is a flowchart showing an example of parent setting in the hierarchy construction process. [Figure 24] 10 is a flowchart showing an example of setting hierarchical layer numbers in a hierarchical layer construction process. [Figure 25] 10 is a flowchart illustrating an example of classification setting in a hierarchy construction process. [Figure 26] 10 is a flowchart illustrating an example of a classification setting sub-process. [Figure 27] 10 is a flowchart illustrating an example of a determination pattern application process. [Figure 28] 10 is a flowchart illustrating an example of a breadcrumbs extraction process. [Figure 29] 10 is a flowchart illustrating an example of a breadcrumb extraction sub-process. DETAILED DESCRIPTION OF THE INVENTION

[0012] The present embodiment will be described below with reference to the drawings. [First embodiment] A first embodiment will be described.

[0013] FIG. 1 is a diagram illustrating an information processing apparatus according to a first embodiment. The information processing device 10 supports the generation of breadcrumbs for a screen. The information processing device 10 has a storage unit 11 and a processing unit 12. The storage unit 11 may be a volatile storage device such as a random access memory (RAM), or a non-volatile storage device such as a hard disk drive (HDD) or flash memory. The processing unit 12 may include a central processing unit (CPU), a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA), etc. The processing unit 12 may be a processor that executes a program. The "processor" may also be a collection of multiple processors (a multiprocessor).

[0014] The storage unit 11 stores multiple pieces of screen information. The screen information is information that defines a screen within a site. A site is a set of multiple pieces of screen information or a set of multiple screens indicated by the multiple pieces of screen information. The screen information includes links from the screen to other screens within the site. However, some of the multiple pieces of screen information may not include links to other screens. An example of a screen is a web page. In this case, the screen information is, for example, HTML (Hyper Text Markup Language) data. The HTML data includes hyperlinks for transitioning to other web pages. For example, the multiple pieces of screen information include screen information 20, 21, 22, .... The screen information 20, 21, 22, ... is screen information for eight screens identified by screen IDs (IDentifiers) "P0" to "P7". For example, the screen with screen ID "P0" is written as screen P0.

[0015] The processing unit 12 determines the hierarchical level to which each of the plurality of screens belongs based on the first screen that belongs to the highest hierarchical level among the plurality of screens indicated by the plurality of screen information. The first screen is, for example, the top screen of the site. The processing unit 12 may accept an input specifying the screen ID of the top screen, or may obtain the screen ID of the top screen based on the screen information 20, 21, 22, ...

[0016] Furthermore, the processing unit 12 may generate management information 30 for managing the screens linked to from each of the screens P0 to P7 based on the screen information 20, 21, 22, .... The management information 30 includes items for screen ID, path, and link destination. The screen ID is registered in the screen ID item. Information indicating the storage location of the screen information is registered in the path item. The storage location can be identified by, for example, a folder name or a directory name. The screen ID of the linked screen is registered in the link destination item.

[0017] For example, the management information 30 includes the following information: The path of screen P0 is " / ". " / " indicates the root. The link destinations of screen P0 are screens P1 and P2. The path of screen P1 is " / p1". " / p1" indicates the storage location p1 immediately under the root. The link destinations of screen P1 are screens P3 and P4. The path of screen P2 is " / p2". The link destinations of screen P2 are screens P4 and P5. The path of screen P3 is " / p1 / p3". " / p1 / p3" indicates the storage location p3 immediately under storage location p1. In this way, in the path, the slash symbol " / " indicates a storage location lower than the storage location in question. The link destinations of screen P3 are screens P4 and P6. The path of screen P4 is " / p1 / p4". The link destination of screen P4 is screen P6. The path of screen P5 is " / p2 / p5". The link destination of screen P5 is screen P7. The path of screen P6 is "p1 / p3 / p6". There is no screen that is a link destination of screen P6. In the diagram, no setting is represented by a hyphen symbol "-". The path of screen P7 is " / p2 / p5 / p7". The link destination of screen P7 is screen P4. Screen P0 is the top screen of screens P0 to P7. Screen P0 is an example of the first screen.

[0018] The processing unit 12 can obtain the link relationships of the screens P0 to P7 from the information on the link destinations of each screen in the management information 30. For example, a graph 40 shows the link relationships of the screens P0 to P7. In the graph 40, nodes indicated by circles represent screens, and edges indicated by arrows represent links. The link relationships in the graph 40 are simply the screens connected by links.

[0019] The processing unit 12 determines the hierarchical level of each of the screens P0 to P7. In this example, the hierarchical levels are represented by a combination of the letter "L" and a number. The smaller the number, the higher the hierarchical level. Hierarchical level L1 is the highest hierarchical level.

[0020] For example, first, the processing unit 12 determines the hierarchical level of the first screen, i.e., screen P0, as L1. Then, the processing unit 12 follows the links from screen P0 to identify each screen in order, and acquires the higher-level screen corresponding to the storage location one level higher in the path of the screen. The processing unit 12 adds 1 to the hierarchical level number of the higher-level screen, and sets the hierarchical level number of the relevant screen to that number. If the hierarchical levels for all screens have not been determined after identifying each screen in order, the processing unit 12 repeats the above process for the screens for which the hierarchical levels have not been determined, thereby determining the hierarchical levels of all screens.

[0021] As a result, the processing unit 12 determines, for example, screen P0 as layer L1, screens P1 and P2 as layer L2, screens P3, P4 and P5 as layer L3, and screens P6 and P7 as layer L4. Graph 41 shows the link relationships and layers of screens P0 to P7.

[0022] The processing unit 12 acquires a plurality of candidates for a screen transition route represented by a link, the route leading from a first screen to a second screen among the plurality of screens. The processing unit 12 selects a route from the plurality of candidates based on a first relationship between the hierarchy of the link source screen and the hierarchy of the link destination screen included in each of the plurality of candidates. In addition to or instead of the first relationship, the processing unit 12 may select a route from the plurality of candidates based on a second relationship between the link source screen and the link destination screen according to a screen of a specific hierarchy corresponding to each screen of a hierarchy lower than the specific hierarchy. The processing unit 12 outputs a breadcrumb trail indicating the selected route.

[0023] For example, the processing unit 12 obtains a group of route candidates 50 for the screen P6. The processing unit 12 can obtain the group of route candidates 50 from the screen information 20, 21, 22, ... or the management information 30. The group of route candidates 50 includes the following multiple candidates for the route from the screen P0 to the screen P6:

[0024] The first candidate is "P0>P1>P3>P6". Here, ">" indicates a link or transition from the screen on the left of the symbol, i.e., the link source screen, to the screen on the right, i.e., the link destination screen. The second candidate is "P0>P1>P3>P4>P6". The third candidate is "P0>P1>P4>P6". The fourth candidate is "P0>P2>P4>P6". The fifth candidate is "P0>P2>P5>P7>P4>P6".

[0025] The processing unit 12 may extract a route from the first to fifth candidates based on the first relationship. For example, the processing unit 12 uses first and second criteria corresponding to the first relationship to extract the route.

[0026] The first criterion is that transitions from a lower hierarchy to a higher hierarchy are not permitted. The screen content tends to become more detailed as the hierarchy moves from higher to lower. Conversely, the converse direction, from lower to higher, runs counter to the detailed screen content and does not match the order in which the user views the screen. The second criterion is that transitions within the same hierarchy are not permitted. If a redundant route is presented to the user, it may actually make it more difficult to understand the current location. The combination of the first and second criterion can also be said to permit only transitions from a higher hierarchy to a lower hierarchy. The processing unit 12 excludes from the route candidate group 50 candidates that include transitions that are not permitted by the first and second criterion.

[0027] For example, the processing unit 12 excludes the fifth candidate "P0>P2>P5>P7>P4>P6" based on the first criterion. This is because the transition "P7>P4" included in the fifth candidate corresponds to a transition from a lower hierarchical level to a higher hierarchical level. Furthermore, the processing unit 12 excludes the second candidate "P0>P1>P3>P4>P6" based on the second criterion. This is because the transition "P3>P4" included in the second candidate corresponds to a transition within the same hierarchical level. Note that the processing unit 12 may use only either the first criterion or the second criterion.

[0028] The processing unit 12 may extract a route from the first to fifth candidates based on a second relationship in addition to or instead of the first relationship. For example, the processing unit 12 uses a third determination criterion corresponding to the second relationship to extract a route. The third determination criterion is a determination criterion for determining the relationship between a link source screen and a link destination screen based on a screen at a specific level higher than the link source screen that corresponds to the link source screen, and a screen at a specific level higher than the link destination screen that corresponds to the link destination screen. More specifically, the processing unit 12 determines a first classification of the link source screen based on a screen at a specific level corresponding to the link source screen. Furthermore, the processing unit 12 determines a second classification of the link destination screen based on a screen at a specific level corresponding to the link destination screen. The third determination criterion is that if the first classification and the second classification match, a transition from the link source screen to the link destination screen is permitted, and if they do not match, the transition is not permitted.

[0029] For example, the path of a screen at a specific level and the path of a screen lower than the specific level correspond to each other. That is, the processing unit 12 can classify levels lower than the specific level using the path of the screen at the specific level. This is because the content of each screen on a site can be classified by the content of a screen at a specific level higher to some extent. For example, the processing unit 12 determines level L2 in the graph 41 as a specific level. The processing unit 12 can classify screens P3 to P7 at levels L3 and L4 lower than level L2 using the path " / p1" of screen P1 and the path " / p2" of screen P2. Specifically, the processing unit 12 classifies screens P1, P3, P4, and P6 into " / p1" and screens P2, P5, and P7 into " / p2." The processing unit 12 then excludes screens in levels L3 and L4 lower than the specific level L2 from the route candidate group 50 that include transitions between screens of different classifications. For example, the processing unit 12 excludes the fourth candidate "P0>P2>P4>P6" based on the third criterion. This is because the transition "P2>P4" included in the fourth candidate corresponds to a transition between screens of different categories. Furthermore, the processing unit 12 excludes the fifth candidate "P0>P2>P5>P7>P4>P6" based on the third criterion. This is because the transition "P7>P4" included in the fifth candidate corresponds to a transition between screens of different categories.

[0030] Therefore, when using all of the above first, second, and third criteria, for example, the processing unit 12 extracts the routes "P0>P1>P3>P6" and "P0>P1>P4>P6" from the route candidate group 50. Then, the processing unit 12 outputs a breadcrumb trail 51 indicating the routes "P0>P1>P3>P6" and "P0>P1>P4>P6" for the screen P6. The processing unit 12 can also extract breadcrumb trails for screens other than the screen P6.

[0031] According to the information processing device 10, based on a plurality of screen information pieces including links from the screen to other screens, the hierarchy to which each of the plurality of screens belongs is determined with reference to a first screen belonging to the highest hierarchy among the plurality of screens indicated by the plurality of screen information pieces. A plurality of candidates for the route of the screen transition represented by the link, which route leads from the first screen to a second screen among the plurality of screens, are acquired. A route is selected from the plurality of candidates based on at least one of a first relationship between the hierarchy of the link source screen and the hierarchy of the link destination screen included in each of the plurality of candidates, and a second relationship between the link source screen and the link destination screen according to a screen of a specific hierarchy corresponding to each screen of a hierarchy lower than the specific hierarchy. A breadcrumb trail indicating the selected route is output.

[0032] This allows the information processing device 10 to extract an appropriate breadcrumb list. Here, it is conceivable to obtain the transitions between screens by analyzing the screen information using the information processing device 10, and extract all patterns of transition routes leading to a certain screen as a breadcrumb list for that screen. However, with this method, transition routes with little utility, such as transition routes that are estimated to be used less frequently by users, may be extracted as breadcrumb lists.

[0033] Therefore, the processing unit 12 can exclude routes that are not useful by selecting a route from a plurality of candidates based on at least one of the first relationship and the second relationship. For example, as described above, the processing unit 12 can use the first criterion to exclude routes that do not match the normal order in which a user browses screens. Furthermore, the processing unit 12 can use the second criterion to exclude redundant routes. Furthermore, the processing unit 12 can use the third criterion to exclude routes that connect screens that are not closely related in content.

[0034] For example, the processing unit 12 may receive a user input indicating which of the first to third criteria to use, and select a route from multiple candidates based on the input. Furthermore, the processing unit 12 may receive a user input regarding a specific hierarchy for determining the classification based on the third criterion. This allows the information processing device 10 to extract an appropriate breadcrumb list based on the user's desired criterion.

[0035] The functions of the information processing device 10 will be described in more detail below using more specific examples. [Second embodiment] Next, a second embodiment will be described.

[0036] FIG. 2 illustrates an example of hardware of an information processing apparatus according to the second embodiment. The information processing device 100 is a server computer that supports the generation of a breadcrumb trail. The information processing device 100 has a CPU 101, a RAM 102, an HDD 103, a GPU (Graphics Processing Unit) 104, an input interface 105, a medium reader 106, and a NIC (Network Interface Card) 107. The CPU 101 is an example of the processing unit 12 of the first embodiment. The RAM 102 or the HDD 103 is an example of the storage unit 11 of the first embodiment.

[0037] The CPU 101 is a processor that executes program instructions. The CPU 101 loads at least a portion of the programs and data stored in the HDD 103 into the RAM 102 and executes the programs. The CPU 101 may include multiple processor cores. The information processing device 100 may also have multiple processors. The processing described below may be executed in parallel using multiple processors or processor cores. A set of multiple processors may also be called a "multiprocessor" or simply a "processor."

[0038] The RAM 102 is a volatile semiconductor memory that temporarily stores programs executed by the CPU 101 and data used in calculations by the CPU 101. Note that the information processing device 100 may include a type of memory other than a RAM, or may include multiple memories.

[0039] The HDD 103 is a nonvolatile storage device that stores software programs such as an OS (Operating System), middleware, and application software, as well as data. Note that the information processing device 100 may also include other types of storage devices, such as a flash memory or an SSD (Solid State Drive), or may include multiple nonvolatile storage devices.

[0040] The GPU 104 outputs an image to a display 61 connected to the information processing device 100 in accordance with an instruction from the CPU 101. The display 61 may be any type of display, such as a CRT (Cathode Ray Tube) display, a liquid crystal display (LCD: Liquid Crystal Display), a plasma display, or an organic EL (OEL: Organic Electro-Luminescence) display.

[0041] The input interface 105 acquires an input signal from an input device 62 connected to the information processing device 100 and outputs the signal to the CPU 101. The input device 62 may be a pointing device such as a mouse, a touch panel, a touch pad, or a trackball, a keyboard, a remote controller, or a button switch. In addition, multiple types of input devices may be connected to the information processing device 100.

[0042] The medium reader 106 is a reading device that reads programs and data recorded on the recording medium 63. For example, a magnetic disk, an optical disk, a magneto-optical disk (MO: Magneto-Optical disk), a semiconductor memory, etc. can be used as the recording medium 63. Magnetic disks include flexible disks (FD: Flexible Disks) and HDDs. Optical disks include compact discs (CDs) and digital versatile discs (DVDs).

[0043] The medium reader 106 copies programs and data read from the recording medium 63 to another recording medium such as the RAM 102 or the HDD 103. The read programs are executed by the CPU 101, for example. The recording medium 63 may be a portable recording medium, which may be used to distribute programs and data. The recording medium 63 and the HDD 103 may also be referred to as computer-readable recording media.

[0044] The NIC 107 is an interface that is connected to the network 64 and communicates with other computers via the network 64. The NIC 107 is connected to a communication device such as a switch or a router by a cable. The NIC 107 may also be a wireless communication interface.

[0045] FIG. 3 is a diagram showing an example of a breadcrumb list display. The information processing device 100 or another information processing device functions as a web server and provides a client computer with a web page corresponding to the GUI screen 200. The information processing device 100 or another information processing device provides the client computer with, for example, an HTML file as screen information for the screen 200. The client computer functions as a web browser and displays the screen 200 on a display connected to the client computer. The screen 200 may be displayed in a single window. For example, the screen 200 is a screen named "Node Information" screen that belongs to a certain website. The screen 200 includes a breadcrumb list 201. The breadcrumb list 201 indicates the location of the screen 200 on the website. For example, the breadcrumb list 201 indicates the screen transition route from a top screen named "Construction" to the screen 200 named "Node Information" screen. The breadcrumb list 201 is an example showing two route patterns. The breadcrumb list 201 may also show one or more route patterns leading to the corresponding screen.

[0046] The information processing device 100 supports the generation of a breadcrumb trail to be displayed on a GUI screen such as the screen 200. FIG. 4 is a diagram illustrating an example of functions of the information processing device.

[0047] The information processing device 100 has a storage unit 110, a screen information registration unit 120, a hierarchy construction unit 130, a judgment pattern application unit 140, and a breadcrumb list extraction unit 150. The storage unit 110 uses the storage areas of the RAM 102 and the HDD 103. The CPU 102 executes programs stored in the RAM 102 to fulfill the functions of the screen information registration unit 120, the hierarchy construction unit 130, the judgment pattern application unit 140, and the breadcrumb list extraction unit 150.

[0048] The storage unit 110 stores screen information for each screen on a website. The storage unit 110 also stores a table showing the hierarchical structure of the screen obtained by analyzing the screen information, a breadcrumb list table showing the breadcrumb list extracted for each screen, etc. The storage unit 110 also stores a determination file used to obtain the hierarchical structure of the screen and extract the breadcrumb list.

[0049] The screen information registration unit 120 extracts the path of each screen and the screen to which it is linked based on the screen information of each screen, and generates a table indicating the transition destination of each screen. The hierarchy construction unit 130 determines the hierarchy of each screen based on the table indicating the transition destination of each screen and the information in the judgment file, and registers it in the table indicating the hierarchy of each screen. The hierarchy of a screen is represented by a hierarchy number. The smaller the hierarchy number, the higher the hierarchy, and the larger the hierarchy number, the lower the hierarchy.

[0050] The determination pattern application unit 140 determines whether or not a transition between screens is possible based on the table indicating the hierarchy of each screen and the information in the determination file, and registers the determination result in a table indicating whether or not a transition between screens is possible.

[0051] The breadcrumb list extraction unit 150 extracts a screen transition route obtained by following the transitionable links from the top screen of the website to each screen based on a table indicating whether transitions between screens are possible, as a breadcrumb list for that screen. The breadcrumb list extraction unit 150 outputs the extracted breadcrumb list. For example, the breadcrumb list extraction unit 150 may transmit the extracted breadcrumb list to another information processing device. The breadcrumb list extraction unit 150 may insert information of the breadcrumb list extracted for a certain screen into the screen information of that screen.

[0052] FIG. 5 is a diagram showing an example of a folder tree of a website. The folder tree 300 illustrates an example of the folder structure of a website. One folder in the folder tree 300 corresponds to one screen. One folder holds GUI source files, such as HTML files, used to display the corresponding screen, i.e., screen information. For example, in an HTML file, <a href="".. / Management / All / #node{{data.nodeid}}”" target=""_self”" ng-show=""data.nodelink”"> {{data.nodename}}" Like, The tag describes a hyperlink.

[0053] The root of the folder tree 300 is a folder that stores the screen information of the top screen. The root is written as " / ". Each folder under the root is written as a path with the folder name separated by " / ". Furthermore, from the top screen to the lower folders, there are major categories, medium categories, and minor categories, with more detailed screens stored in lower folders. Note that folders may also be called directories.

[0054] FIG. 6 is a diagram illustrating an example of the determination file. The judgment file 111 is stored in advance in the storage unit 110. The judgment file 111 includes judgment pattern setting information 111a and layer judgment information 111b.

[0055] The determination pattern setting information 111a indicates a determination pattern to be used when extracting a breadcrumb list from the hierarchical structure of a screen, and includes items such as pattern #, determination pattern, and use flag.

[0056] The pattern # field contains the identification number of the judgment pattern. The judgment pattern field contains the content of the judgment pattern. The usage flag field contains a flag indicating whether the judgment pattern in question is to be used to extract a breadcrumb list. The judgment pattern is information indicating the judgment criteria used by the judgment pattern application unit 140 to narrow down the transitions between allowable screens. The usage flag "TRUE" indicates that the judgment pattern in question is to be used. The usage flag "FALSE" indicates that the judgment pattern in question is not to be used.

[0057] For example, the judgment pattern setting information 111a has a record with a pattern # of "1," a judgment pattern of "transition from a lower hierarchical level to a higher hierarchical level is not possible," and a usage flag of "TRUE." This record indicates that the judgment pattern "transition from a lower hierarchical level to a higher hierarchical level is not possible," which corresponds to the pattern # of "1," is used to extract a breadcrumb trail.

[0058] The judgment pattern setting information 111a also has a record with a pattern # "2," a judgment pattern "transition to the same hierarchical level is not possible," and a usage flag "TRUE." This record indicates that the judgment pattern "transition to the same hierarchical level is not possible," which corresponds to pattern #2, is used to extract a breadcrumb list.

[0059] Furthermore, the judgment pattern setting information 111a has a record of pattern # "3", judgment pattern "transition to different classification not possible", and usage flag "TRUE". This record indicates that the judgment pattern "transition to different classification not possible" corresponding to pattern #3 is used to extract a breadcrumb trail.

[0060] Although the judgment pattern setting information 111a shows an example in which all patterns #1 to #3 are used, it is possible to use at least one of patterns #1 to #3. In the following description, for example, the judgment pattern of pattern #1 will be expressed as judgment pattern #1.

[0061] The hierarchical determination information 111b holds information used when determining the hierarchical level of each screen. The hierarchical determination information 111b includes items of item name and value. The item name is registered in the item name field. The value to be set for the item name is registered in the value field.

[0062] For example, the hierarchical level determination information 111b has a record with the item name "Level to determine classification" and the value "3." This record indicates that, for determination pattern #3 in the determination pattern setting information 111a, the numeric value indicating the specific level for classifying a screen or the level to which that screen belongs is "3." In this case, levels "4" and below, which are lower than level "3," or screens at those levels, are classified according to the path of the screen at level "3."

[0063] The hierarchical level determination information 111b also has a record with the item name "Lowest Modal Level" and the value "100." This record indicates that the numerical value indicating the lowest modal level is "100." In this case, the modal level is represented by a numerical value equal to or greater than "100." The lowest modal level can also be said to be the smallest value of the modal level number.

[0064] Here, a modal is a screen or window that displays a screen that, while the modal is displayed, prevents operations other than those related to the modal. A modal is the final destination for operations to confirm data or to confirm the execution of processing. Depending on the content displayed in the modal, transitions to a modal may occur from various screens, regardless of classification. Transitions may also occur from one modal to another.

[0065] Modal screens are screens that use a different transition system than normal screens. For this reason, the hierarchy construction unit 130 and the judgment pattern application unit 140 treat modal screens differently from normal screens. Specifically, the following conditions must be met for extracting breadcrumb lists related to modal screens. The first condition is that the transition to a modal screen is a necessary transition for the breadcrumb list regardless of the screen category from which it is opened. The second condition is that the transition from a modal screen to a non-modal screen, i.e., a normal screen, is not necessary for the breadcrumb list. Furthermore, all modal screen information is stored in the folder " / modal."

[0066] FIG. 7 illustrates an example of a transition destination table. The transition destination table 112 is generated by the screen information registration unit 120 based on the screen information of each screen, and is stored in the storage unit 110. The transition destination table 112 includes items such as number, screen, path, and transition destination.

[0067] In the number field, a screen number that identifies the screen is registered. In the screen field, the name of the screen, i.e., the screen name, is registered. In the path field, the path of the screen information corresponding to the screen is registered. In the transition destination field, the screen to which the screen will transition is registered. Multiple transition destination screens may be registered for one screen. In order to distinguish between multiple transition destinations, the transition destination table 112 includes multiple transition destination fields, such as transition destination 1, transition destination 2, ...

[0068] For example, the transition destination table 112 has a record of number "1", screen "TOP", path " / ", transition destination 1 "a", and transition destination 2 "g". This record indicates that the path of screen "TOP" of screen number "1" is " / ", and the transition destination screens are screens "a" and "g". Note that while an example is shown in which a screen name is registered as the transition destination, a screen number may also be registered as the transition destination. In the other tables shown below, screen numbers may also be registered instead of screen names in items other than screen items. Note that in the figures, a hyphen symbol "-" is entered where no setting is made. Records of other screens are also registered in the transition destination table 112.

[0069] The screen information registration unit 120 may extract the screen number of each screen from the screen information of that screen, or may assign a screen number to each screen according to a predetermined method such as the order of registration in the transition destination table 112. The screen information registration unit 120 may also extract the screen name and path of each screen from the screen information of that screen.

[0070] Here, the information on the transition destination in the transition destination table 112 indicates the link relationship between the screens. FIG. 8 is a diagram showing an example of link relationships on the screen. Graph 400 illustrates the link relationships between screens based on the transition destination information in transition destination table 112. Nodes represented by ellipses or rectangles in graph 400 indicate screens. Edges represented by arrows indicate links. In this example, the website has a total of 17 screens. Of these, 14 are normal screens. The shape of the nodes for normal screens is oval. There are three modal screens. The shape of the modal nodes is square. Of the normal screens, the name of the top screen is "TOP." Of the normal screens, the names of screens other than the top screen are "a" to "j." The names of the modal screens are "α," "β," and "γ."

[0071] The hierarchy construction unit 130 sets parent information for each screen in the transition destination table 112 based on the above link relationships. FIG. 9 is a diagram illustrating an example of a parent information table.

[0072] The parent information table 113 is generated by the hierarchy construction unit 130 based on the transition destination table 112 and stored in the storage unit 110. The parent information table 113 includes a parent information item in addition to each item in the transition destination table 112. The parent information is information that indicates the parent screen of the relevant screen, i.e., the link source screen. The linked screen can be called a child screen with respect to the parent. Multiple parent screens may be registered for one screen. To distinguish between multiple parents, the parent information table 113 includes multiple parent items, such as parent 1, parent 2, ...

[0073] For example, when the hierarchy construction unit 130 detects screen a as the transition destination of the top screen based on the parent information table 113, it adds "TOP" to the parent information of screen a. Also, for example, when the hierarchy construction unit 130 detects screen f as the transition destination of screen c based on the parent information table 113, it adds "c" to the parent information of screen f. Furthermore, for example, when the hierarchy construction unit 130 detects screen f as the transition destination of screen e based on the parent information table 113, it adds "e" to the parent information of screen f.

[0074] Parent information is similarly set for other screens in parent information table 113. Next, hierarchy construction unit 130 sets the original parent of each screen based on parent information table 113. The original parent corresponds to a parent screen in the parent folder of a certain screen in the folder structure of screen information.

[0075] FIG. 10 is a diagram showing an example of this parent table. This parent table 114 is generated by the hierarchy construction unit 130 based on the parent information table 113 and stored in the storage unit 110. This parent table 114 includes each item in the parent information table 113 as well as a parent item. There is one parent for each screen. However, no parent is set for the top screen or modal.

[0076] For example, the hierarchy construction unit 130 determines the original parent of a certain screen as follows: First, the hierarchy construction unit 130 searches backward for the path string of the screen of interest and separates it at the first " / " it finds. For example, the hierarchy construction unit 130 separates the path " / aaa / bbb / mmm" of the screen m of interest into " / aaa / bbb" and " / mmm". Next, the hierarchy construction unit 130 searches the parent information for a screen that matches the path string in the preceding part of the separated section. For example, the hierarchy construction unit 130 searches the original parent table 114 for screen b whose path matches " / aaa / bbb". Then, the hierarchy construction unit 130 sets the matching screen b in the original parent table 114 as the original parent of the screen m of interest.

[0077] Similar parents are set for other screens in parent table 114. Next, based on parent table 114, hierarchy construction section 130 sets the hierarchy number of the hierarchy to which each screen belongs.

[0078] FIG. 11 is a diagram illustrating an example of a layer number table. The hierarchical level number table 115 is generated by the hierarchical level construction unit 130 based on the parent table 114, and is stored in the storage unit 110. The hierarchical level number table 115 includes a hierarchical level number field in addition to each field of the parent table 114. There is one hierarchical level number for one screen.

[0079] For example, the hierarchy construction unit 130 determines the hierarchy number of a certain screen as follows: First, the hierarchy construction unit 130 references the path of the screen, and if the path is " / modal", determines the hierarchy for the modal screen, and if not, determines the hierarchy for the normal screen.

[0080] The hierarchy of a normal screen is determined as follows: The hierarchy construction unit 130 assigns the hierarchy number "1" to a screen that has no parent. The hierarchy construction unit 130 assigns the hierarchy number of a screen that has a parent to "the hierarchy number of the parent + 1." If the hierarchy number of the parent has not yet been determined, the hierarchy construction unit 130 skips it and moves on to determining the hierarchy number of another screen.

[0081] The hierarchical level of a modal is determined as follows: For a modal that does not have a parent modal, the hierarchy construction unit 130 sets the hierarchical level number of the modal to a value that is sufficiently large relative to the hierarchical level number of the normal screen. A value that is sufficiently large relative to the hierarchical level number of the normal screen is set in advance in the hierarchical level determination information 111b as the value of the modal's lowest hierarchical level. In this example, the value of the lowest hierarchical level of a modal is "100." For a modal that has a parent modal, the hierarchy construction unit 130 sets the value to "the maximum hierarchical level number of the parent + 1." If the hierarchical level number of the parent has not been determined, the hierarchy construction unit 130 skips it and moves on to determining the hierarchical level number of another screen.

[0082] The hierarchy construction unit 130 then repeatedly executes the above-described hierarchy determination for normal screens and hierarchy determination for modal screens until hierarchy numbers for all screens have been determined. For example, the hierarchy construction unit 130 sets the hierarchical number of the top screen to "1" according to the above procedure. The hierarchy construction unit 130 sets the hierarchical number of screen a, which has the top screen as its original parent, to "2." The hierarchy construction unit 130 sets the hierarchical number of screen c, which has screen a as its original parent, to "3." The hierarchy construction unit 130 sets the hierarchical number of screen f, which has screen c as its original parent, to "4."

[0083] The hierarchical numbers for the other screens are similarly set in the hierarchical number table 115. Next, the hierarchical construction unit 130 sets the classification of each screen based on the hierarchical number table 115. FIG. 12 is a diagram illustrating an example of a classification table.

[0084] Here, after several transitions from the top screen, the classification of the screen contents, such as the target function, is determined. In this example website, the classification is determined after two transitions, that is, on the screen of the hierarchical level with hierarchical level number 3. This hierarchical level number 3 is set in advance in the hierarchical level determination information 111b as the hierarchical level at which the classification is determined.

[0085] The classification table 116 is generated by the hierarchy construction unit 130 based on the hierarchy number table 115 and stored in the storage unit 110. The classification table 116 includes classification items in addition to the items in the hierarchy number table 115. There is one classification for one screen.

[0086] For example, the hierarchy construction unit 130 determines the classification of a certain screen as follows: For screens with hierarchy numbers 3 or less, the hierarchy construction unit 130 sets the own screen as the classification. For screens with hierarchy numbers 4 or more but less than 100, the hierarchy construction unit 130 traces back to the parent in order until it reaches hierarchy number 3, and sets the screen with hierarchy number 3 as the classification. The hierarchy construction unit 130 sets the classification of screens with hierarchy numbers 100 or more to "100". In the figure, the classification "100" is written as "modal".

[0087] For example, the hierarchical number of screen a is 2. Therefore, the hierarchy construction unit 130 sets the classification of screen a to "a." Furthermore, the hierarchical number of screen α is 100. Therefore, the hierarchy construction unit 130 sets the classification of screen α to "modal." Furthermore, the hierarchical number of screen j is 5. Therefore, the hierarchy construction unit 130 traces back from screen j to its parent and obtains screen h, which has hierarchical number 3. Then, the hierarchy construction unit 130 sets the classification of screen j to "h."

[0088] Classifications for other screens are similarly set in the classification table 116. Next, the determination pattern application unit 140 sets whether or not a transition is possible for the transition destination of each screen based on the classification table 116 and the determination pattern setting information 111a. Specifically, for each screen transition in the classification table 116, if the hierarchy construction unit 130 determines that the screen transition should be excluded based on any of the determination patterns to be used in the determination pattern setting information 111a, the hierarchy construction unit 130 sets "NG" (transition not possible) for the transition destination. Then, the hierarchy construction unit 130 sets "OK" (transition possible) for screen transitions for which "NG" was not set.

[0089] FIG. 13 is a diagram illustrating a first example of a record in the transition possibility table. The transition possibility table 117 is generated by the determination pattern application unit 140 based on the classification table 116 and stored in the storage unit 110. The transition possibility table 117 includes an option item for each transition destination in addition to each item in the classification table 116. For example, the transition possibility table 117 includes options 1, 2, and so on for transition destination 1, transition destination 2, and so on. In these options items, the determination results of whether or not a transition from the corresponding screen to the transition destination screen is possible are registered. The determination pattern application unit 140 determines whether or not a transition is possible based on the determination pattern setting information 111a.

[0090] 13 shows an example of setting whether or not a transition is possible based on determination pattern #1, i.e., "transition from a lower layer to a higher layer is not possible." Note that blank spaces in the figure indicate areas where whether or not a transition is possible has not been set.

[0091] For example, the determination pattern application unit 140 identifies screen m, the transition destination of screen l, based on the transition feasibility table 117. The hierarchical level number of screen l is 5. The hierarchical level number of screen m is 4. Therefore, based on determination pattern #1, the determination pattern application unit 140 sets "NG" in the feasibility field for the transition destination "m" of screen l.

[0092] FIG. 14 is a diagram illustrating a second example of a record in the transition possibility table. 14 shows an example of setting transition feasibility based on determination pattern #2, i.e., "transition to the same hierarchical level is not permitted." For example, the determination pattern application unit 140 identifies screen m, the transition destination of screen e, based on the transition feasibility table 117. The hierarchical level numbers of screen e and screen m are both 4. Therefore, based on determination pattern #2, the determination pattern application unit 140 sets "NG" in the feasibility field for the transition destination "m" of screen e.

[0093] FIG. 15 is a diagram illustrating a third example of a record in the transition possibility table. FIG. 15 shows an example of setting transition feasibility based on judgment pattern #3, i.e., "transition to a different classification is not permitted." For example, the judgment pattern application unit 140 identifies screen j, the transition destination of screen f, based on the transition feasibility table 117. The classification of screen f is "c." The classification of screen j is "h." Therefore, based on judgment pattern #3, the judgment pattern application unit 140 sets "NG" in the feasibility field for the transition destination "j" of screen f.

[0094] FIG. 16 is a diagram illustrating an example of a transition possibility table. 13 to 15, the determination pattern application unit 140 determines whether or not a transition from each screen to a transition destination screen is possible, and sets "OK" in the transition destination possibility field for any screen that is not marked "NG." As a result, the determination pattern application unit 140 obtains the transition possibility table 117 shown in FIG.

[0095] Here, the information on the transition destination and the layer number of the screen in the transition possibility table 117 indicate the link relationship and layer structure of the screen. FIG. 17 is a diagram showing an example of link relationships and hierarchical structures of screens.

[0096] A graph 401 illustrates the link relationships between screens based on the information on the transition destination in the transition possibility table 117 and the hierarchical level numbers to which each screen belongs. The top screen belongs to the hierarchical level with hierarchical number 1. Screens a and g belong to the hierarchical level with hierarchical number 2. Screens b, c, and h belong to the hierarchical level with hierarchical number 3. Screens e, f, i, and m belong to the hierarchical level with hierarchical number 4. Screens j, k, and l belong to the hierarchical level with hierarchical number 5. Screen d belongs to the hierarchical level with hierarchical number 6. Screens α and γ belong to the hierarchical level with hierarchical number 100. Screen β belongs to the hierarchical level with hierarchical number 101.

[0097] According to the transition feasibility table 117, of the transitions indicated by the links between screens in graph 401, the following transitions are "NG." That is, the transitions are "NG" for the transition from screen b to screen c, the transition from screen c to screen e, the transition from screen e to screens f and m, the transition from screen f to screen j, the transition from screen k to screen f, the transition from screen l to screen m, the transition from screen m to screen e, and the transition from screen β to screen j. In the drawing, the transitions for which "NG" is set are marked with a cross mark "X" indicating that the transition is not possible.

[0098] Here, according to each determination pattern in the determination pattern setting information 111a, the following screen transitions are determined to be "NG," that is, not possible. FIG. 18 is a diagram showing an example of a screen transition that is determined to be unacceptable based on the determination pattern.

[0099] Sitemap 500 illustrates an example of the screen configuration of a certain website. Sitemap 500 has a tree-like screen configuration, with a top screen at the top and divided into sections by function. Directly below the top screen are function A screen, function B screen, and function C screen. Directly below function A screen are function A1 screen, function A2 screen, and function A3 screen. Functions A1, A2, and A3 are subdivisions of function A. Directly below function B screen are function B1 screen and function B2 screen. Functions B1 and B2 are subdivisions of function B. Directly below function C screen is function C1 screen. Function C1 is a subdivision of function C. Function C1-1 is a subdivision of function C1. For example, function A1 screen, function A2 screen, and function A3 screen belong to the hierarchy directly below function A screen. Furthermore, for example, function A1 screen, function A2 screen, and function A3 screen are classified as function A screen. The function B1 screen and the function B2 screen are classified as function B screens. The function C1 screen and the function C1-1 screen are classified as function C screens.

[0100] The determination pattern application unit 140 disallows screen transitions from a lower hierarchical level to a higher hierarchical level based on determination pattern #1. This allows the determination pattern application unit 140 to exclude routes including transitions that go against the order in which the user views the screens, i.e., by gradually tracing the screens to check the details. For example, the determination pattern application unit 140 excludes routes including a transition from the function A1 screen to the function A screen based on determination pattern #1.

[0101] Here, the screen transitions that should be included in the breadcrumb list basically proceed in the direction that makes the content more specific. For example, on a website that supports device management, the screen that the user references transitions to detailed information about the devices to be managed. The direction of this transition is movement from a higher level to a lower level, and judgment pattern #1 rejects screen transitions that go in the opposite direction. For example, in a parent-child screen, a transition from a child screen to a parent screen is rejected. Even in cases where there is no direct parent-child relationship, a transition from a detailed classification screen to a larger classification screen or a transition from a screen with detailed information about individual items to a screen displaying a list is rejected.

[0102] Furthermore, the determination pattern application unit 140 disables transitions between screens at the same hierarchical level based on determination pattern #2. This allows the determination pattern application unit 140 to eliminate redundant routes to a certain screen. For example, based on determination pattern #2, the determination pattern application unit 140 excludes a route that includes a transition from the function A2 screen to the function A3 screen.

[0103] Here, the hierarchical number should increase as the user progresses in more detailed directions along the route to a certain screen. Transitions to the same hierarchical level may take a longer route to the target screen, so judgment pattern #2 rejects such transitions. For example, transitions to screens in a parallel relationship, such as menus or tabs displayed on the same screen, are rejected. Also, transitions to screens in the same hierarchical level, even if they are not in a parallel relationship, may be rejected.

[0104] Furthermore, the determination pattern application unit 140 disallows transitions between screens of different classifications based on determination pattern #3. This allows the determination pattern application unit 140 to exclude routes that connect screens that are not closely related in content. For example, based on determination pattern #3, the determination pattern application unit 140 excludes routes that include a transition from the function B2 screen to the function C1-1 screen.

[0105] Here, if the screens transitioned from the top screen several times between two screens are different, they can be considered to be screens of different classifications. Transitioning to a screen of a different classification is a wasteful route to the target screen. For this reason, judgment pattern #3 rejects transitions to a different classification below a specific hierarchy. For example, a transition to a screen with a different function for referencing related information of a certain screen is rejected. As another example, if the judgment pattern application unit 140 classifies a screen displaying a list of events as "events" and a screen displaying detailed information about a node as "management," it rejects transitions between the "events" screen and the "management" screen.

[0106] FIG. 19 is a diagram showing an example of an extracted breadcrumb list. The breadcrumb extraction unit 150 extracts a breadcrumb for each screen based on the transition possibility table 117. For example, the breadcrumb extraction unit 150 extracts a breadcrumb for screen f based on the transition possibility table 117 as follows.

[0107] First, the breadcrumb list extraction unit 150 identifies parent 1 "c" of screen f. Next, the breadcrumb list extraction unit 150 identifies that the transition possibility (possibility 2) of transition destination "f" for screen c is "OK". Then, the breadcrumb list extraction unit 150 identifies parent 1 "a" of screen c.

[0108] Next, the breadcrumb list extraction unit 150 determines whether the transition destination "c" for the screen a is "OK" (transition possibility 2). Then, the breadcrumb list extraction unit 150 determines the parent 1 "TOP" of the screen a.

[0109] Next, the breadcrumb list extraction unit 150 determines that the transition possibility (possibility 1) of the transition destination "a" to the top screen is "OK." As a result, the breadcrumb list extraction unit 150 extracts "TOP>a>c>f" as the breadcrumb list for screen f.

[0110] In this way, the breadcrumb extraction unit 150 traces back the transitions with the transition possibility "OK" from the corresponding screen and extracts the reverse order of the route that can reach the top screen as the breadcrumb for the corresponding screen.

[0111] FIG. 20 is a diagram illustrating an example of a breadcrumbs table. The breadcrumb list table 118 is generated by the breadcrumb list extraction unit 150 based on the transition possibility table 117 and stored in the storage unit 110. The breadcrumb list table 118 includes items of number, screen, and breadcrumb list. The number item registers a screen number that identifies a screen. The screen item registers a screen name. The breadcrumb list item registers the breadcrumb list for that screen.

[0112] For example, the breadcrumbs table 118 includes a record with the number "1," the screen "TOP," and the breadcrumbs "TOP." This record indicates that the breadcrumbs for the top screen are "TOP."

[0113] The breadcrumbs table 118 also includes a record with the number "2," the screen "a," and the breadcrumbs "TOP>a." This record indicates that the breadcrumbs for the screen a are "TOP>a."

[0114] Breadcrumbs for other screens are also registered in the breadcrumb table 118. Also, for one screen, breadcrumbs indicating multiple routes from the TOP screen to that screen may be registered. In the example of the breadcrumb table 118, multiple routes are registered as breadcrumbs for screen d and screen α.

[0115] For example, the breadcrumb extraction unit 150 may insert the extracted breadcrumb into the screen information of each screen registered in the breadcrumb table 118. Then, the breadcrumb is displayed on the screen displayed on the display device based on the screen information.

[0116] Next, a processing procedure of the information processing device 100 will be described. In the processing procedure shown below, a case where a screen number, rather than a screen name, is used as the setting values ​​of the original parent, parent information, classification, and transition destination of each table is exemplified. The screen number can be associated with the screen name based on the setting values ​​of the number item and the screen item in the transition destination table 112, for example.

[0117] FIG. 21 is a flowchart illustrating an example of processing by the information processing device. (S1) The screen information registration unit 120 generates the transition destination table 112 from the GUI source file of the website for which the breadcrumbs are to be generated, that is, from the screen information.

[0118] (S2) The hierarchy construction unit 130 executes hierarchy construction processing based on the determination file 111 and the transition destination table 112. Through the hierarchy construction processing, the hierarchy construction unit 130 generates a parent information table 113, a main parent table 114, a hierarchy number table 115, and a classification table 116. The hierarchy construction processing will be described in detail later.

[0119] (S3) The determination pattern application unit 140 executes a determination pattern application process based on the determination file 111 and the classification table 116. Through the determination pattern application process, the determination pattern application unit 140 generates a transition possible / impossible table 117. Details of the determination pattern application process will be described later.

[0120] (S4) The breadcrumb list extraction unit 150 executes a breadcrumb list extraction process based on the transition possibility table 117. The breadcrumb list extraction unit 150 generates a breadcrumb list table 118 through the breadcrumb list extraction process. The breadcrumb list extraction unit 150 outputs the breadcrumb list table 118. Then, the processing of the information processing device 100 ends.

[0121] FIG. 22 is a flowchart showing an example of setting parent information in the hierarchy construction process. The hierarchy construction process corresponds to step S2. (S10) The hierarchy construction unit 130 acquires the determination file 111. The determination file 111 is pre-stored in the storage unit 110. Furthermore, based on the transition destination table 112, the hierarchy construction unit 130 generates a parent information table 113 in which the parent information item is blank, i.e., unset.

[0122] (S11) The hierarchy construction unit 130 sets m=1. (S12) The hierarchy construction unit 130 determines whether or not screen number m exists based on the parent information table 113. If screen number m exists, the hierarchy construction unit 130 proceeds to step S13. If screen number m does not exist, the hierarchy construction unit 130 generates a main parent table 114 with the main parent field left blank based on the parent information table 113, and proceeds to step S19 in FIG.

[0123] (S13) The hierarchy constructor 130 sets n=1. (S14) The hierarchy construction unit 130 determines whether or not there is a setting for the transition destination n of screen number m, based on the parent information table 113. If there is a setting for the transition destination n, the hierarchy construction unit 130 proceeds to step S15. If there is no setting for the transition destination n, the hierarchy construction unit 130 proceeds to step S18.

[0124] (S15) The hierarchy constructing unit 130 refers to the screen number set as the transition destination n of the screen number m. (S16) The hierarchy constructing unit 130 sets m to the parent information of the referenced screen number in the parent information table 113.

[0125] (S17) The hierarchy construction unit 130 sets n to n + 1. Then, the hierarchy construction unit 130 proceeds to step S14. (S18) The hierarchy construction unit 130 sets m to m + 1. Then, the hierarchy construction unit 130 proceeds to step S12.

[0126] In this way, the hierarchy construction unit 130 sequentially searches the records of each screen and adds the transition source screen as parent information to the transition destination screen record. The hierarchy construction unit 130 can register multiple parent screens for a given screen.

[0127] FIG. 23 is a flowchart showing an example of parent setting in the hierarchical construction process. (S19) The hierarchy construction unit 130 sets i=1. (S20) The hierarchy construction unit 130 determines whether or not the screen number i exists based on the parent table 114. If the screen number i exists, the hierarchy construction unit 130 proceeds to step S21. If the screen number i does not exist, the hierarchy construction unit 130 generates a layer number table 115 with the layer number field blank based on the parent table 114, and proceeds to step S30 in FIG.

[0128] (S21) The hierarchy construction unit 130 determines whether the path of screen number i is " / " or " / modal". If the path of screen number i is " / " or " / modal", the hierarchy construction unit 130 proceeds to step S22. If the path of screen number i is neither " / " nor " / modal", the hierarchy construction unit 130 proceeds to step S23.

[0129] (S22) The hierarchy construction unit 130 sets NULL to the original parent of the screen number i in the original parent table 114. Then, the hierarchy construction unit 130 advances the process to step S29. (S23) The hierarchy construction unit 130 sets A=(the position of the last " / " in the path of screen number i).

[0130] (S24) The hierarchy constructing unit 130 sets B=(a character string obtained by deleting the latter half of A in the path of screen number i). (S25) The hierarchy constructor 130 sets j=1.

[0131] (S26) The hierarchy construction unit 130 determines whether the path of the screen number j is equal to B. If the path of the screen number j is equal to B, the hierarchy construction unit 130 proceeds to step S28. If the path of the screen number j is not equal to B, the hierarchy construction unit 130 proceeds to step S27.

[0132] (S27) The hierarchy construction unit 130 sets j to j + 1. Then, the hierarchy construction unit 130 proceeds to step S26. (S28) The hierarchy constructing unit 130 sets j as the original parent of the screen number i in the original parent table 114.

[0133] (S29) The hierarchy construction unit 130 sets i to i + 1. Then, the hierarchy construction unit 130 proceeds to step S20. FIG. 24 is a flowchart showing an example of setting hierarchical layer numbers in hierarchical layer construction processing.

[0134] (S30) The hierarchy construction unit 130 sets m = 0. The hierarchy construction unit 130 also sets i = 1. In the procedure of Fig. 24, m is the count number of screens whose hierarchy numbers have been confirmed. (S31) The hierarchy construction unit 130 determines whether the hierarchical number of the screen number i has been determined based on the hierarchical number table 115. If the hierarchical number of the screen number i has not been determined, the hierarchy construction unit 130 proceeds to step S32. If the hierarchical number of the screen number i has been determined, the hierarchy construction unit 130 proceeds to step S42.

[0135] (S32) The hierarchy construction unit 130 determines whether the original parent of the screen number i is NULL based on the hierarchy number table 115. If the original parent of the screen number i is not NULL, the hierarchy construction unit 130 proceeds to step S33. If the original parent of the screen number i is NULL, the hierarchy construction unit 130 proceeds to step S35.

[0136] (S33) The hierarchy construction unit 130 determines whether the hierarchical number of the original parent of screen number i has been confirmed, based on the hierarchical number table 115. If the hierarchical number of the original parent of screen number i has been confirmed, the hierarchy construction unit 130 proceeds to step S34. If the hierarchical number of the original parent of screen number i has not been confirmed, the hierarchy construction unit 130 proceeds to step S42.

[0137] (S34) The hierarchy construction unit 130 sets the hierarchy number of the screen number i to the hierarchy number of the parent + 1 in the hierarchy number table 115. Then, the hierarchy construction unit 130 proceeds to step S41.

[0138] (S35) The hierarchy construction unit 130 determines whether the path of the screen number i is " / modal" based on the hierarchy number table 115. If the path of the screen number i is not " / modal", the hierarchy construction unit 130 proceeds to step S36. If the path of the screen number i is " / modal", the hierarchy construction unit 130 proceeds to step S37.

[0139] (S36) The hierarchy construction unit 130 sets the hierarchy number of the screen number i to 1 in the hierarchy number table 115. Then, the hierarchy construction unit 130 proceeds to step S41. (S37) The hierarchy construction unit 130 determines whether or not a modal exists in the parent of screen number i, based on the hierarchy number table 115. If a modal does not exist in the parent of screen number i, the hierarchy construction unit 130 proceeds to step S38. If a modal exists in the parent of screen number i, the hierarchy construction unit 130 proceeds to step S39.

[0140] (S38) Based on the hierarchical determination information 111b, the hierarchical construction unit 130 sets the hierarchical number of the screen number i to 100 in the hierarchical number table 115. Then, the hierarchical construction unit 130 proceeds to step S41.

[0141] (S39) The hierarchy construction unit 130 determines whether or not there is a parent modal whose hierarchical level is undetermined for the screen number i, i.e., whose hierarchical level number is undetermined, based on the hierarchical level table 115. If there is no parent modal whose hierarchical level is undetermined for the screen number i, the hierarchy construction unit 130 proceeds to step S40. If there is a parent modal whose hierarchical level is undetermined for the screen number i, the hierarchy construction unit 130 proceeds to step S42.

[0142] (S40) The hierarchy construction unit 130 sets the hierarchy number of the screen number i to the maximum value of the parent hierarchy number + 1 in the hierarchy number table 115. Then, the hierarchy construction unit 130 proceeds to step S41.

[0143] (S41) The hierarchy construction unit 130 sets m=m+1. (S42) Hierarchy construction unit 130 determines whether m is equal to the total number of screens. If m is not equal to the total number of screens, hierarchy construction unit 130 proceeds to step S43. If m is equal to the total number of screens, hierarchy construction unit 130 generates classification table 116 with blank classification items based on hierarchy number table 115, and proceeds to step S46 in FIG. 25.

[0144] (S43) The hierarchy construction unit 130 determines whether i=the total number of screens. If i=not the total number of screens, the hierarchy construction unit 130 proceeds to step S44. If i=the total number of screens, the hierarchy construction unit 130 proceeds to step S45.

[0145] (S44) The hierarchy construction unit 130 sets i to i + 1. Then, the hierarchy construction unit 130 proceeds to step S31. (S45) The hierarchy construction unit 130 sets i to 1. Then, the hierarchy construction unit 130 proceeds to step S31.

[0146] FIG. 25 is a flowchart showing an example of classification setting in the hierarchy construction process. (S46) The hierarchy constructor 130 sets m=1. (S47) The hierarchy construction unit 130 determines whether or not the screen number m exists based on the classification table 116. If the screen number m exists, the hierarchy construction unit 130 proceeds to step S48. If the screen number m does not exist, the hierarchy construction unit 130 ends the hierarchy construction process.

[0147] (S48) The hierarchy construction unit 130 executes a classification setting sub-process. The argument that serves as input to the classification setting sub-process is m. Details of the classification setting sub-process will be described later. (S49) The hierarchy construction unit 130 sets m to m + 1. Then, the hierarchy construction unit 130 proceeds to step S47.

[0148] FIG. 26 is a flowchart showing an example of the classification setting sub-processing. The classification setting process corresponds to step S48. The input of the classification setting sub-process is represented as n.

[0149] (S100) The hierarchy construction unit 130 determines whether or not the classification for the screen number n has been set based on the classification table 116. If the classification for the screen number n has not been set, the hierarchy construction unit 130 proceeds to step S101. If the classification for the screen number n has been set, the hierarchy construction unit 130 ends the classification setting sub-processing.

[0150] (S101) Based on classification table 116 and hierarchical determination information 111b, hierarchy construction unit 130 determines whether the hierarchical number of screen number n is 3 or less. If the hierarchical number of screen number n is 3 or less, hierarchy construction unit 130 proceeds to step S102. If the hierarchical number of screen number n is not 3 or less, hierarchy construction unit 130 proceeds to step S103.

[0151] (S102) The hierarchy construction unit 130 sets n to the classification of the screen number n in the classification table 116. Then, the hierarchy construction unit 130 ends the classification setting sub-processing. The return value of the classification setting sub-processing is the classification of the screen number n.

[0152] (S103) Based on classification table 116 and hierarchical determination information 111b, hierarchy construction unit 130 determines whether the hierarchical number of screen number n is 100 or greater. If the hierarchical number of screen number n is 100 or greater, hierarchy construction unit 130 proceeds to step S104. If the hierarchical number of screen number n is not 100 or greater, hierarchy construction unit 130 proceeds to step S105.

[0153] (S104) The hierarchy construction unit 130 sets 100 to the classification of the screen number n in the classification table 116. The classification value 100 corresponds to "modal." The hierarchy construction unit 130 then ends the classification setting sub-processing. The return value of the classification setting sub-processing is the classification of the screen number n.

[0154] (S105) The hierarchy constructing unit 130 sets α=(the parent screen number of screen number n). (S106) The hierarchy construction unit 130 executes a classification setting sub-process. The argument that serves as an input to the classification setting sub-process is α. That is, the hierarchy construction unit 130 executes the classification setting sub-process recursively.

[0155] (S107) Hierarchy construction unit 130 sets the return value of step S106 to the classification of screen number n in classification table 116. Then, hierarchy construction unit 130 ends the classification setting sub-processing. The return value of the classification setting sub-processing is the classification of screen number n.

[0156] In this way, the hierarchy construction unit 130 recursively executes the classification setting sub-process to trace the parent of each screen up to a specific hierarchy, thereby determining the classification of each screen according to the screen at that specific hierarchy, and setting this in the classification table 116.

[0157] FIG. 27 is a flowchart showing an example of the determination pattern application process. The judgment pattern application process corresponds to step S3. The following describes an example of the procedure when the usage flags for judgment patterns #1 to #3 in judgment pattern setting information 111a of judgment file 111 are all "TRUE."

[0158] (S50) The determination pattern application unit 140 sets m to 1. Furthermore, based on the classification table 116, the determination pattern application unit 140 generates a transition possibility table 117 in which the possibility column for each transition destination is blank.

[0159] (S51) The determination pattern application unit 140 determines whether or not screen number m exists based on the transition possibility table 117. If screen number m exists, the determination pattern application unit 140 proceeds to step S52. If screen number m does not exist, the determination pattern application unit 140 ends the determination pattern application process.

[0160] (S52) The judgment pattern application unit 140 sets the layer number A=(layer number of screen number m). (S53) The determination pattern application unit 140 sets n=1.

[0161] (S54) The determination pattern application unit 140 sets the screen number x=(screen number of transition destination n of screen number m). (S55) The determination pattern application unit 140 determines whether or not the screen number x exists based on the transition possibility table 117. If the screen number x does not exist, the determination pattern application unit 140 proceeds to step S56. If the screen number x exists, the determination pattern application unit 140 proceeds to step S57.

[0162] (S56) The determination pattern application unit 140 sets m to m + 1. Then, the determination pattern application unit 140 proceeds to step S51. (S57) The determination pattern application unit 140 sets the layer number B=(layer number of screen number x).

[0163] (S58) The determination pattern application unit 140 determines whether or not layer number A is less than layer number B. If layer number A is less than layer number B, the determination pattern application unit 140 proceeds to step S59. If layer number A is greater than or equal to B, the determination pattern application unit 140 proceeds to step S62.

[0164] (S59) The determination pattern application unit 140 sets the classification C=(classification of screen number m) based on the transition possibility table 117. Also, the determination pattern application unit 140 sets the classification D=(classification of screen number x) based on the transition possibility table 117.

[0165] (S60) The determination pattern application unit 140 determines whether or not the classifications C and D are the same. If the classifications C and D are the same, the determination pattern application unit 140 proceeds to step S61. If the classifications C and D are not the same, the determination pattern application unit 140 proceeds to step S62.

[0166] In step S60, if category D is "3" or less, that is, if the category of screen number x indicates that it is a screen at a hierarchical level of hierarchical level "3" or less, the judgment pattern application unit 140 skips step S60 and proceeds to step S61.

[0167] Also, in step S60, if category D is "100", that is, if the category of screen number x is modal, the determination pattern application unit 140 skips step S60 and proceeds to step S61. The value of category D, "3" or "100", can change depending on the setting of the hierarchical determination information 111b.

[0168] (S61) The determination pattern application unit 140 sets "OK" to the possibility of the transition destination n of the screen number m in the transition possibility table 117. Then, the determination pattern application unit 140 proceeds to step S63.

[0169] (S62) The determination pattern application unit 140 sets "NG" to the possibility of the transition destination n of the screen number m in the transition possibility table 117. Then, the determination pattern application unit 140 proceeds to step S63.

[0170] (S63) The determination pattern application unit 140 sets n to n + 1. Then, the determination pattern application unit 140 proceeds to step S54. If determination pattern #1 is not used, the determination pattern application unit 140 determines in step S58 whether hierarchical number A≠hierarchical number B, and proceeds to step S59 if A≠B, and proceeds to step S62 if A=B. If determination pattern #2 is not used, the determination pattern application unit 140 determines in step S58 whether hierarchical number A≦hierarchical number B, and proceeds to step S59 if A≦B, and proceeds to step S62 if A>B. Furthermore, if determination pattern #3 is not used, the determination pattern application unit 140 skips steps S59 and S60 and proceeds to step S61.

[0171] FIG. 28 is a flowchart showing an example of a breadcrumbs extraction process. The breadcrumb list extraction process corresponds to step S4. (S70) The breadcrumb list extraction unit 150 sets m to 1. The breadcrumb list extraction unit 150 also generates a breadcrumb list table 118 in which the breadcrumb list items are left blank.

[0172] (S71) The breadcrumb list extraction unit 150 determines whether or not screen number m exists based on the transition possibility table 117. If screen number m exists, the breadcrumb list extraction unit 150 proceeds to step S72. If screen number m does not exist, the breadcrumb list extraction unit 150 ends the breadcrumb list extraction process. The breadcrumb list extraction unit 150 outputs a breadcrumb list table 118 in which breadcrumb lists for each screen are set.

[0173] (S72) The breadcrumb list extraction unit 150 initializes the array [temp breadcrumbs]. (S73) The breadcrumb extraction unit 150 executes a breadcrumb extraction sub-process. The input argument for the breadcrumb extraction sub-process is the screen number m. The details of the breadcrumb extraction sub-process will be described later.

[0174] (S74) The breadcrumb list extraction unit 150 sets m to m + 1. Then, the breadcrumb list extraction unit 150 proceeds to step S71. FIG. 29 is a flowchart showing an example of the breadcrumb extraction sub-process.

[0175] The breadcrumb extraction sub-process corresponds to step S73. The input for the breadcrumb extraction sub-process is represented as a screen number x. (S110) The breadcrumb extraction unit 150 adds the screen number x to the array [temp breadcrumbs].

[0176] (S111) The breadcrumb list extraction unit 150 determines whether the layer number of screen number x is 1 based on the transition possibility table 117. If the layer number of screen number x is 1, the breadcrumb list extraction unit 150 proceeds to step S112. If the layer number of screen number x is not 1, the breadcrumb list extraction unit 150 proceeds to step S115.

[0177] (S112) The breadcrumb extraction unit 150 sets the array T to the array [temp breadcrumbs] in reverse order. (S113) The breadcrumb extraction unit 150 adds the array T to the breadcrumb table 118 as one of the breadcrumbs for the screen number x.

[0178] (S114) The breadcrumb list extraction unit 150 deletes the end of the array [temp breadcrumbs]. This causes the breadcrumb list extraction unit 150 to return the array [temp breadcrumbs] to the state it had one level before. The breadcrumb list extraction unit 150 then ends the breadcrumb extraction sub-process, returns to the step that called the breadcrumb extraction sub-process, and proceeds to the next step of the calling step. The calling step is either step S73 or step S119, which will be described later.

[0179] (S115) The breadcrumb list extraction unit 150 sets n=1. (S116) The breadcrumb list extraction unit 150 determines whether the parent n of screen number x is NULL, that is, whether it is not set, based on the transition possibility table 117. If the parent n of screen number x is NULL, the breadcrumb list extraction unit 150 proceeds to step S114. If the parent n of screen number x is not NULL, the breadcrumb list extraction unit 150 proceeds to step S117.

[0180] (S117) The breadcrumb extraction unit 150 sets α=(screen number of parent n). (S118) The breadcrumb list extraction unit 150 determines whether the transition from screen number α to screen number x is "OK" based on the transition possibility table 117. If the transition from screen number α to screen number x is OK, the breadcrumb list extraction unit 150 proceeds to step S119. If the transition from screen number α to screen number x is NG, the breadcrumb list extraction unit 150 proceeds to step S120.

[0181] (S119) The breadcrumb list extraction unit 150 executes a breadcrumb extraction sub-process. The argument that serves as the input to the breadcrumb extraction sub-process is α. That is, the breadcrumb list extraction unit 150 executes the breadcrumb extraction sub-process recursively.

[0182] (S120) The breadcrumb list extraction unit 150 sets n to n + 1. Then, the breadcrumb list extraction unit 150 proceeds to step S116. In this way, the breadcrumbs extraction unit 150 generates the breadcrumbs table 118 based on the transition possibility table 117.

[0183] Incidentally, it is conceivable to obtain transitions between screens by analyzing screen information using the information processing device 100, and extract all possible transition routes leading to a certain screen as a breadcrumb list for that screen. However, with this method, transition routes with little utility, such as transition routes that are estimated to be used less frequently by users, may be extracted as breadcrumb lists.

[0184] Therefore, the information processing device 100 acquires a first relationship between the hierarchy of the link source screen and the hierarchy of the link destination screen included in the route from the top screen to the target screen. The information processing device 100 also acquires a second relationship between the link source screen and the link destination screen according to a specific hierarchy screen corresponding to each screen lower in the hierarchy than the specific hierarchy. The information processing device 100 can select a route from multiple candidates based on at least one of the first and second relationships, thereby eliminating unhelpful routes. In this way, the information processing device 100 can extract an appropriate breadcrumb list.

[0185] For example, by using determination pattern #1, the information processing device 100 can eliminate routes that do not match the normal order in which a user views screens. Furthermore, by using determination pattern #2, the information processing device 100 can eliminate redundant routes that lead to a certain screen. Furthermore, by using determination pattern #3, the information processing device 100 can eliminate routes that connect screens that are not closely related in terms of content.

[0186] That is, the information processing device 100 defines screen transitions as a hierarchical structure starting from a top screen using GUI source files that configure the screens, i.e., screen information. The information processing device 100 performs route analysis using the defined hierarchical structure and the relationships between screens, removes routes that are of little value to the user, and extracts only the necessary breadcrumbs.

[0187] The information processing device 100 may receive which of the above determination patterns #1 to #3 to use from the determination file 111, and select a route from multiple candidates based on the determination file 111. Furthermore, the information processing device 100 may receive input of a specific hierarchy for determining classification for determination pattern #3 from the determination file 111. This allows the information processing device 100 to extract an appropriate breadcrumb list based on the determination criteria desired by the user.

[0188] The information processing device 100 described above may execute the following process, for example. Based on a plurality of screen information pieces including links from the screens to other screens, the information processing device 100 determines the hierarchical level to which each of the plurality of screens belongs, based on a first screen belonging to the highest hierarchical level among the plurality of screens indicated by the plurality of screen information pieces. The information processing device 100 acquires a plurality of candidates for a route of screen transition represented by links, which route leads from the first screen to a second screen among the plurality of screens. The information processing device 100 extracts a route from the plurality of candidates based on at least one of a first relationship between the hierarchical level of the link source screen and the hierarchical level of the link destination screen included in each of the plurality of candidates, and a second relationship between the link source screen and the link destination screen according to a screen of a specific hierarchical level corresponding to each screen of a hierarchical level lower than the specific hierarchical level. The information processing device 100 outputs a breadcrumb trail indicating the extracted route.

[0189] This allows the information processing device 100 to extract an appropriate breadcrumb list. The top screen is an example of the first screen. The transition destination table 112 is an example of information indicating multiple candidates for the route from the first screen to the second screen.

[0190] The second relationship can also be said to be the relationship between the link source screen and the linked screen, which corresponds to the link source screen and is at a specific level higher than the level of the link source screen, and the link destination screen and corresponds to the linked screen and is at a specific level higher than the level of the linked destination screen.

[0191] Furthermore, for example, the first relationship includes a relationship as to whether or not the hierarchical level of the link source screen is higher than the hierarchical level of the link destination screen. In extracting routes based on the first relationship, the information processing device 100 excludes route candidates that include a transition in which the hierarchical level of the link source screen is higher than the hierarchical level of the link destination screen.

[0192] This allows the information processing device 100 to prevent unnecessary routes including transitions that go against the refinement of the screen from being acquired as a breadcrumb list. The determination pattern #1 in the determination pattern setting information 111a is an example of a determination pattern related to the first relationship.

[0193] Furthermore, for example, the first relationship includes a relationship as to whether the level of the link source screen and the level of the link destination screen are the same. In extracting routes based on the first relationship, the information processing device 100 excludes route candidates that include a transition in which the level of the link source screen is the same as the level of the link destination screen.

[0194] This prevents redundant routes from being acquired as breadcrumbs for a certain screen in the information processing device 100. The determination pattern #2 in the determination pattern setting information 111a is an example of a determination pattern relating to the first relationship.

[0195] For example, the second relationship includes a relationship as to whether a first classification of a link source screen corresponding to a screen at a specific level corresponding to the link source screen matches a second classification of a link destination screen corresponding to a screen at a specific level corresponding to the link destination screen. In extracting routes based on the second relationship, the information processing device 100 excludes route candidates including transitions where the first classification and the second classification do not match.

[0196] This allows the information processing device 100 to prevent unnecessary routes including transitions between screens that are not closely related in content from being acquired as a breadcrumb list. For example, a link source screen and a screen at a specific level corresponding to the link source screen are associated with each other by the paths of both screens. Also, a link destination screen and a specific screen corresponding to the link destination screen are associated with each other by the paths of both screens. Determination pattern #3 in the determination pattern setting information 111a is an example of a determination pattern related to the second relationship.

[0197] For example, the information processing device 100 may determine the first classification based on a first path of a screen at a specific level corresponding to the link source screen, the first path being included in the path of the link source screen. The information processing device 100 may also determine the second classification based on a second path of a screen at a specific level corresponding to the link destination screen, the second path being included in the path of the link destination screen. This allows the information processing device 100 to appropriately classify the link source screen and the link destination screen according to the structure of the folder tree that stores screen information on the site.

[0198] Alternatively, the second relationship may include a relationship as to whether a first path of a screen at a specific level corresponding to the link source screen and included in the path of the link source screen matches a second path of a screen at a specific level corresponding to the link destination screen and included in the path of the link destination screen. In extracting routes based on the second relationship, the information processing device 100 may exclude route candidates that include transitions in which the first path and the second path do not match.

[0199] This prevents unnecessary routes including transitions between screens that are not related in content from being acquired as a breadcrumb list in the information processing device 100. Furthermore, the information processing device 100 can appropriately classify link source screens and link destination screens according to the structure of the folder tree that stores screen information on the site.

[0200] Furthermore, in extracting a route based on the second relationship, the information processing device 100 excludes a transition in which the linked screen is modal from the targets for determining the second relationship. Here, depending on the content displayed in the modal, a modal may become a link destination for various screens regardless of classification. A transition linked to a modal may be a transition necessary for a breadcrumb list regardless of the classification of the link source screen. For this reason, the information processing device 100 can appropriately extract a breadcrumb list for a modal by excluding transitions in which the linked screen is a modal from the targets of determining the second relationship. Note that the information processing device 100 also excludes transitions linked to screens at a specific hierarchy and at a hierarchy higher than the specific hierarchy from the targets of determining the second relationship.

[0201] Furthermore, when determining the hierarchical level, the information processing device 100 determines the hierarchical level of the screen based on the path of the screen for which the hierarchical level is to be determined and the paths of screens in a higher hierarchical level than the screen that are included in the candidate routes to the screen. This allows the information processing device 100 to appropriately determine the hierarchical level to which each screen belongs.

[0202] In addition, the information processing device 100 may acquire data indicating whether or not to use each of the first relationship and the second relationship, and determine whether or not to use each of the first relationship and the second relationship to extract the route based on the data.

[0203] This allows the information processing device 100 to selectively use the first relationship and the second relationship depending on the input data. For example, a user can acquire a breadcrumb list by having the information processing device 100 use a desired relationship between the first relationship and the second relationship. Furthermore, the information processing device 100 can extract a breadcrumb list that is optimal for the user or the relevant site. The determination pattern setting information 111a is an example of the above data.

[0204] Furthermore, when the data indicates that the second relationship is used, the information processing device 100 may accept a user's designation of a specific hierarchy. This enables the information processing device 100 to classify each screen at the granularity desired by the user, and extract a breadcrumb list that is optimal for the user or the relevant site. The setting value of the "hierarchy that determines classification" in the hierarchy determination information 111b is an example of information that designates a specific hierarchy.

[0205] The information processing of the first embodiment can be realized by causing the processing unit 12 to execute a program. The information processing of the second embodiment can be realized by causing the CPU 101 to execute a program. The program can be recorded on a computer-readable recording medium 63.

[0206] For example, the program can be distributed by distributing recording medium 63 on which the program is recorded. Alternatively, the program may be stored in another computer and distributed via a network. For example, a computer may store (install) a program recorded on recording medium 63 or a program received from another computer in a storage device such as RAM 102 or HDD 103, and then read and execute the program from the storage device. [Explanation of symbols]

[0207] 10. Information processing equipment 11 Storage section 12 Processing section 20, 21, 22 Screen Information 30 Management information 40,41 Graph 50 Route Candidates 51 Breadcrumbs

Claims

1. determining a hierarchy to which each of the plurality of screens belongs based on a first screen belonging to the highest hierarchy among the plurality of screens indicated by the plurality of screen information pieces, the first screen being a first screen that belongs to the highest hierarchy among the plurality of screens indicated by the plurality of screen information pieces, and a plurality of candidates for a route of a screen transition represented by the link, the route being from the first screen to a second screen of the plurality of screens, are acquired, and the route is extracted from the plurality of candidates based on at least one of a first relationship between a hierarchy of a link source screen and a hierarchy of a link destination screen included in each of the plurality of candidates, and a second relationship between the link source screen and the link destination screen according to a screen of the specific hierarchy corresponding to each screen of a hierarchy lower than a specific hierarchy; outputting a breadcrumb trail showing the extracted route; A program that causes a computer to perform a process.

2. the first relationship includes a relationship as to whether the hierarchical level of the link source screen is higher than the hierarchical level of the link destination screen; In the extraction of the route based on the first relationship, route candidates including a transition in which the hierarchical level of the link source screen is higher than the hierarchical level of the link destination screen are excluded.

2. The program according to claim 1, which causes the computer to execute a process.

3. the first relationship includes a relationship as to whether or not the hierarchy of the link source screen and the hierarchy of the link destination screen are the same; In the extraction of the route based on the first relationship, route candidates including a transition in which the hierarchy of the link source screen is the same as the hierarchy of the link destination screen are excluded.

3. The program according to claim 1, which causes the computer to execute processing.

4. the second relationship includes a relationship between whether a first classification of the link source screen according to the screen at the specific level corresponding to the link source screen matches a second classification of the link destination screen according to the screen at the specific level corresponding to the link destination screen, and In the extraction of the route based on the second relationship, route candidates including transitions whose first classification and second classification do not match are excluded.

4. The program according to claim 1, which causes the computer to execute a process.

5. determining the first classification based on a first path of the screen at the specific level corresponding to the link source screen, the first path being included in the path of the link source screen; determining the second classification based on a second path of the screen at the specific hierarchy corresponding to the linked screen, the second path being included in the path of the linked screen; 5. The program according to claim 4, which causes the computer to execute processing.

6. In the extraction of the route based on the second relationship, a transition in which the linked screen is modal is excluded from the determination of the second relationship.

6. The program according to claim 4, which causes the computer to execute the process.

7. In determining the hierarchical level, the hierarchical level of the screen is determined based on a path of the screen to be determined and a path of a screen at a higher hierarchical level than the screen, which is included in the candidates of the route leading to the screen. The program according to any one of claims 1 to 6, which causes the computer to execute processing.

8. acquiring data indicating whether to use each of the first relationship and the second relationship, and determining whether to use each of the first relationship and the second relationship for extracting the route based on the data; The program according to any one of claims 1 to 7, which causes the computer to execute processing.

9. If the data indicates that the second relationship is to be used, accepting a user's designation of the particular hierarchy.

9. The program according to claim 8, which causes the computer to execute a process.

10. The computer determining a hierarchy to which each of the plurality of screens belongs based on a first screen belonging to the highest hierarchy among the plurality of screens indicated by the plurality of screen information pieces, the first screen being a first screen that belongs to the highest hierarchy among the plurality of screens indicated by the plurality of screen information pieces, and a plurality of candidates for a route of a screen transition represented by the link, the route being from the first screen to a second screen of the plurality of screens, are acquired, and the route is extracted from the plurality of candidates based on at least one of a first relationship between a hierarchy of a link source screen and a hierarchy of a link destination screen included in each of the plurality of candidates, and a second relationship between the link source screen and the link destination screen according to a screen of the specific hierarchy corresponding to each screen of a hierarchy lower than a specific hierarchy; outputting a breadcrumb trail showing the extracted route; Information processing methods.

Images