CN115510364A

CN115510364A - Page jump method and device, electronic equipment and storage medium

Info

Publication number: CN115510364A
Application number: CN202211390276.6A
Authority: CN
Inventors: 吉国昌
Original assignee: Agricultural Bank of China
Current assignee: Agricultural Bank of China
Priority date: 2022-11-08
Filing date: 2022-11-08
Publication date: 2022-12-23

Abstract

The invention discloses a page jump method, a page jump device, electronic equipment and a storage medium, wherein the method comprises the following steps: when a page jump event is monitored, identifying a starting page and a target page corresponding to the page jump event; checking a jump path from the starting page to the target page according to the target digraph; when the verification result is that the jump path is legal, determining the access state of the target page; and when the access state of the target page is inaccessible, jumping to a preset bottom-storing page. The invention can check the jump path by using the directed graph, thereby ensuring that the user access can jump according to the specified service flow strictly and avoiding the problem that the user can not jump to the expected page; in addition, when the page is inaccessible, the routing strategy is adjusted, and the page jumps to a preset bottom-of-pocket page, so that the problem of continuous error reporting is avoided, and the user experience is improved.

Description

Page jump method and device, electronic equipment and storage medium

Technical Field

The present invention relates to internet technologies, and in particular, to a page jump method and apparatus, an electronic device, and a storage medium.

Background

The H5 page is an HTML webpage which is written by using a hypertext 5.0 (Hypertext Markup Language 5, HTML5) standard and is adaptive to the mobile terminal, and the H5 page is used as a main presentation form of Internet application, has the characteristics of convenience and rapidness in development, easiness in integration and the like, and becomes an important form for providing services for external energization of open banks. In order to improve user experience and development efficiency, more and more H5 pages are developed in the form and technology of single-page applications, and a problem often existing in the single-page applications is the routing of the pages.

The single-page H5 application is easy to cause the problems that the management of routing events is improper and the expected page can not be jumped. In addition, the single-page H5 application adopts a deployment architecture with a front-end and a back-end separated, the front-end engineering is responsible for the presentation of the page, and the server is dedicated to provide services to the interface, so that a technical scheme of front-end routing is generally adopted, that is, the back-end server does not control the routing skip of the page any more. Therefore, when a serious problem occurs in part of services and cannot be recovered, the access of a user to a fault page cannot be isolated in time, once the user enters the page with the fault in the background service, errors are reported continuously, and the user experience and even customer complaints and other adverse effects are reduced.

Disclosure of Invention

The invention provides a page skipping method, a page skipping device, electronic equipment and a storage medium, which can ensure that a user can skip according to a specified service flow strictly when accessing, avoid the problem of continuous error reporting and improve user experience.

In a first aspect, the present invention provides a page jump method, where the method includes:

when a page jump event is monitored, identifying a starting page and a target page corresponding to the page jump event;

checking a jump path from the starting page to the target page according to the target directed graph;

when the verification result is that the jump path is legal, determining the access state of the target page;

and when the access state of the target page is inaccessible, jumping to a preset bottom page.

In a second aspect, the present invention provides a page jump apparatus, including:

the identification module is used for identifying a starting page and a target page corresponding to a page jump event when the page jump event is monitored;

the verification module is used for verifying a jump path from the starting page to the target page according to the target directed graph;

the determining module is used for determining the access state of the target page when the verification result is that the jump path is legal;

and the jump control module is used for jumping to a preset bottom page when the access state of the target page is inaccessible.

In a third aspect, the present invention provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, where the processor implements the page jump method according to any embodiment of the present invention when executing the computer program.

In a fourth aspect, the present invention provides a computer-readable storage medium, on which a computer program is stored, which when executed by a processor, implements a page jump method according to any of the embodiments of the present invention.

