Project

ChartForgeX

Render deterministic charts, dashboards, topology, hierarchy, and report visuals directly from .NET.

Stars 47
Forks 2
NuGet downloads 75,067
Release ChartForgeX-v2.0.0
Language: HTML Updated: 2026-10-12

API Reference

Class

GraphSceneStage

Namespace ChartForgeX.Interactivity
Assembly ChartForgeX.Interactivity
Modifiers sealed

Describes a deterministic hierarchy or neighborhood view of a graph scene.

Inheritance

  • Object
  • GraphSceneStage

Usage

Explore 11 API references to this type

This type appears in these public API surfaces even when no hand-authored example is attached directly to the page.

Accepted by parameters 6

Properties

public GraphSceneStageKind Kind { get; } #

Gets the planning strategy that produced this view.

public Int32 Index { get; } #

Gets the one-based stage index used for stable file names.

public Int32 Depth { get; } #

Gets the maximum descendant depth visible in this stage.

public String Name { get; } #

Gets a stable, human-readable stage name.

public Boolean IsFullScene { get; } #

Gets whether this stage contains the complete selected hierarchy scope.

public String? RootNodeId { get; } #

Gets the optional root used to plan this stage.

public IReadOnlyList<String> VisibleNodeIds { get; } #

Gets stable node ids visible in this stage.

public IReadOnlyList<String> VisibleEdgeIds { get; } #

Gets stable edge ids whose endpoints are both visible in this stage.

public IReadOnlyList<String> FrontierNodeIds { get; } #

Gets visible nodes that summarize descendants hidden by this stage depth.

public Int32 HiddenNodeCount { get; } #

Gets the number of nodes hidden outside this stage.

public Int32 HiddenEdgeCount { get; } #

Gets the number of source relationships not included in this view, including relationships outside its scope.

public Int32 BoundaryEdgeCount { get; } #

Gets the number of source relationships with exactly one endpoint in this view.

public Int32 ScopeNodeCount { get; } #

Gets the eligible node count before paging. Neighborhoods exclude hidden nodes and honor the hop limit; hierarchy stages report the selected subtree.