# US 12,223,341 B2 · Non-transitory computer-readable storage medium, information processing apparatus, and information processing method

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 12,223,341 B2
- Document ID: US12223341B2
- Status: Granted
- Kind: B2
- Application number: 17/550,344
- Filed: 2021-12-14
- Published: 2022-09-22
- Granted: 2025-02-11
- Earliest claimed: 2021-03-22
- Assignees: Fujitsu Limited
- Applicants: Fujitsu Limited
- Inventors: Kazuhiro Suzuki
- Web page: https://patentgrep.com/patent/US12223341B2

## CPC

- G06F 9/46: Multiprogramming arrangements
- H04L 41/22: comprising specially adapted graphical user interfaces [GUI]
- H04L 41/12: Discovery or management of network topologies
- H04L 41/085: Retrieval of network configuration; Tracking network configuration history
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A non-transitory computer-readable recording medium storing a program that causes executed by a processor included in a computer that presents a directed graph representing a dependency relationship between a plurality of nodes to execute a process. The process includes recording an added generation or a deleted generation at the time of configuration change in property information in the directed graph, selecting, among the plurality of nodes, nodes that exist at designated time and an edge between the nodes, and presenting the directed graph by acquiring configuration information of the nodes and the edge at the designated time.

## Claims

### Claim 1

A non-transitory computer-readable recording medium storing a program that causes executed by a processor included in a computer that presents a directed graph representing a dependency relationship between a plurality of nodes to execute a process, the process comprising:
recording an added generation or a deleted generation at a time of configuration change in property information in the directed graph;
selecting, among the plurality of nodes, nodes that exist at designated time and an edge between the nodes; and
presenting the directed graph by acquiring configuration information of the nodes and the edge at the designated time, wherein
the presenting of the directed graph includes presenting, when an event that relates to any of the plurality of nodes and a plurality of edges between the plurality of nodes in the directed graph is detected at the designated time, among the plurality of nodes and the plurality of edges, a node and an edge for which the designated time is after the added generation and for which the deleted generation is not recorded, and a node and an edge for which the designated time is after the added generation and before the deleted generation, in the directed graph.

### Claim 2 (depends on 1)

The non-transitory computer-readable recording medium according to claim 1,
wherein the recording includes recording the deleted generation for a node included in the plurality of nodes or an edge, which is not included in the configuration information by referring to the configuration information at the designated time for all of the plurality of nodes and a plurality of edges included in edge between the plurality of nodes in the directed graph.

### Claim 3 (depends on 1)

The non-transitory computer-readable recording medium according to claim 1, wherein the process further comprising:
the recording includes recording the deleted generation for a node or an edge that is not included in the configuration information by referring to the configuration information at the designated time for the plurality of nodes for which timestamps are less than the designated time and a plurality of edges between the plurality of nodes in the directed graph.

### Claim 4

An information processing apparatus that presents a directed graph representing a dependency relationship between a plurality of nodes, the information processing apparatus comprising:
a memory; and
a processor coupled to the memory and configured to:
control to record an added generation or a deleted generation at a time of configuration change in property information in the directed graph,
select, among the plurality of nodes, nodes that exist at designated time and an edge between the nodes, and
present the directed graph by acquiring configuration information of the nodes and the edge at the designated time, wherein
the presenting of the directed graph includes presenting, when an event that relates to any of the plurality of nodes and a plurality of edges between the plurality of nodes in the directed graph is detected at the designated time, among the plurality of nodes and the plurality of edges, a node and an edge for which the designated time is after the added generation and for which the deleted generation is not recorded, and a node and an edge for which the designated time is after the added generation and before the deleted generation, in the directed graph.

### Claim 5

An information processing method performing by an information processing apparatus that presents a directed graph representing a dependency relationship between a plurality of nodes, the information processing method comprising:
recording an added generation or a deleted generation at a time of configuration change in property information in the directed graph;
selecting, among the plurality of nodes, nodes that exist at designated time and an edge between the nodes; and
presenting the directed graph by acquiring configuration information of the nodes and the edge at the designated time, wherein
the presenting of the directed graph includes presenting, when an event that relates to any of the plurality of nodes and a plurality of edges between the plurality of nodes in the directed graph is detected at the designated time, among the plurality of nodes and the plurality of edges, a node and an edge for which the designated time is after the added generation and for which the deleted generation is not recorded, and a node and an edge for which the designated time is after the added generation and before the deleted generation, in the directed graph.