According to the scheme, when the page jump event is monitored, the starting page and the target page corresponding to the page jump event can be identified; checking a jump path from the starting page to the target page according to the target directed graph; when the verification result is that the jump path is legal, determining the access state of the target page; and jumping to a preset bottom page when the access state of the target page is inaccessible. The invention can check the jump path by using the directed graph, thereby ensuring that the user access can jump according to the specified service flow strictly and avoiding the problem that the user can not jump to the expected page; in addition, when the page is inaccessible, the routing strategy is adjusted, and the page jumps to the preset bottom-of-pocket page, so that the problem of continuous error reporting is avoided, and the user experience is improved.

Drawings

In order to more clearly illustrate the technical solution of the present invention, the drawings required in the embodiments will be briefly described below, it should be understood that the following drawings only illustrate some embodiments of the present invention, and therefore should not be considered as limiting the scope, and those skilled in the art can also obtain other related drawings based on the drawings without inventive efforts.

FIG. 1 is a schematic flow chart of a page jump method provided by the present invention;

FIG. 2a is another schematic flow chart of a page jump method provided by the present invention;

FIG. 2b is an exemplary diagram of a directed graph provided by the present invention;

FIG. 2c is a diagram of an exemplary adjacency list provided by the present invention;

FIG. 3 is a schematic structural diagram of a page jump apparatus provided in the present invention;

fig. 4 is a schematic structural diagram of an electronic device provided by the present invention.

Detailed Description

In order to make those skilled in the art better understand the technical solutions of the present invention, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be obtained by a person skilled in the art without making any creative effort based on the embodiments in the present invention, shall fall within the protection scope of the present invention.

It should be noted that the terms "first," "second," and the like in the description and claims of the present invention and in the drawings described above are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments of the invention described herein are capable of operation in sequences other than those illustrated or described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.

Fig. 1 is a schematic flowchart of a page jump method provided by the present invention, which can be executed by a page jump apparatus provided by the present invention, and the apparatus can be implemented by software and/or hardware. In a specific embodiment, the apparatus may be integrated in an electronic device, which may be, for example, a computer, and a page application client may be installed in the electronic device. The following embodiments will be described by taking as an example that the apparatus is integrated in an electronic device, and referring to fig. 1, the method may specifically include the following steps:

step 101, when a page jump event is monitored, identifying a starting page and a target page corresponding to the page jump event.

The page jump event may be triggered by a user operation, for example, by a user clicking on a current page or a sliding operation, and the page jump event may include an event of page forward, page backward, application exit, and the like. In the open banking service, the start page is a personal page of the user, and if the user selects to open a balance change notification service, the target page is determined to be a page for opening a balance change notification. The open bank platform is a platform for providing bank services to the outside in a more free, open, safe and efficient manner by taking user requirements as guidance, taking scene services as carriers, and taking integrated ecology and platform construction as targets. The financial products provided by the bank can be conveniently used by cooperating organizations or enterprises through Application Programming Interface (API), software Development Kit (SDK), H5 and other service forms, so that the financial service requirements of customers are better met, and the customer experience is further improved.

In particular, the page in the page jump event may be a single page H5 application page, a single page application that is a model of a web application or website that interacts with the user by dynamically rewriting the current page, rather than conventionally reloading the entire new page from a server. The method avoids interrupting user experience by switching between pages, and makes the application program more like a desktop application program. In single-page applications, all necessary source code files are loaded in a single page, or the relevant resources are dynamically loaded as needed (typically in response to user actions). Pages are not reloaded at any point in time during use by the user, nor is control transferred to other pages. In the specific implementation, when a page jump event is monitored, a starting page and a target page corresponding to the page jump event are identified, and the identification method may be to acquire starting page address information corresponding to the page jump event and target address information of a target H5 page requested to be jumped to, or a website of the webpage, a title of the webpage, an API of the webpage, and the like.

And 102, checking a jump path from the starting page to the target page according to the target directed graph.

Specifically, in discrete mathematics, a graph is a structure for representing a relationship between objects, the "objects" after mathematical abstraction are called nodes or vertices, and the correlation between nodes is called edges, wherein a graph with edges having directions is called a directed graph. Illustratively, a more rigorous definition of a directed graph is: one tuple G = (V, E), where V is the set of nodes; e is a collection of edges (also called directed edges, or arcs) in which the elements are ordered pairs of nodes. On an edge (x, y) from x to y, nodes x and y are referred to as the vertices of the edge, where x is the start or tail and y is the end or head. The out degree of a node refers to the number of edges with the starting point being the node; the degree of entry of a node refers to the number of edges whose endpoints are the node.

