Browse Prior Art Database

An efficient and preventive method to solve broken links problem for internal links in static pages

IP.com Disclosure Number: IPCOM000206873D
Publication Date: 2011-May-12
Document File: 5 page(s) / 258K

Publishing Venue

The IP.com Prior Art Database

Abstract

Disclosed is an efficient and preventive method to solve the broken links problem for internal links in static pages. In the method, a page is represented as a node with inlinks (linking from other pages) and outlinks (linking to other pages). The pages are represented as a graph with inlinks and outlinks to each page. The broken links can be created from any of the four operations like adding, deleting, modifying and moving a page. In each of these operations, the inlinks and outlinks of a page node are modified so as to prevent broken links from the system of pages

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 53% of the total text.

Page 01 of 5

An efficient and preventive method to solve broken links problem for internal links in static pages

The method efficiently prevents the broken links for internal links in static pages. The method avoids broken links within the system by not allowing it to get created in the first place. The idea not only is applicable to new systems but also to the systems that are well established.

Whenever a system of pages is about to be modified, a logic is run and the proposed framework notifies the would-be broken links to the administrator. When the administrator corrects the would-be broken links, the system becomes broken links free and the modification is made

permanen

nonexistence of broken links for internal links in static pages.

A broken link can be created by any of the following operations to a system:
1. Deleting a page
2. Adding a page
3. Moving a page (also called renaming)
4. Modifying a page

The page system is considered as a graph. Each page is a node or vertex and each link between two pages is an edge. The edge is a directed edge. i.e. An edge from page i to page j specifies there is an outlink from page i to page j. An edge from page j to page i specifies there is an outlink from page j to page i.

A node structure is as below: node
{

inlinks[] // an array of memory references to the nodes which are the inlinks

outlinks[] // an array of memory references to the nodes which are the outlinks }

The prevention of occurrence of broken links while deleting a page is explained from the diagrams.

The steps involved are similar for adding a page, moving a page and modifying a page

1

t. The above process continues for each modification to the system. This guarantees the


Page 02 of 5

(This page contains 00 pictures or other non-text object)

Fig 1. Diagram showing a system of three pages with links

2


Page 03 of 5

(This page contains 00 pictures or other non-text object)

Fig 2. Diagram showing the three page system using node structures

3


Page 04 of 5

(This page contains 00 pictures or other non-text object)

Fig 3. Diagram showing two page system after the deletion of page 3 preventing the occurrence of broken links

The steps for deleting and adding a page are given below:

Deletion of a page

1. Let the node memory reference to be deleted be called A
2. Go to each of the node structures of the inlinks present in A (call it as B) and remove from B outlinks to A

The framework corrects these links in B and correspondingly the administrator removes the link in physical page B.

3. Go to each of the node structures of the outlinks present in A (call it as C) and remove from C the inlinks from A

The framework corrects these links in C which are found using the data structures
4. Delete the node structure A

Addition of a page

1. Create a node structure as above and let the node memory reference be called A
2. Add the co...