github.com/hzck/speedroute@v0.0.0-20201115191102-403b7d0e443f/algorithm/tests/single_weight/least_possible_nodes_path.json (about)

     1  {
     2    "name": "Least possible nodes path",
     3    "description": "A path is considered shorter if less nodes are traversed when the total time is equal.",
     4    "testing": "Least nodes gives shorter path if total time is equal.",
     5    "visual": "START->1(5ms), 1->END(5ms), START->END(10ms)",
     6    "nodes": [
     7      {
     8        "id": "START"
     9      },
    10      {
    11        "id": "END"
    12      },
    13      {
    14        "id": "1"
    15      }
    16    ],
    17    "edges": [
    18      {
    19        "from": "START",
    20        "to": "1",
    21        "weights": [
    22          {
    23            "time": "5"
    24          }
    25        ]
    26      },
    27      {
    28        "from": "1",
    29        "to": "END",
    30        "weights": [
    31          {
    32            "time": "5"
    33          }
    34        ]
    35      },
    36      {
    37        "from": "START",
    38        "to": "END",
    39        "weights": [
    40          {
    41            "time": "10"
    42          }
    43        ]
    44      }
    45    ],
    46    "startId": "START",
    47    "endId": "END"
    48  }