In specific implementation, each node of the target directed graph can represent a specific page, the directed edges represent a jump relationship between pages, and the target directed graph can be constructed in advance according to a business process and updated in real time or at regular time. When the jump path from the starting page to the target page is verified according to the target directed graph, whether the jump path from the starting page to the target page belongs to the jump path in the target directed graph or not can be judged, if yes, the jump path is legal, and if not, the jump path is illegal.

And 103, determining the access state of the target page when the verification result is that the jump path is legal.

The access state of the target page comprises an accessible state and an inaccessible state, an access control variable is configured for each page in the target directed graph, and the current access state of the corresponding page is recorded in the access control variable; in practical application, the access control variable of the target page can be queried in the target directed graph, so as to determine the access state of the target page.

In a specific implementation, in an initial state, all page interfaces are normal by default, and the client sets the access control variables of all pages to be accessible. When the page is loaded for the first time, the client can inquire the current latest state of each page from the server, and update the access control variable of each page according to the current latest state of each page, so that the latest state of the required page can be known when the directed graph is inquired each time.

And step 104, jumping to a preset bottom page when the access state of the target page is inaccessible.

The preset bottom-holding page refers to a replacement page which is preset by a user and aims at a fault page, is similar to an occupied page, a default page and the like, and can display content which is set in advance and is irrelevant to the fault, so that the phenomena of white screen and the like when the page jumps are avoided.

According to the scheme, when the page jump event is monitored, the starting page and the target page corresponding to the page jump event can be identified; checking a jump path from the starting page to the target page according to the target digraph; when the verification result is that the jump path is legal, determining the access state of the target page; and jumping to a preset bottom page when the access state of the target page is inaccessible. The invention can check the jump path by using the directed graph, thereby ensuring that the user access can jump according to the specified service flow strictly and avoiding the problem that the user can not jump to the expected page; in addition, when the page is inaccessible, the routing strategy is adjusted, and the page jumps to a preset bottom-of-pocket page, so that the problem of continuous error reporting is avoided, and the user experience is improved.

Fig. 2a is another schematic flow chart of the page jump method provided by the present invention, further illustrating the page jump method provided by the present invention, as shown in fig. 2a, the method may include the following steps:

step 201, determining jump paths among all pages according to the business process.

Specifically, the business process may be a processing logic designed for providing some services or businesses, and after each page is designed, each page may be organized according to the business process, so as to obtain a jump path between each page. The jump path can be composed of a single page or a plurality of pages, and each jump page is a node on the page jump path.

And 202, constructing a current directed graph according to jump paths among all pages.

Each node of the current directed graph can represent a specific page, directed edges represent the jump relationship between the pages, the directed edges starting from the nodes of the current page point to the pages which can be jumped, if directed edges pointing to each other exist between the nodes of the two pages, the two pages can be jumped to and returned from each other before, namely, the current directed graph comprises the jump paths between the pages. For example, the current directed graph may be as shown in fig. 2b, and the directed graph shown in fig. 2b includes 6 page nodes, where page 1 may jump to page 2, page 2 may jump to page 5, page 5 may jump to page 4, page 4 may jump to page 2, and page 3 may jump to page 5 and page 6.

In practical applications, the current directed graph can be implemented and stored using an adjacency list. The adjacency list is a data structure and is a storage structure combining sequential distribution and chain distribution, the sequential distribution storage structure stores each node, and if the vertex corresponding to the head node has an adjacent vertex, the adjacent vertex is sequentially stored in the unidirectional linked list pointed by the head node. Fig. 2c shows a specific implementation manner of the directed graph shown in fig. 2b, where the left side of fig. 2c represents a linear structure for storing specific information of each page, which may be implemented by an array or a linked list, each element of the linear structure is also referred to as a head element, each head element points to a linked list, the linked list stores indexes or pointers of all nodes to which the node of the page can jump, and the last node of the linked list points to a null pointer, which represents the end of the linked list. In the adjacency list shown in FIG. 2c, page 1 points to

