Electronic note management via a connected entity graph

1. A computer-implemented method for providing an improvement in searching for electronic notes via a connected entity graph, the connected entity graph comprising digitally stored data representing nodes and edges, the method comprising:

receiving a first input in a graphical user interface of a computer specifying selection of a beginning entity from a plurality of entities in the connected entity graph;

receiving a second input in the graphical user interface of the computer specifying selection of a linking parameter, the linking parameter comprising a link type selected from among a plurality of link types, and a target entity type selected from among a plurality of target entity types;

receiving a third input in the graphical user interface of the computer specifying a search depth from the beginning entity;

in response to the first input, the second input, and the third input, searching a connected entity graph, comprising at least one electronic note entity, starting at the beginning entity, for any target entities, of the target entity type, and within the search depth, that (a) have a first degree connection in the connected entity graph with the beginning entity via a link that is not different from the link type of the linking parameter or (b) have a first degree connection in the connected entity graph with one of the other target entities that is not different from the target entity type of the linking parameter; and

displaying, in the graphical user interface, a search result comprising nodes and edges, each of the nodes representing the beginning entity or one of the target entities and each of the edges connecting two of the nodes and representing a first degree connection in the connected entity graph between the two entities represented by the two nodes connected by the edge.

2. The method of claim 1 , wherein the target entity type is an electronic note entity type.

3. The method of claim 1 , wherein the search depth is greater than one.

4. The method of claim 1 , wherein:

a particular first degree connection between a particular one of the target entities and the beginning entity or one of the other target entities is via a particular intermediary entity of the connected entity graph;

the method further comprises displaying, in the graphical user interface, a particular complex connection indicator in association with the edge representing the particular first degree connection; and

the particular complex connection indicator represents the particular intermediary entity.

5. The method of claim 1 , wherein a particular first degree connection between a particular one of the target entities and the beginning entity or one of the other target entities is a basic connection.

6. The method of claim 1 , wherein at least one node displayed in the graphical user interface visually indicates a type of entity the at least one node represents.

7. The method of claim 1 , wherein:

a first node of the nodes displayed in the graphical user interface represents a particular electronic note entity comprising text;

a second node of the nodes displayed in the graphical user interface represents a type of entity other than an electronic note entity; and

wherein the first node displays at least a portion of the text of the particular electronic note entity.

8. The method of claim 1 , wherein:

the beginning entity has a type; and

the type of the beginning entity is not an electronic note entity type.

9. The method of claim 1 , wherein:

the linking parameter is a link type; and

searching the connected entity graph comprises searching the connected entity graph, starting at the beginning entity, for any target entities, of the target entity type, and within the search depth, that (a) have a basic connection in the connected entity graph with the beginning entity comprising a link that is of the link type or (b) have a basic connection in the connected entity graph with one of the other target entities comprising a link that is of the link type.

10. A system for providing an improvement in searching for electronic notes via a connected entity graph, the connected entity graph comprising digitally stored data representing nodes and edges, comprising:

one or more processors;

one or more non-transitory computer-readable media storing one or more computer programs for execution by the one or more processors, the one or more computer programs comprising instructions for:

receiving a first input in a graphical user interface of a computer specifying selection of a beginning entity from a plurality of entities in the connected entity graph;

receiving a second input in the graphical user interface of the computer specifying selection of a linking parameter, the linking parameter comprising a link type selected from among a plurality of link types, and a target entity type selected from among a plurality of target entity types;

receiving a third input in the graphical user interface of the computer specifying a search depth from the beginning entity;

in response to the first input, the second input, and the third input, searching a connected entity graph, comprising at least one electronic note entity, starting at the beginning entity, for any target entities, of the target entity type, and within the search depth, that (a) have a first degree connection in the connected entity graph with the beginning entity via a link that is not different from the link type of the linking parameter or (b) have a first degree connection in the connected entity graph with one of the other target entities that is not different from the target entity type of the linking parameter; and

displaying, in the graphical user interface, a search result comprising nodes and edges, each of the nodes representing the beginning entity or one of the target entities and each of the edges connecting two of the nodes and representing a first degree connection in the connected entity graph between the two entities represented by the two nodes connected by the edge.

11. The system of claim 10 , wherein the target entity type is an electronic note entity type.

12. The system of claim 10 , wherein the search depth is greater than one.

13. The system of claim 10 , wherein:

a particular first degree connection between a particular one of the target entities and the beginning entity or one of the other target entities is via a particular intermediary entity of the connected entity graph;

the one or more computer programs further comprising instructions for displaying, in the graphical user interface, a particular complex connection indicator in association with the edge representing the particular first degree connection; and

the particular complex connection indicator represents the particular intermediary entity.

14. The system of claim 10 , wherein a particular first degree connection between a particular one of the target entities and the beginning entity or one of the other target entities is a basic connection.

15. The system of claim 10 , wherein at least one node displayed in the graphical user interface visually indicates a type of entity the at least one node represents.

16. The system of claim 10 , wherein:

a first node of the nodes displayed in the graphical user interface represents a particular electronic note entity comprising text;

a second node of the nodes displayed in the graphical user interface represents a type of entity other than an electronic note entity; and

wherein the first node displays at least a portion of the text of the particular electronic note entity.

17. The system of claim 10 , wherein:

the beginning entity has a type; and

the type of the beginning entity is not an electronic note entity type.

18. The system of claim 10 , wherein:

the beginning entity has a type; and

the type of the beginning entity is an electronic note entity type.

19. The system of claim 10 , wherein:

the linking parameter is a link type; and

the instructions for searching the connected entity graph comprise instructions for searching the connected entity graph, starting at the beginning entity, for any target entities, of the target entity type, and within the search depth, that (a) have a basic connection in the connected entity graph with the beginning entity comprising a link that is of the link type or (b) have a basic connection in the connected entity graph with one of the other target entities comprising a link that is of the link type.

20. One or more non-transitory computer-readable media storing one or more computer programs for execution by one or more processors, the one or more computer programs comprising instructions for:

receiving first input in a graphical user interface of a computer specifying selection of a beginning entity from a plurality of entities in a connected entity graph;

receiving second input in the graphical user interface of the computer specifying selection of a linking parameter, the linking parameter comprising a link type selected from among a plurality of link types, and a target entity type selected from among a plurality of target entity types;

receiving a third input in the graphical user interface of the computer specifying a search depth from the beginning entity;

in response to the first input, the second input, and the third input, searching a connected entity graph, comprising at least one electronic note entity, starting at the beginning entity, for any target entities, of the target entity type, and within the search depth, that (a) have a first degree connection in the connected entity graph with the beginning entity via a link that is not different from the link type of the linking parameter or (b) have a first degree connection in the connected entity graph with one of the other target entities that is not different from the target entity type of the linking parameter; and

displaying, in the graphical user interface, a search result comprising nodes and edges, each of the nodes representing the beginning entity or one of the target entities and each of the edges connecting two of the nodes and representing a first degree connection in the connected entity graph between the two entities represented by the two nodes connected by the edge.