5
5
#
6
6
# This source code is licensed under the license found in the
7
7
# LICENSE file in the root directory of this source tree.
8
+ # __version__ = 'test'
8
9
9
10
import os .path
10
11
import requests
@@ -405,7 +406,7 @@ def __init__(
405
406
'base_url should not end with / as it is appended automatically'
406
407
407
408
self .ipv6 = ipv6
408
- self .env = env
409
+ self .env = env
409
410
self .env_list = {f'{ env } ' } # default env
410
411
self .send = send
411
412
self .event_handlers = {} # Haven't registered any events
@@ -801,7 +802,7 @@ def get_env_list(self):
801
802
This function returns a list of all of the env names that are currently
802
803
in the server.
803
804
"""
804
- if self .offline :
805
+ if self .offline :
805
806
return list (self .env_list )
806
807
else :
807
808
return json .loads (self ._send ({}, endpoint = 'env_state' , quiet = True ))
@@ -1694,7 +1695,7 @@ def line(self, Y, X=None, win=None, env=None, opts=None, update=None,
1694
1695
assert X .ndim == 1 or X .ndim == 2 , 'X should have 1 or 2 dim'
1695
1696
else :
1696
1697
X = np .linspace (0 , 1 , Y .shape [0 ])
1697
-
1698
+
1698
1699
if Y .ndim == 2 and X .ndim == 1 :
1699
1700
X = np .tile (X , (Y .shape [1 ], 1 )).transpose ()
1700
1701
@@ -2180,7 +2181,7 @@ def sunburst(self, labels, parents, values=None, win=None, env=None, opts=None):
2180
2181
line_width = opts .get ("marker_width" )
2181
2182
2182
2183
assert len (parents .tolist ())== len (labels .tolist ()), "length of parents and labels should be equal"
2183
-
2184
+
2184
2185
data_dict = [{
2185
2186
'labels' : labels .tolist (),
2186
2187
"parents" :parents .tolist (),
@@ -2196,7 +2197,7 @@ def sunburst(self, labels, parents, values=None, win=None, env=None, opts=None):
2196
2197
2197
2198
data_dict [0 ]['values' ]= values .tolist ()
2198
2199
2199
- data = data_dict
2200
+ data = data_dict
2200
2201
return self ._send ({
2201
2202
'data' : data ,
2202
2203
'win' : win ,
@@ -2397,7 +2398,7 @@ def graph(self, edges, edgeLabels = None, nodeLabels = None, opts=dict(), env=No
2397
2398
"""
2398
2399
This function draws interactive network graphs. It takes list of edges as one of the arguments.
2399
2400
The user can also provide custom edge Labels and node Labels in edgeLabels and nodeLabels respectively.
2400
- Along with that we have different parameters in opts for making it more user friendly.
2401
+ Along with that we have different parameters in opts for making it more user friendly.
2401
2402
2402
2403
Args:
2403
2404
edges : list, required
@@ -2419,7 +2420,7 @@ def graph(self, edges, edgeLabels = None, nodeLabels = None, opts=dict(), env=No
2419
2420
except :
2420
2421
raise RuntimeError (
2421
2422
"networkx must be installed to plot Graph figures" )
2422
-
2423
+
2423
2424
G = nx .Graph ()
2424
2425
G .add_edges_from (edges )
2425
2426
node_data = list (G .nodes ())
@@ -2434,7 +2435,7 @@ def graph(self, edges, edgeLabels = None, nodeLabels = None, opts=dict(), env=No
2434
2435
if nodeLabels is not None :
2435
2436
assert len (nodeLabels ) == len (node_data ),\
2436
2437
"length of nodeLabels does not match with the length of nodes {len1} != {len2}" .format (len1 = len (nodeLabels ), len2 = len (node_data ))
2437
-
2438
+
2438
2439
for i in range (len (node_data )):
2439
2440
if i != node_data [i ]:
2440
2441
raise RuntimeError ("The nodes should be numbered from 0 to n-1 for n nodes! {} node is missing!" .format (i ))
@@ -2455,15 +2456,15 @@ def graph(self, edges, edgeLabels = None, nodeLabels = None, opts=dict(), env=No
2455
2456
edge ["target" ] = int (link_data [i ][1 ])
2456
2457
edge ["label" ] = str (edgeLabels [i ]) if edgeLabels is not None else str (link_data [i ][0 ])+ "-" + str (link_data [i ][1 ])
2457
2458
edges .append (edge )
2458
-
2459
+
2459
2460
for i in range (len (node_data )):
2460
2461
node = {}
2461
2462
node ["name" ] = int (node_data [i ])
2462
2463
node ["label" ] = str (nodeLabels [i ]) if nodeLabels is not None else str (node_data [i ])
2463
2464
if opts ['scheme' ] == 'different' :
2464
2465
node ["club" ] = int (i )
2465
2466
nodes .append (node )
2466
-
2467
+
2467
2468
2468
2469
data = [{
2469
2470
'content' : {"nodes" : nodes , "edges" : edges },
0 commit comments