pages

2 and 4, and page 3 points to

pages

6 and 5.

The current directed graph may be used for front-end routing. In world wide web (web) development, routing refers to allocating a route to a corresponding handler or page according to a Uniform Resource Locator (URL). Traditional server routing returns different web page contents according to different addresses requested by a client. The front-end routing means that a client browser can render different view pages according to different URLs without depending on a server. Front-end routing is essentially accomplished by detecting changes in the URL, intercepting the URL address, and then resolving to match routing rules.

In addition, in the current directed graph, an access control variable is configured for each page, and the current access state of the corresponding page is recorded in the access control variable. In an initial state, all pages are normal by default, and the client sets the access control variables of all pages to be accessible.

And step 203, acquiring the latest state of each page from the server.

The server can record the state of each page through monitoring of the server and the reported data of each client, wherein the state of each page comprises normal or abnormal. For example, the server may monitor whether an interface requesting the background under each page is normal, record that the corresponding page is normal if the interface is normal, and record that the corresponding page is abnormal if the interface is abnormal. In addition, the server can also provide a page state uploading interface, when each client accesses a page, if the page access is abnormal, an abnormal page can be reported to the server through the page state uploading interface, and if the number of reported abnormal times of a certain page exceeds the preset number within a period of time, the server can record the state of the page as abnormal.

In addition, the server can also provide a page state query interface for each client to query the state of the required page in real time or at regular time. The client can inquire the state of each page recorded by the server through the page state inquiry interface when the page is loaded for the first time or each time, so as to obtain the latest state of each page.

And step 204, determining abnormal pages according to the latest state of each page.

Specifically, the latest state of each page may include normal or abnormal, and a page whose latest state is abnormal may be determined as an abnormal page.

Step 205, setting the access control variable of the abnormal page in the current directed graph as inaccessible to obtain the target directed graph.

A normal page indicates that the page is accessible, and an exception page indicates that the page is not accessible. For a normal page, as the accessibility of the current directed graph is recorded initially, no processing can be performed; for the abnormal page, since the current directed graph is also accessible, which is recorded initially, the abnormal page needs to be updated here, that is, the access control variable of the abnormal page in the current directed graph is set to be inaccessible, and after the update, the target directed graph is obtained. Or comparing whether the state of each page recorded in the current directed graph is consistent with the latest state of the page determined by the data acquired from the server, and if the state is inconsistent, updating the state of the corresponding page according to the latest state of the page determined by the data acquired from the server.

In addition, when the current directed graph is updated, the fault page can be logically deleted, and all paths from the node of the fault page cannot be used. And an unavailable time can be set, and in the unavailable time, the operation of jumping to the fault page can be intercepted, and the operation of jumping to a preset pocket bottom page is displayed, so that a user-friendly prompt is presented. And the fault page and the jump path thereof are deleted by adjusting the directed graph in real time, so that the access of the fault page can be effectively isolated in real time.

And step 206, when the page jump event is monitored, identifying a starting page and a target page corresponding to the page jump event.

Specifically, when a page jump event is monitored, event configuration information may be queried to identify a start page and a target page corresponding to the page jump event. The event configuration information may include an identifier of a current page and an identifier of a target page to be skipped to, where the identifier of the current page may be a page name, and the identifier of the target page may be information such as a page name, a page API, a page address, and the like.

Step 207, determining whether the jump path belongs to the jump path in the target directed graph, if so, executing step 209, and if not, executing step 208.

And step 208, jumping to the illegal path and reporting an error.

Specifically, when the path does not belong to the path in the directed graph, it is determined that the jump path is illegal, and error reporting processing is performed. For example, an error may be reported through a pop-up window, and an error code corresponding to the illegal skip path may be displayed in a page popped up by the pop-up window.

