Abstract: Systems and techniques for read-write network visualization are described herein. A selected sub-region of a visual representation of a graph network may be displayed based on inputs received from a user. Boundaries for the selected sub-region of the visual representation of the graph network may be calculated. State data may be captured for a portion of the graph network associated with the selected sub-region using the calculated boundaries for the selected sub-region of the visual representation upon activation of an edit mode user interface control. A change to an element of the graph network may be identified. The graph network may be modified based on the change. A formula may be identified that is associated with the element of the graph network. The formula may be automatically recompiled and values for the element of the graph network, and nodes and edges that share a path with the element, may be automatically recalculated using the recompiled formula.

Abstract: Systems and techniques for unified resource capacity data management are described herein. An aggregate shift duration, a number of shifts, and an aggregate downtime duration within a specific calendar period may be determined, using a machine learning model, for each resource of a plurality of resources. A scheduling available capacity may be generated for the plurality of resources using the determined aggregate shift duration, the number of shifts, and the aggregate downtime duration. A planning available capacity may be generated using the scheduling available capacity and a retrieved efficiency factor. An optimal resource allocation may be calculated based on the planning available capacity and a customer demand. An indication that the set of training data was updated based on the optimal resource allocation may be received. The planning available capacity for each resource of the plurality of resources may be updated based on the updated set of training data.

Abstract: Systems and techniques for aggregated physical and logical network mesh view are described herein. A selection may be obtained of a portion of a graph network data structure. Nodes may be identified in the portion of the graph network data structure. Geolocation data may be determined for each node of the nodes. Geographical boundaries may be calculated for the portion of the graph network data structure. A geographical map and a network map may be generated. A physical network view may be generated for display in the user interface as an aggregated view of the geographical map and the network map. The geographical map may represent a physical layer and the network map may represent a logical layer. The aggregated view may be output for display with a set of controls that correspond to the physical layer and a set of controls that correspond to the logical layer.

Abstract: Systems and techniques for read-write network visualization are described herein. A selected sub-region of a visual representation of a graph network may be displayed based on inputs received from a user. Boundaries for the selected sub-region of the visual representation of the graph network may be calculated. State data may be captured for a portion of the graph network associated with the selected sub-region using the calculated boundaries for the selected sub-region of the visual representation upon activation of an edit mode user interface control. A change to an element of the graph network may be identified. The graph network may be modified based on the change. A formula may be identified that is associated with the element of the graph network. The formula may be automatically recompiled and values for the element of the graph network, and nodes and edges that share a path with the element, may be automatically recalculated using the recompiled formula.

Abstract: Systems and techniques for aggregated physical and logical network mesh view are described herein. A selection may be obtained of a portion of a graph network data structure. Nodes may be identified in the portion of the graph network data structure. Geolocation data may be determined for each node of the nodes. Geographical boundaries may be calculated for the portion of the graph network data structure. A geographical map and a network map may be generated. A physical network view may be generated for display in the user interface as an aggregated view of the geographical map and the network map. The geographical map may represent a physical layer and the network map may represent a logical layer. The aggregated view may be output for display with a set of controls that correspond to the physical layer and a set of controls that correspond to the logical layer.

Abstract: Systems and techniques for aggregated physical and logical network mesh view are described herein. A selection may be obtained of a portion of a graph network data structure. Nodes may be identified in the portion of the graph network data structure. Geolocation data may be determined for each node of the nodes. Geographical boundaries may be calculated for the portion of the graph network data structure. A geographical map and a network map may be generated. A physical network view may be generated for display in the user interface as an aggregated view of the geographical map and the network map. The geographical map may represent a physical layer and the network map may represent a logical layer. The aggregated view may be output for display with a set of controls that correspond to the physical layer and a set of controls that correspond to the logical layer.

Abstract: Systems and techniques for read-write network visualization are described herein. A selected sub-region of a visual representation of a graph network may be displayed based on inputs received from a user. Boundaries for the selected sub-region of the visual representation of the graph network may be calculated. State data may be captured for a portion of the graph network associated with the selected sub-region using the calculated boundaries for the selected sub-region of the visual representation upon activation of an edit mode user interface control. A change to an element of the graph network may be identified. The graph network may be modified based on the change. A formula may be identified that is associated with the element of the graph network. The formula may be automatically recompiled and values for the element of the graph network, and nodes and edges that share a path with the element, may be automatically recalculated using the recompiled formula.

Abstract: Systems and techniques for aggregated physical and logical network mesh view are described herein. A selection may be obtained of a portion of a graph network data structure. Nodes may be identified in the portion of the graph network data structure. Geolocation data may be determined for each node of the nodes. Geographical boundaries may be calculated for the portion of the graph network data structure. A geographical map and a network map may be generated. A physical network view may be generated for display in the user interface as an aggregated view of the geographical map and the network map. The geographical map may represent a physical layer and the network map may represent a logical layer. The aggregated view may be output for display with a set of controls that correspond to the physical layer and a set of controls that correspond to the logical layer.