×

METHOD TO EFFICIENTLY PROCESS AND PRESENT POSSIBLE ARRANGEMENTS OF A SET OF CONTIGUOUS PEER-TO-PEER LINKS

  • US 20080162398A1
  • Filed: 03/14/2008
  • Published: 07/03/2008
  • Est. Priority Date: 06/14/2002
  • Status: Abandoned Application
First Claim
Patent Images

1. A computer implemented method for displaying user-selected knowledge nodes within a set of knowledge nodes, stored as a set of linked pairs of nodes, comprising the steps of:

  • a) providing a set of knowledge nodes each configured for being selectable as at least one of a root node, an antecedent node and a descendent node;

    b) choosing interactively any knowledge node within said set of knowledge nodes as a root node;

    c) selecting any knowledge node within said set of knowledge nodes as a second of said nodes to form a linked pair of said nodes, wherein said second node is distinct from said root node;

    d) determining if a relationship between said root and second nodes is directionless or directional;

    e) determining whether said second node is antecedent or descendent of said root node;

    f) selecting a third node from any knowledge node within said set of knowledge nodes;

    g) determining if a relationship between said third node and either of said root and second nodes is directionless or directional;

    h) determining whether said third node is antecedent or descendent of either of said root or said second nodes, said third node forming a separately arranged linked pair with either of said root or said second nodes;

    i) repeating steps f-h with additional nodes from said set of knowledge nodes;

    j) generating a knowledge map tree from said separately arranged linked pairs, each of said linked pairs individually sharing a common node; and

    k) displaying said knowledge map tree.

View all claims
  • 0 Assignments
Timeline View
Assignment View
    ×
    ×