Deze pagina is nog niet beschikbaar in uw eigen taal. We werken er hard aan om meer taalversies toe te voegen. Bedankt voor uw steun.
- What's New
- Service Overview
- Getting Started
-
User Guide
- What Is GES?
- Product Advantages
- Applicable Scenarios
- Basic Concepts
- Constraints and Limitations
- Related Services
- GES Overview
- Permissions Management
- Importing Metadata
- Creating Graphs
- Managing Graphs
-
Accessing and Analyzing Graph Data
- Graph Editor
- Accessing the GES Graph Editor
- Dynamic Graphs
- Graph Exploration
- Multi-Graph Management (Database Edition)
- Adding Custom Operations
- Editing Schema
- Visual Query
- Gremlin Query
- Cypher Query
- DSL Query
- Analyzing Graphs Using Algorithms
- Analyzing Graphs on the Canvas
- Graph Display in 3D View
- Filter Criteria
- Editing Properties
- Statistics Display
- View Running Records
- Viewing Query Results
- Viewing Graph Tasks
- Configuring Permissions
-
Algorithms
- Algorithm List
- PageRank
- PersonalRank
- K-core
- K-hop
- Shortest Path
- All Shortest Paths
- Filtered Shortest Path
- SSSP
- Shortest Path of Vertex Sets
- n-Paths
- Closeness Centrality
- Label Propagation
- Louvain
- Link Prediction
- Node2vec
- Real-time Recommendation
- Common Neighbors
- Connected Component
- Degree Correlation
- Triangle Count
- Clustering Coefficient
- Betweenness Centrality
- Edge Betweenness Centrality
- Origin-Destination Betweenness Centrality
- Circle Detection with a Single Vertex
- Common Neighbors of Vertex Sets
- All Shortest Paths of Vertex Sets
- Filtered Circle Detection
- Subgraph Matching
- Filtered All Pairs Shortest Paths
- Filtered All Shortest Paths
- TopicRank
- Filtered n-Paths
- Temporal Paths
- Best Practices
- FAQs
-
API Reference
- Before You Start
- Calling APIs
- Management Plane APIs (V2)
-
Service Plane APIs
-
Memory Edition
-
Vertex Operation APIs
- Querying Vertices That Meet Filter Criteria
- Querying Vertex Details
- Adding a Vertex
- Deleting a Vertex
- Updating Vertex Properties
- Querying Vertex Data in Batches
- Adding Vertices in Batches
- Deleting Vertices in Batches
- Updating Vertex Properties in Batches
- Adding a Vertex Label
- Deleting a Vertex Label
- Exporting Filtered Vertices
- Deleting Filtered Vertices
- Edge Operation APIs
- Metadata Operation APIs
- Index Operation APIs
- Gremlin Operation APIs
-
Algorithm APIs
- Running Algorithms
-
Algorithm API Parameter References
- Common Algorithm Parameters
- PageRank
- PersonalRank
- K-core
- K-hop
- Common Neighbors
- Common Neighbors of Vertex Sets
- Link Prediction
- Shortest Path
- All Shortest Paths
- Filtered Shortest Path
- SSSP
- Shortest Path of Vertex Sets
- n-Paths
- Filtered n-Paths
- Filtered All Pairs Shortest Paths
- All Shortest Paths of Vertex Sets
- Filtered All Shortest Paths
- Connected Component
- Label Propagation
- Louvain
- Node2vec
- Real-time Recommendation
- Degree Correlation
- Triangle Count
- Cluster Coefficient
- Closeness Centrality
- Filtered Circle Detection
- Subgraph Matching
- Topicrank
- Temporal Graph APIs
- Path APIs
- Graph Statistics APIs
- Graph Operation APIs
- Subgraph Operation APIs
- Job Management APIs
- Custom Operations APIs
- Cypher Queries
- Filtered Query
- Filtered Query V2
- Updating Specified Properties of Vertices and Edges by Importing a File
- Deleting Vertices and Edges by Files
- Granular Permission Control APIs
-
Vertex Operation APIs
- Database Edition
-
Memory Edition
- GES Metrics
- Appendix
-
devg
- Overview
- Preparations
- Importing a Project
-
Using the Service Plane SDK
- Initializing the Client of the GES Service Plane
- Querying Vertices That Meet Filtering Conditions
- Querying Edges That Meet Filtering Conditions
- Querying Vertex Details
- Querying Edge Details
- Querying Graph Metadata Details
- Querying General Information About a Graph
- Executing Gremlin Queries
-
Running Algorithms
- PageRank
- PersonalRank
- K-hop
- K-core
- Shortest Path
- All Shortest Paths
- Filtered Shortest Path
- SSSP
- Shortest Path of Vertex Sets
- n Paths
- Closeness
- Label Propagation
- Louvain Algorithm
- Link Prediction
- Node2vec
- Real-time Recommendation
- Common Neighbors
- Connected Component
- Degree Correlation Algorithm
- Triangle Count
- Cluster Coefficient
- Filtered Circle Detection
- Subgraph Matching
- Filtered All Pairs Shortest Paths
- Filtered All Shortest Paths
- TopicRank
- Filtered n Paths
- Common Neighbors of Vertex Sets
- All Shortest Paths of Vertex Sets
- Querying Job Status
- Canceling a Job
- Adding a Vertex
- Deleting a Vertex
- Adding an Edge
- Deleting an Edge
- Adding an Index
- Deleting an Index
- Querying Indexes
- Exporting a Graph
- Removing a Graph
- Adding a Property
- Querying Path Details
- Incrementally Importing Data to Graphs
- Adding Vertices in Batches
- Deleting Vertices in Batches
- Adding Edges in Batches
- Deleting Edges in Batches
- Updating Vertex Properties in Batches
- Updating Edge Properties in Batches
-
Using the Management Plane SDK
- Initializing the Client of the GES Management Plane
- Querying Quotas
- Verifying Metadata Files
- Querying the Graph List
- Querying Graph Details
- Creating a Graph
- Closing a Graph
- Starting a Graph
- Deleting a Graph
- Querying Backups of All Graphs
- Querying the Backup List of a Graph
- Adding a New Backup
- Deleting a Backup
- Querying Job Status
- Using Cypher JDBC Driver to Access GES
- Relationships Between SDKs and REST APIs
-
FAQs
- Customer Consultation
-
API Use
- How Do I Import Data to GES?
- When Binding an EIP to an Existing Instance or an Instance Being Created, What Should I Do to Deal with Insufficient Permissions for Creating Agencies?
- When Binding an EIP to an Existing Instance or an Instance Being Created, What Should I Do to Deal with Insufficient Quotas for Creating Agencies?
- Can I Run Several Gremlin/Cypher Commands At a Time?
- If a Vertex Is Deleted, What Will Happen to Edges Formed Based on the Vertex?
- What Do I Do If an Error Message Indicating a Vertex Does Not Exist Is Displayed When Properties of the Vertex Whose ID Contains Chinese Characters Are Modified?
- GUI
- Others
Show all
Analyzing Graphs on the Canvas
The canvas intuitively displays the graph data. You can also edit and analyze data in this area. For details about the shortcut keys and interface elements on the canvas, see Table 3.
The procedure is as follows:
- Log in to the GES graph editor. For details, see Accessing the GES Graph Editor.
- On the canvas, right-click a vertex or an edge, and perform the following operations:
- View Property
Select View Property to view the property information about the selected vertex or edge on the Property tab page.
- Search by Association
You can select OUT, IN, and ALL to expand vertices related to the current vertex.
- OUT: Query the vertices using this vertex as the source vertex.
- IN: Query the vertices using this vertex as the target vertex.
- ALL: Query all vertices of OUT and IN.
- Export
Export the graph displayed on the canvas.
- Search by Path
Query paths between two vertices. All possible paths are listed.
Procedure: Hold down Ctrl and click two vertices. The first is the source vertex and the second is the target vertex. Then, Right-click and choose Search by Path from the shortcut menu.
NOTE:
This option is valid only when two vertices are selected. Otherwise, it is dimmed.
After this function is executed, the canvas is cleared, and then the queried vertex and edge data is returned and rendered in the canvas. A path is formed based on the selected two vertices.
- Shortest Path of the Vertex Sets
- Hold down Shift and box-select a group of vertices (a single vertex or multiple vertices).
- Hold down Shift and box-select another group of vertices (a single vertex or multiple vertices).
- Right-click in the selection box and choose Shortest Path of the Vertex Sets from the shortcut menu.
- In the dialog box that is displayed, you can edit the selected two sets of vertices and click + to quickly add vertices.
- Click Run. The shortest paths between two vertex sets are returned.
- Common Neighbors of Vertex Sets
- Function
By box-selecting the common neighbors of two vertex sets, you can intuitively discover the objects associated with the two sets.
- Procedure
- Hold down Shift and box-select two vertex sets.
- Right-click a vertex set and choose Common Neighbors of Vertex Sets from the shortcut menu.
- In the displayed dialog box, confirm the vertices in the vertex set. You can add or delete vertices and determine whether to carry additional parameters. Then, click Run.
NOTE:
The Carrying additional constraints option allows you to limit the result set:
- If this option is not selected, the found common neighbors are the intersection of the neighbors corresponding to the source vertex set and target vertex set.
- If this option is selected, the found common neighbors are not only the intersection of the neighbors corresponding to the source vertex set and target vertex set, but each vertex in the common neighbor set has at least two neighboring vertices in the source vertex set and target vertex set.
- Display the result.
- Function
- Sub Graph: Press and hold Ctrl and select some vertices. The edges between those vertices and the selected vertices form a new graph.
- Add Edge: You can add an edge using either of the following methods:
- Hold down Ctrl, select any two vertices on the canvas, right-click the selected vertices, and choose Add Edge from the shortcut menu to add an edge between the vertices. By default, the vertex selected first is the source vertex, and that selected later is the target vertex. After the edge is added, you can select the label of the edge and set the edge properties.
- Select a vertex, press Alt+A, drag the cursor to the target vertex, and left-click to add an edge.
- Hide: Hide the selected vertex.
- Delete: Delete a vertex, an edge, multiple vertices, and multiple edges, or delete edges and vertices in batches.
- To delete a vertex /edge, select the vertex/edge and delete it.
- To delete multiple vertices/edges, press Ctrl to select the vertices/edges and delete them.
- To delete vertices and edges in batches, hold down Shift and drag the left key of the mouse to select multiple vertices and edges and delete them.
After you click Delete, a confirmation dialog box is displayed. Confirm information about the vertices and edges you want to delete and click OK.NOTE:
The vertices and edges will be permanently deleted and cannot be restored. Exercise caution when performing this operation.
- View Property
- View the details about a vertex.
Move the cursor to a non-virtualized vertex. The ID, label, and properties of this vertex are displayed.
NOTE:
A maximum of six properties of a vertex can be displayed in the pop-up window. .
Feedback
Was this page helpful?
Provide feedbackThank you very much for your feedback. We will continue working to improve the documentation.