Step 209, the jump path is legal, and it is determined whether the access state of the target page is accessible, if accessible, step 210 is executed, and if not, step 212 is executed.

Specifically, the client may query an access control variable of the target page in the target directed graph, so as to determine whether the access state of the target page is accessible.

And step 210, accessing the target page and obtaining an access result.

And step 211, reporting the target page abnormity to the server when the access result shows that the target page is abnormal.

For example, if the access result is a network anomaly, or the access result returns a status code, the status code hits a preset status code of a service fault, the target page anomaly may be determined, the target page anomaly may be reported to the server, and the identifier and the anomaly detail information of the target page may be carried during reporting, so that the server can record the anomaly. In this case, the query target directed graph determines that the target page can be accessed, but in the actual situation, the state of the target page is changed, so that the target page is found to be abnormal after being accessed.

And step 212, jumping to a preset bottom pocket page.

The preset bottom-holding page refers to a replacement page which is preset by a user and aims at a fault page, is similar to an occupied page, a default page and the like, and can display content which is set in advance and is irrelevant to the fault, so that the phenomena of white screen and the like when the page jumps can be avoided, the user can be induced to operate according to a correct business process, and the user experience is improved.

And step 213, after the preset time length, obtaining the latest state of the target page from the server.

The preset duration can be set according to the average fault repairing time of the current system, the operation of a user for jumping to the fault page can be intercepted within the preset duration, corresponding jumping is carried out according to the configured pocket bottom page, a user-friendly prompt page is displayed, and page state information cannot be requested from a server in the process; and after the preset duration is exceeded, the client acquires the latest state of the target page from the server again, namely, requests the page state from the server page state interface again.

In step 214, it is determined whether the latest status of the target page is normal. If the result is abnormal, the process returns to step 213 to continue the next query, and if the result is normal, step 215 is executed.

Namely, if the latest state of the target page is still abnormal, the target page needs to continue to wait for repair, and after a preset time, the latest state of the target page continues to be queried so as to determine whether the abnormality of the target page is removed.

Step 215, set the access control variable of the target page in the target directed graph as accessible.

Specifically, since the latest state of the target page obtained at this time is normal, the target page is identified to be already accessible, and the access state of the target page recorded in the target directed graph is still inaccessible, the access state of the target page needs to be updated in the target directed graph, and the access control variable of the target page in the target directed graph is set to be accessible, so that subsequent access to the target page can be smoothly performed.

According to the scheme, when the page jump event is monitored, the starting page and the target page corresponding to the page jump event can be identified; checking a jump path from the starting page to the target page according to the target digraph; when the verification result is that the jump path is legal, determining the access state of the target page; and when the access state of the target page is inaccessible, jumping to a preset bottom-storing page. The invention can check the jump path by using the directed graph, thereby ensuring that the user access can jump according to the specified service flow strictly and avoiding the problem that the user can not jump to the expected page; in addition, when the page is inaccessible, the routing strategy is adjusted, and the page jumps to the preset bottom-of-pocket page, so that the problem of continuous error reporting is avoided, and the user experience is improved.

In addition, in the prior art, a linear or tree-shaped storage structure is used for storing page routing, different pages are classified according to service levels, and are sequentially connected from the first page back and forth according to the levels. In the actual H5 application scenario, under the conditions of large service scale, numerous pages and complex jump relation, it is difficult for these data structures to efficiently represent and store page route jumps. The invention utilizes directed graph routing, the directed graph is composed of nodes and edges between the nodes, and for H5 single page application, pages can be represented by the nodes, and the routing relation between the pages can be represented by the directed edges. In the directed graph, a hierarchical relationship does not exist between all nodes, and a jump relationship can exist between any two pages, so that the page routing is more accurate and complete by using the directed graph to store the page routing.

