Change Password

Please enter the password.
Please enter the password. Between 8-64 characters. Not identical to your email address. Contain at least 3 of: uppercase, lowercase, numbers, and special characters.
Please enter the password.
Submit

Change Nickname

Current Nickname:
Submit

Apply New License

License Detail

Please complete this required field.

  • Ultipa Graph V4

Standalone

Please complete this required field.

Please complete this required field.

The MAC address of the server you want to deploy.

Please complete this required field.

Please complete this required field.

Cancel
Apply
ID
Product
Status
Cores
Applied Validity Period(days)
Effective Date
Excpired Date
Mac Address
Apply Comment
Review Comment
Close
Profile
  • Full Name:
  • Phone:
  • Company:
  • Company Email:
  • Country:
  • Language:
Change Password
Apply

You have no license application record.

Apply
Certificate Issued at Valid until Serial No. File
Serial No. Valid until File

Not having one? Apply now! >>>

Product Created On ID Amount (USD) Invoice
Product Created On ID Amount (USD) Invoice

No Invoice

Search

      Depth-First Search (DFS)

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

      Overview

      Graph traversal is a search technique used to visit and explore all the nodes of a graph systematically. The primary goal of graph traversal is to uncover and examine the structure and connections of the graph. There are two common strategies for graph traversal:

      The Depth-First Search (DFS) algorithm operates based on the backtracking principle and follows these steps:

      1. Create a stack (last in, first out) to keep track of visited nodes.
      2. Start from a selected node, push it into the stack, and mark it as visited.
      3. Push any unvisited neighbor of the node at the top of the stack into the stack, and mark it as visited. If there are multiple unvisited neighbors, choose one arbitrarily or based on a certain order.
      4. Repeat step 3 until there are no more unvisited neighbors to push into the stack.
      5. When there are no new nodes to visit, backtrack to the previous node (the one from which the current node was explored) by popping the top node from the stack.
      6. Repeat steps 3, 4 and 5 until the stack is empty.

      Below is an example of traversing the graph using the DFS approach, starting from node A and assuming to visit neighbors in alphabetical order (A~Z):

      Considerations

      • Only nodes that are in the same connected component as the start node can be traversed. Nodes in different connect components will not be included in the traversal results.

      Syntax

      • Command: algo(traverse)
      • Parameters:
      Name
      Type
      Spec
      Default
      Optional
      Description
      ids / uuids _id / _uuid / / No ID/UUID of the start node to traverse the graph
      direction string in, out / Yes Direction of edges when traversing the graph
      traverse_type string dfs bfs No To traverse the graph in the DFS approach, keep it as dfs

      Examples

      File Writeback

      Spec
      Content
      Description
      filename _id,_id The visited node (toNode), and the node from which it is visited (fromNode)
      algo(traverse).params({
        ids: ['B'],
        direction: 'in',
        traverse_type: 'dfs'
      }).write({
        file: {
            filename: 'result'
        }
      })
      

      Results: File result

      F,C
      E,F
      C,A
      B,B
      A,B
      
      Please complete the following information to download this book
      *
      公司名称不能为空
      *
      公司邮箱必须填写
      *
      你的名字必须填写
      *
      你的电话必须填写