Electronic note management via a connected entity graph

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.

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.