Furthermore, the directed graph is adjusted according to the searched latest state of the page, so that the skipping of the fault page and the recovery after fault elimination are quickly isolated in real time, the comprehensive cost of the whole routing skipping algorithm is minimum, the visit of the fault page is isolated by using a friendly prompt page, the user experience is ensured to the maximum extent, and the occurrence of customer complaints is reduced. In addition, the algorithm provided by the invention can be designed and coded in an independent routing module at the front end and the back end, the configuration of related strategies and rules can be carried out in a configuration file, the service logic code does not need to be modified, the high cohesion and low coupling are ensured, the universality is good, and the development efficiency is high.

Fig. 3 is a schematic structural diagram of a page jump apparatus provided by the present invention, which is suitable for executing the page jump method provided by the present invention. As shown in fig. 3, the apparatus may specifically include:

the identifying module 301 is configured to identify a starting page and a target page corresponding to a page jump event when the page jump event is monitored;

a checking module 302, configured to check a jump path from the starting page to the target page according to a target directed graph;

a determining module 303, configured to determine an access state of the target page when the verification result indicates that the jump path is legal;

and the jump control module 304 is configured to jump to a preset bottom-of-pocket page when the access state of the target page is inaccessible.

In one embodiment, the apparatus further comprises:

the acquisition module is used for acquiring the latest state of each page from the server;

and the updating module is used for updating the current state of each page recorded in the current directed graph according to the latest state of each page to obtain the target directed graph.

In an embodiment, the update module is specifically configured to:

determining an abnormal page according to the latest state of each page;

and setting an access control variable of the abnormal page in the current directed graph as inaccessible to obtain the target directed graph.

In one embodiment, the obtaining module is further configured to: after a preset time length, acquiring the latest state of the target page from the server;

the updating module is further configured to set an access control variable of the target page in the target directed graph to be accessible if the latest state of the target page is normal.

In one embodiment, the apparatus further comprises:

the skip path determining module is used for determining skip paths among the pages according to the service flow;

and the construction module is used for constructing the current directed graph according to the jump paths among the pages, and the current directed graph comprises the jump paths among the pages and the current states of the pages.

In an embodiment, the verification module is specifically configured to:

determining whether the jump path belongs to a jump path in the target directed graph;

and when the jump path belongs to the jump path in the target directed graph, determining that the jump path is legal.

In one embodiment, the apparatus further comprises:

the access result acquisition module is used for acquiring an access result when the state of the target page is accessible;

and the reporting module is used for reporting the target page abnormity to a server when the access result shows that the target page is abnormal.

The device can identify the starting page and the target page corresponding to the page jump event when the page jump event is monitored; checking a jump path from the starting page to the target page according to the target digraph; when the verification result is that the jump path is legal, determining the access state of the target page; and when the access state of the target page is inaccessible, jumping to a preset bottom-storing page. The invention can check the jump path by using the directed graph, thereby ensuring that the user access can jump according to the specified service flow strictly and avoiding the problem that the user can not jump to the expected page; in addition, when the page is inaccessible, the routing strategy is adjusted, and the page jumps to a preset bottom-of-pocket page, so that the problem of continuous error reporting is avoided, and the user experience is improved.

The invention further provides an electronic device, which comprises a memory, a processor and a computer program stored on the memory and capable of running on the processor, wherein the processor executes the program to realize the page jump method provided by any one of the embodiments.

The invention also provides a computer readable medium, on which a computer program is stored, which when executed by a processor implements the page jump method provided by any of the above embodiments.

Referring now to FIG. 4, there is illustrated a schematic block diagram of a computer system 400 suitable for use in implementing the electronic device of the present invention. The electronic device shown in fig. 4 is only an example, and should not bring any limitation to the function and the scope of use of the present invention.

As shown in fig. 4, the computer system 400 includes a Central Processing Unit (CPU) 401 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM) 402 or a program loaded from a storage section 408 into a Random Access Memory (RAM) 403. In the RAM 403, various programs and data necessary for the operation of the system 400 are also stored. The CPU 401, ROM 402, and RAM 403 are connected to each other via a bus 404. An input/output (I/O) interface 405 is also connected to bus 404.

