{"ScriptPreparationCode":"const graph_size = 1000;\r\nvar G = new jsnx.Graph();\r\nfor (let i=0; i\u003Cgraph_size-1; i\u002B\u002B) {\r\n\tG.addEdge(i, i\u002B1); \r\n \tif (i % 10 == 0) {\r\n \tG.addEdge(i, \u0027tens\u0027);\r\n }\r\n}\r\nG.addNode(\u0027none\u0027);\r\n\r\n// directional graph http://jsnetworkx.org/api/#/v/v0.3.4/DiGraph\r\nvar diG = new jsnx.DiGraph();\r\n// G.addEdgesFrom([[3,4], [4,5]], {color: \u0027red\u0027});\r\ndiG.addEdgesFrom([\r\n [100, 201], \r\n [100, 202],\r\n [100, 203],\r\n [100, 204],\r\n [100, 205],\r\n [205, 301], // grand child\r\n [10, 100], // points from parent of 100\r\n]);\r\nconsole.log(\u0027children of 100: \u0027, diG.successors(100)); // should return [ 201, 202, 203, 204, 205 ]\r\n","TestCases":[{"Name":"neighbors one","Code":"G.neighbors(123);","IsDeferred":false},{"Name":"neighbors many","Code":"G.neighbors(\u0027tens\u0027);","IsDeferred":false},{"Name":"neighbors None","Code":"G.neighbors(\u0027none\u0027);","IsDeferred":false},{"Name":"directed edge (one)","Code":"diG.addEdge([2, 3]);","IsDeferred":false},{"Name":"directed weighted edge (one)","Code":"diG.addEdge([2, 3], {weight: 4.7});","IsDeferred":false}]}