UltipaDocs
Try Playground
  • Introduction
    • Show Algorithms
    • Install and Uninstall
    • Run Algorithms
    • Algorithm Results and Statistics
    • Degree Centrality
    • Closeness Centrality
    • Harmonic Centrality
    • Graph Centrality
    • Betweenness Centrality
    • Eigenvector Centrality
    • CELF
    • PageRank
    • ArticleRank
    • HITS
    • SybilRank
    • Jaccard Similarity
    • Overlap Similarity
    • Cosine Similarity
    • Pearson Correlation Coefficient
    • Euclidean Distance
    • K-Hop All
    • Bipartite Graph
    • HyperANF
    • Connected Component
    • Triangle Counting
    • Induced Subgraph
    • k-Core
    • k-Truss
    • p-Cohesion
    • k-Edge Connected Components
    • Local Clustering Coefficient
    • Topological Sort
    • Schema Overview
    • Dijkstra's Single-Source Shortest Path
    • Delta-Stepping Single-Source Shortest Path
    • Shortest Path Faster Algorithm (SPFA)
    • Minimum Spanning Tree
    • Breadth-First Search (BFS)
    • Depth-First Search (DFS)
    • Adamic-Adar Index
    • Common Neighbors
    • Preferential Attachment
    • Resource Allocation
    • Total Neighbors
    • Louvain
    • Leiden
    • Label Propagation
    • HANP
    • k-Means
    • kNN (k-Nearest Neighbors)
    • K-1 Coloring
    • Conductance
      • Random Walk
      • Node2Vec Walk
      • Node2Vec
      • Struc2Vec Walk
      • Struc2Vec
      • GraphSAGE
      • GraphSAGE Train
      • LINE
      • Fast Random Projection
      • Summary of Graph Embedding
      • Gradient Descent
      • Backpropagation
      • Skip-gram
      • Skip-gram Optimization
  1. Docs
  2. /
  3. Graph Analytics & Algorithms
  4. /
  5. Connectivity & Compactness

Schema Overview

✕ File Writeback ✕ Property Writeback ✓ Direct Return ✓ Stream Return ✕ Stats

Overview

The Schema Overview algorithm summarizes the structure of a graph by presenting the statistics of the source node schema, edge schema, end node schema, and the count of edges.

Syntax

  • Command: algo(schema_overview)
  • Parameters:
Name
Type
Spec
Default
Optional
Description
orderstringasc, desc/YesSorts the results based on the edge count.

Examples

The example graph is as follows:

Direct Return

Alias Ordinal
Type
Description
Columns
0[]perGroupStatistics showing the number of edges of a specific schema between two node schemasnode schema(src), edge schema, node schema(dest), count
UQL
algo(schema_overview).params() as result 
return result

Results: result

node schema(src)
edge schema
node schema(dest)
count
accountfollowaccount2
accountlikemovie1
moviefilmedIncountry1
directordirectmovie2

Stream Return

Alias Ordinal
Type
Description
Columns
0[]perGroupStatistics showing the number of edges of a specific schema between two node schemasnode schema(src), edge schema, node schema(dest), count
UQL
algo(schema_overview).params().stream() as result
where result.`node schema(src)` = "account" 
return result

Results: result

node schema(src)
edge schema
node schema(dest)
count
accountfollowaccount2
accountlikemovie1