The following components are connected to the I/O interface 405: an input section 406 including a keyboard, a mouse, and the like; an output section 407 including a display device such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage section 408 including a hard disk and the like; and a communication section 409 including a network interface card such as a LAN card, a modem, or the like. The communication section 409 performs communication processing via a network such as the internet. A driver 410 is also connected to the I/O interface 405 as needed. A removable medium 411 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 410 as necessary, so that a computer program read out therefrom is mounted into the storage section 408 as necessary.

In particular, according to the embodiments of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 409, and/or installed from the removable medium 411. The computer program performs the above-described functions defined in the system of the present invention when executed by a Central Processing Unit (CPU) 401.

It should be noted that the computer readable medium shown in the present invention can be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of the present invention, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In contrast, in the present invention, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.

The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.

The modules and/or units described in the present invention can be implemented by software or hardware. The described modules and/or units may also be provided in a processor, which may be described as: a processor comprises an identification module, a verification module, a determination module and a skip control module. Wherein the names of the modules do not in some cases constitute a limitation of the module itself.

As another aspect, the present invention also provides a computer-readable medium that may be contained in the apparatus described in the above embodiments; or may be separate and not assembled into the device. The computer readable medium carries one or more programs which, when executed by a device, cause the device to comprise:

when a page jump event is monitored, identifying a starting page and a target page corresponding to the page jump event; checking a jump path from the starting page to the target page according to the target digraph; when the verification result is that the jump path is legal, determining the access state of the target page; and jumping to a preset bottom page when the access state of the target page is inaccessible.

According to the technical scheme of the invention, when the page jump event is monitored, the starting page and the target page corresponding to the page jump event can be identified; checking a jump path from the starting page to the target page according to the target digraph; when the verification result is that the jump path is legal, determining the access state of the target page; and when the access state of the target page is inaccessible, jumping to a preset bottom-storing page. The invention can check the jump path by using the directed graph, thereby ensuring that the user access can jump according to the specified service flow strictly and avoiding the problem that the user can not jump to the expected page; in addition, when the page is inaccessible, the routing strategy is adjusted, and the page jumps to a preset bottom-of-pocket page, so that the problem of continuous error reporting is avoided, and the user experience is improved.

It should be understood that various forms of the flows shown above, reordering, adding or deleting steps, may be used. For example, the steps described in the present invention may be executed in parallel, sequentially, or in different orders, and are not limited herein as long as the desired result of the technical solution of the present invention can be achieved.

The above-described embodiments should not be construed as limiting the scope of the invention. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions may occur depending on design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims

1. A page jump method is characterized by comprising the following steps:

and jumping to a preset bottom page when the access state of the target page is inaccessible.

2. The page jump method according to claim 1, before checking a jump path from the starting page to the target page according to the current directed graph, further comprising:

acquiring the latest state of each page from a server;

and updating the current state of each page recorded in the current directed graph according to the latest state of each page to obtain the target directed graph.

3. The page jump method according to claim 2, wherein said updating the current state of each page recorded in the current directed graph according to the latest state of each page to obtain the target directed graph comprises:

determining an abnormal page according to the latest state of each page;

4. The page jump method according to claim 3, further comprising, after jumping to a preset bottom-of-pocket page:

after the preset duration, acquiring the latest state of the target page from the server;

and if the latest state of the target page is normal, setting the access control variable of the target page in the target directed graph to be accessible.

5. The page jump method according to claim 2, further comprising, before obtaining the latest status of each page from the server:

determining a jump path between each page according to a service flow;

and constructing the current directed graph according to the jump paths among the pages, wherein the current directed graph comprises the jump paths among the pages and the current states of the pages.

6. The page jump method according to any one of claims 1 to 5, wherein said checking a jump path from the starting page to the target page according to a target directed graph comprises:

and if so, determining that the jump path is legal.

7. The page jump method of claim 1, further comprising, after determining the state of the target page:

when the state of the target page is accessible, acquiring an access result;

and reporting the target page abnormity to a server when the access result shows that the target page is abnormal.

8. A page jump apparatus, comprising:

9. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor implements the page jump method as claimed in any one of claims 1 to 7 when executing the program.

10. A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the page jump method according to any one of claims 1 to 7.