├── README.md
├── csv
    ├── flights_25-06-2019_21-21-20-237094.csv
    └── vuelos_25-06-2019_20-38-14-746485.csv
├── driver
    └── chromedriver
├── gquestions.py
├── html
    ├── SEO_16-06-2019_14-19-02-257390.html
    ├── amazon net worth_16-06-2019_14-07-55-212877.html
    ├── how many season in mad men_16-06-2019_13-52-59-874430.html
    ├── what is affiliate marketing_16-06-2019_15-07-53-555584.html
    └── why buy a new car_16-06-2019_15-28-12-437060.html
├── license.txt
├── requirements.txt
└── templates
    └── index.html


/README.md:
--------------------------------------------------------------------------------
 1 | # ❓❔👾 Gquestions CLI Usage ❔❓
 2 | 
 3 | Are you looking for a ready-to-use tool? Check my [NeuralText People Also Ask free tool](https://www.neuraltext.com/ai/people-also-ask)
 4 | 
 5 | 
 6 | [![asciicast](https://asciinema.org/a/4wrOzHnxQVcTImuofzdMxB35L.svg)](https://asciinema.org/a/4wrOzHnxQVcTImuofzdMxB35L)
 7 | 
 8 | ## ⚠ Disclaimer
 9 | > This software is not authorized by Google and doesn't follow Google's
10 | > robots.txt. Scraping without Google explicit written permission is a violation of thei
11 | > terms and conditions on scraping and can potentially cause a lawsuit
12 | 
13 | ## Install dependencies
14 | ```
15 | pip install -r requirements.txt
16 | ```
17 | 
18 | ## 🔍 Usage:
19 | 
20 | ```
21 | python gquestions.py query <keyword> (en|es) [depth <depth>] [--csv] [--headless]
22 | ```
23 | 
24 | Print help message.
25 | 
26 | ```
27 | gquestions.py (-h | --help)
28 | ```
29 | 
30 | ## 💡 Examples:
31 | Search "flights" in English and export in html
32 | 
33 | ```
34 | python gquestions.py query "flights" en
35 | ```
36 | 
37 | Search headlessly "flights" in English and export in html
38 | ```
39 | python gquestions.py query "flights" en --headless   
40 | 
41 | ```
42 | 
43 | Search "vuelos" in Spanish and export in html and csv
44 | ```
45 | python gquestions.py query "vuelos" es --csv
46 | ```
47 | 
48 | Search "vuelos" in Spanish with a depth of 1 and export in html
49 | ```
50 | python gquestions.py query "vuelos" es depth 1 
51 | ```
52 | 
53 | Advanced use: using operators with queries:
54 | 
55 | ```
56 | python gquestions.py query '"vpn" site:https://protonmail.com/blog' en --csv
57 | ```
58 | 
59 | ## License
60 | All assets and code are under the GPL v3 License unless specified otherwise.
61 | 
62 | ## 👀 Help:
63 | Got stuck? Check help!
64 | ```
65 | python gquestions.py -h
66 | ```
67 | 
68 | ![Gquestions_graph](https://i.gyazo.com/5f9677d13ba9845e0f38972e4d8c6ed3.png)
69 | 


--------------------------------------------------------------------------------
/csv/flights_25-06-2019_21-21-20-237094.csv:
--------------------------------------------------------------------------------
 1 | ;parent;name;inner.name
 2 | 0;flights;How do I find the cheapest flights?;Do flight prices go down at night?
 3 | 1;flights;How do I find the cheapest flights?;How can I fly for free?
 4 | 2;flights;What is the cheapest day of the week to fly?;What days are cheapest to buy plane tickets?
 5 | 3;flights;What is the cheapest day of the week to fly?;What is the cheapest month to fly?
 6 | 4;flights;What is the cheapest day of the week to fly?;What days are flights the cheapest to buy?
 7 | 5;flights;What is the best site for airfare?;Is it cheaper to book flights online or with a travel agent?
 8 | 6;flights;What is the best site for airfare?;What airline is the cheapest?
 9 | 7;flights;What is the best site for airfare?;Which travel booking site is the best?
10 | 8;flights;What is the best day of the week to buy plane tickets?;Do flight prices change daily?
11 | 9;flights;What is the best day of the week to buy plane tickets?;Is it cheaper to book flights last minute?
12 | 10;flights;What is the best day of the week to buy plane tickets?;How many days before a flight is the best price?
13 | 


--------------------------------------------------------------------------------
/csv/vuelos_25-06-2019_20-38-14-746485.csv:
--------------------------------------------------------------------------------
 1 | ;parent;name;inner.name
 2 | 0;vuelos;¿Qué es kayak vuelos?;¿Qué kayak?
 3 | 1;vuelos;¿Qué es kayak vuelos?;¿Cómo se llama el deporte que se practica en canoa?
 4 | 2;vuelos;¿Cómo encontrar los vuelos más baratos?;¿Cuál es el día más barato para volar?
 5 | 3;vuelos;¿Cómo encontrar los vuelos más baratos?;¿Cuál es la temporada más baja del año para viajar?
 6 | 4;vuelos;¿Qué puede volar?;¿Qué es una escala en los vuelos?
 7 | 5;vuelos;¿Qué puede volar?;¿Qué es un vuelo sin escala?
 8 | 6;vuelos;¿Qué puede volar?;¿Cuáles son los vuelos charter?
 9 | 7;vuelos;¿Qué es Edream?;¿Cuáles son los vuelos de cabotaje?
10 | 8;vuelos;¿Qué es Edream?;¿Qué es el Chater?
11 | 9;vuelos;¿Qué es Edream?;¿Qué es un vuelo One Way?
12 | 


--------------------------------------------------------------------------------
/driver/chromedriver:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/nittolese/gquestions/7adb50219a23506ea05b49ae8aad920c5046d38d/driver/chromedriver


--------------------------------------------------------------------------------
/gquestions.py:
--------------------------------------------------------------------------------
  1 | usage='''
  2 | ❓❔👾 Gquestions CLI Usage ❔❓
  3 | 
  4 | 🔍 Usage:
  5 |     gquestions.py query <keyword> (en|es) [depth <depth>] [--csv] [--headless]
  6 |     gquestions.py (-h | --help)
  7 | 
  8 | 💡 Examples:
  9 |     ▶️  gquestions.py query "flights" en              Search "flights" in English and export in html
 10 |     ▶️  gquestions.py query "flights" en --headless   Search headlessly "flights" in English and export in html
 11 |     ▶️  gquestions.py query "vuelos" es --csv         Search "vuelos" in Spanish and export in html and csv
 12 |     ▶️  gquestions.py query "vuelos" es depth 1       Search "vuelos" in Spanish with a depth of 1 and export in html
 13 |     ▶️  gquestions.py -h                              Print this message
 14 |    
 15 | 👀 Options:
 16 |     -h, --help
 17 | 
 18 | '''
 19 | 
 20 | import os
 21 | import re
 22 | import sys
 23 | import json
 24 | import time
 25 | import datetime
 26 | import platform
 27 | from docopt import docopt
 28 | from tqdm import tqdm 
 29 | from time import sleep
 30 | import pandas as pd
 31 | from pandas.io.json import json_normalize
 32 | import logging
 33 | from jinja2 import Environment, FileSystemLoader
 34 | 
 35 | from selenium import webdriver
 36 | from selenium.webdriver.chrome.options import Options
 37 | from selenium.webdriver.common.keys import Keys
 38 | from selenium.webdriver.common.action_chains import ActionChains
 39 | from selenium.common.exceptions import NoSuchElementException, ElementClickInterceptedException
 40 | 
 41 | ''' 
 42 | Visualizza una barra di caricamento per mostrare l'attesa
 43 | '''
 44 | def sleepBar(seconds):
 45 |     for i in tqdm(range(seconds)):
 46 |         sleep(1)
 47 | 
 48 | def prettyOutputName(filetype='html'):
 49 |     _query = re.sub('\s|\"|\/|\:|\.','_', query.rstrip())
 50 |     prettyname = _query
 51 |     ts = time.time()
 52 |     st = datetime.datetime.fromtimestamp(ts).strftime('%d-%m-%Y_%H-%M-%S-%f')
 53 |     if filetype != 'html':
 54 |         prettyname += "_" + st + "." + filetype
 55 |     else:
 56 |         prettyname += "_" + st + "." + filetype
 57 |     return prettyname
 58 | 
 59 | 
 60 | def initBrowser(headless=False):
 61 |     if "Windows" in platform.system():
 62 |         chrome_path = "driver/chromedriver.exe"
 63 |     else:
 64 |         chrome_path = "driver/chromedriver"
 65 |     chrome_options = Options()
 66 |     chrome_options.add_argument("--disable-features=NetworkService")
 67 |     if headless:
 68 |         chrome_options.add_argument('headless')
 69 |     return webdriver.Chrome(options=chrome_options,executable_path=chrome_path)
 70 | """
 71 | Search on Google and returns the list of PAA questions in SERP.
 72 | """
 73 | def newSearch(browser,query):
 74 |     if lang== "en":
 75 |         browser.get("https://www.google.com?hl=en")
 76 |         searchbox = browser.find_element_by_xpath("//input[@aria-label='Search']")
 77 |     else:
 78 |         browser.get("https://www.google.com?hl=es")
 79 |         searchbox = browser.find_element_by_xpath("//input[@aria-label='Buscar']")
 80 |     
 81 |     searchbox.send_keys(query)
 82 |     sleepBar(2)
 83 |     tabNTimes()
 84 |     if lang== "en":
 85 |         searchbtn = browser.find_elements_by_xpath("//input[@aria-label='Google Search']")
 86 |     else:
 87 |     	searchbtn = browser.find_elements_by_xpath("//input[@aria-label='Buscar con Google']")
 88 |     try:
 89 |         searchbtn[-1].click()
 90 |     except:
 91 |         searchbtn[0].click()
 92 |     sleepBar(2)
 93 |     paa = browser.find_elements_by_xpath("//span/following-sibling::div[contains(@class,'match-mod-horizontal-padding')]")
 94 |     hideGBar()
 95 |     return paa
 96 | """
 97 | Helper function that scroll into view the PAA questions element.
 98 | """
 99 | def scrollToFeedback():
100 |     if lang == "en":
101 |         el = browser.find_element_by_xpath("//div[@class='kno-ftr']//div/following-sibling::a[text()='Feedback']")
102 |     else:
103 |     	el = browser.find_element_by_xpath("//div[@class='kno-ftr']//div/following-sibling::a[text()='Enviar comentarios']")
104 | 
105 |     actions = ActionChains(browser)
106 |     actions.move_to_element(el).perform()
107 |     browser.execute_script("arguments[0].scrollIntoView();", el)
108 |     actions.send_keys(Keys.PAGE_UP).perform()
109 |     sleepBar(1)
110 | """
111 | Accessibility helper: press TAB N times (default 2)
112 | """
113 | def tabNTimes(N=2):
114 |     actions = ActionChains(browser) 
115 |     for _ in range(N):
116 |         actions = actions.send_keys(Keys.TAB)
117 |     actions.perform()
118 | 
119 | """
120 | Click on questions N times
121 | """
122 | def clickNTimes(el, n=1):
123 |     for i in range(n):
124 |         el.click()
125 |         logging.info(f"clicking on ... {el.text}")
126 |         sleepBar(1)
127 |         scrollToFeedback()
128 |         try:
129 |             el.find_element_by_xpath("//*[@aria-expanded='true']").click()
130 |         except:
131 |             pass
132 |         sleepBar(1)
133 | 
134 | """
135 | Hide Google Bar to prevent ClickInterceptionError
136 | """
137 | def hideGBar():
138 | 	try:
139 | 		browser.execute_script('document.getElementById("searchform").style.display = "none";')
140 | 	except:
141 | 		pass
142 | 
143 | """
144 | Where the magic happens
145 | """
146 | def crawlQuestions(start_paa, paa_list, initialSet, depth=0):
147 |     _tmp = createNode(paa_lst=paa_list, name=query, children=True)
148 |     
149 |     outer_cnt = 0
150 |     for q in start_paa:
151 |         scrollToFeedback()
152 |         if "Dictionary" in q.text:
153 |             continue
154 |         test = createNode(paa_lst=paa_list, n=0,
155 |                         name=q.text,
156 |                         parent=paa_list[0]["name"],
157 |                         children=True)
158 |         
159 |         clickNTimes(q)
160 |         new_q = showNewQuestions(initialSet)
161 |         for l, value in new_q.items():
162 |             sleepBar(1)
163 |             logging.info(f"{l}, {value.text}")
164 |             test1 = createNode(paa_lst=test[0]["children"][outer_cnt]["children"], 
165 |                                 name=value.text,
166 |                                 parent=test[0]["children"][outer_cnt]["name"],
167 |                                 children=True)
168 |             
169 |         initialSet = getCurrentSERP()
170 |         logging.info(f"Current count: {outer_cnt}")
171 |         outer_cnt += 1
172 |         if depth==1:
173 |             for i in range(depth):
174 |                 currentQuestions = []
175 |                 for i in initialSet.values():
176 |                     currentQuestions.append(i.text)
177 |                 for i in paa_list[0]["children"]:
178 |                     for j in i["children"]:
179 |                         parent = j['name']
180 |                         logging.info(parent)
181 |                         _tmpset = set()
182 |                         if parent in currentQuestions:
183 |                             try:
184 |                                 if "'" in parent:
185 |                                     xpath_compiler = '//div[text()="' + parent + '"]'
186 |                                 else: 
187 |                                     xpath_compiler= "//div[text()='" + parent + "']"
188 |                                 question= browser.find_element_by_xpath(xpath_compiler)
189 |                             except NoSuchElementException:
190 |                                 continue
191 |                             scrollToFeedback()
192 |                             sleepBar(1)
193 |                             clickNTimes(question)
194 |                             new_q = showNewQuestions(initialSet)
195 |                             for l, value in new_q.items():
196 |                                 if value.text == parent:
197 |                                     continue
198 |                                 j['children'].append({"name": value.text,"parent": parent})
199 |                                 
200 |                             initialSet = getCurrentSERP()
201 | 
202 | """
203 | Get the current Result Page.
204 | 
205 | Returns: 
206 |     A list with newest questions.
207 | 
208 | """
209 | def getCurrentSERP():
210 |     _tmpset = {}
211 |     new_paa = browser.find_elements_by_xpath("//span/following-sibling::div[contains(@class,'match-mod-horizontal-padding')]")
212 |     cnt= 0
213 |     for q in new_paa:
214 |         _tmpset.update({cnt:q})
215 |         cnt +=1
216 |     newInitialSet = _tmpset
217 |     return newInitialSet
218 | 
219 | """
220 | Shows new questions.
221 | 
222 | Args:
223 |     intialSet (dict): The initial set in the PAA box.
224 | Returns:
225 |     list of questions with first 3-4 questions deleted (initalSet).
226 | """
227 | def showNewQuestions(initialSet):
228 |     tmp = getCurrentSERP()
229 |     deletelist = [k for k, v in initialSet.items() if k in tmp and tmp[k] == v]
230 |     _tst = dict.copy(tmp)
231 |     for i,value in tmp.items():
232 |         if i in deletelist:
233 |             _tst.pop(i)
234 |     return _tst
235 | 
236 | """
237 | Create a new node in the list.
238 | 
239 | Args:
240 |     paa_list_elements: list of web elements
241 |     n: index of 'children' list on a main node
242 |     name: node nome
243 |     parent: Indicates if the node has a parent. Default to null only for first level.
244 |     chilren: Indicates if the node has a children list. default false
245 | 
246 | Returns:
247 |     list of questions with the current new node
248 | """
249 | def createNode( n=-1, parent='null', children=False, name='',*, paa_lst):
250 |     logging.info(paa_lst)
251 |     if children:
252 |         _d = {
253 |         "name": name,
254 |         "parent": parent,
255 |         "children": [] 
256 |         }
257 |     else:
258 |         _d = {
259 |         "name": name,
260 |         "parent": parent
261 |         }
262 |     if n!=-1:
263 |         logging.info(paa_lst[n]["children"])
264 |         paa_lst[n]["children"].append(_d)
265 |     else:
266 |         paa_lst.append(_d)
267 |     
268 | 
269 |     return paa_lst
270 | 
271 | """
272 | This func takes in input JSON data and returns csv file.
273 | """
274 | def flatten_csv(data,depth,prettyname):
275 |     try:
276 |         if depth == 0:
277 |             _ = json_normalize(data[0]["children"], 'children', ['name', 'parent',['children',]], record_prefix='inner.')
278 |             _.drop(columns=['children','inner.children','inner.parent'], inplace=True)
279 |             columnTitle = ['parent','name','inner.name']
280 |             _ = _.reindex(columns=columnTitle)
281 |             _.to_csv(prettyname,sep=";",encoding='utf-8')
282 |         elif depth == 1:
283 |             df = json_normalize(data[0]["children"], meta=['name','children','parent'], record_path="children", record_prefix='inner.')
284 |             frames = [ json_normalize(i) for i in df['inner.children'] ]
285 |             result = pd.concat(frames)
286 |             result.rename(columns={"name": "inner.inner.name", "parent": "inner.name"}, inplace=True)
287 |             merge = pd.merge(df, result, how='left', on="inner.name")
288 |             merge.drop(columns=['name'], inplace=True)
289 |             columnTitle = ['parent','inner.parent','inner.name','inner.inner.name']
290 |             merge = merge.reindex(columns=columnTitle)
291 |             merge = merge.drop_duplicates(subset='inner.inner.name', keep='first')
292 |             merge.to_csv(prettyname,sep=';',encoding='utf-8')
293 |     except Exception as e:
294 |         logging.warning(f"{e}")
295 | 
296 | if __name__ == "__main__":
297 |     logging.basicConfig(level=logging.INFO)
298 |     args = docopt(usage)
299 |     print(args)
300 |     MAX_DEPTH = 1
301 | 
302 |     if args['<depth>']:
303 |         depth = int(args['<depth>'])
304 |         if depth > MAX_DEPTH:
305 |             sys.exit("depth not allowed")
306 |     else:
307 |         depth = 0
308 | 
309 |     if args['en']:
310 |         lang = "en"
311 |     elif args['es']:
312 |         lang = "es"
313 |         
314 | 
315 | 
316 |     if args['<keyword>']:
317 |         if args['--headless']:
318 |             browser = initBrowser(True)
319 |         else:
320 |             browser = initBrowser()
321 |         query = args['<keyword>']
322 |         start_paa = newSearch(browser,query)
323 | 
324 |         initialSet = {}
325 |         cnt= 0
326 |         for q in start_paa:
327 |             initialSet.update({cnt:q})
328 |             cnt +=1
329 | 
330 |         paa_list = []
331 | 
332 |         crawlQuestions(start_paa, paa_list, initialSet,depth)
333 |         treeData = 'var treeData = ' + json.dumps(paa_list) + ';'
334 |         
335 |         if paa_list[0]['children']:
336 |             root = os.path.dirname(os.path.abspath(__file__))
337 |             templates_dir = os.path.join(root, 'templates')
338 |             env = Environment( loader = FileSystemLoader(templates_dir) )
339 |             template = env.get_template('index.html')
340 |             filename = os.path.join(root, 'html', prettyOutputName())
341 |             with open(filename, 'w') as fh:
342 |                 fh.write(template.render(
343 |                     treeData = treeData,
344 |                 ))
345 | 
346 |     if args['--csv']:
347 |         if paa_list[0]['children']:
348 |             _path = 'csv/'+prettyOutputName('csv')
349 |             flatten_csv(paa_list, depth, _path)
350 | 
351 |     browser.close()


--------------------------------------------------------------------------------
/html/SEO_16-06-2019_14-19-02-257390.html:
--------------------------------------------------------------------------------
  1 | <!DOCTYPE html>
  2 | <html lang="en">
  3 |   <head>
  4 |     <meta charset="utf-8">
  5 | 
  6 |     <title>Tree Example</title>
  7 | 
  8 |     <style>
  9 | 	
 10 | 	.node {
 11 | 		cursor: pointer;
 12 | 	}
 13 | 
 14 | 	.node circle {
 15 | 	  fill: #fff;
 16 | 	  stroke: steelblue;
 17 | 	  stroke-width: 3px;
 18 | 	}
 19 | 
 20 | 	.node text {
 21 | 	  font: 12px sans-serif;
 22 | 	}
 23 | 
 24 | 	.link {
 25 | 	  fill: none;
 26 | 	  stroke: #ccc;
 27 | 	  stroke-width: 2px;
 28 | 	}
 29 | 	
 30 |     </style>
 31 | 
 32 |   </head>
 33 | 
 34 |   <body>
 35 | 
 36 | <!-- load the d3.js library -->	
 37 | <script src="http://d3js.org/d3.v3.min.js"></script>
 38 | <script>
 39 | var treeData = [{"name": "Top Level", "parent": "null", "children": [{"name": "What is the SEO in marketing?", "parent": "Top Level", "children": [{"name": "How much does SEO cost?", "parent": "What is the SEO in marketing?", "children": [{"name": "How much does SEO cost per month UK?", "parent": "How much does SEO cost?"}, {"name": "Is SEO Cost Effective?", "parent": "How much does SEO cost?"}, {"name": "Is SEO worth the money?", "parent": "How much does SEO cost?"}, {"name": "Can you do SEO yourself?", "parent": "How much does SEO cost?"}, {"name": "How long does SEO take to start working?", "parent": "How much does SEO cost?"}, {"name": "Why is SEO so expensive?", "parent": "How much does SEO cost?"}, {"name": "Does SEO really work?", "parent": "How much does SEO cost?"}, {"name": "How much should I spend on SEO per month?", "parent": "How much does SEO cost?"}, {"name": "How do you price SEO services?", "parent": "How much does SEO cost?"}, {"name": "How do I become an SEO expert?", "parent": "How much does SEO cost?"}, {"name": "What is monthly SEO?", "parent": "How much does SEO cost?"}, {"name": "Can I do SEO on my own?", "parent": "How much does SEO cost?"}, {"name": "How much does SEO cost per month UK?", "parent": "How much does SEO cost?"}, {"name": "Is SEO worth the money?", "parent": "How much does SEO cost?"}, {"name": "Can you do SEO yourself?", "parent": "How much does SEO cost?"}, {"name": "Is SEO free?", "parent": "How much does SEO cost?"}, {"name": "Why is SEO so expensive?", "parent": "How much does SEO cost?"}, {"name": "How much should I spend on SEO per month?", "parent": "How much does SEO cost?"}, {"name": "How much does SEO cost per month UK?", "parent": "How much does SEO cost?"}, {"name": "Is SEO worth the money?", "parent": "How much does SEO cost?"}, {"name": "Can you do SEO yourself?", "parent": "How much does SEO cost?"}, {"name": "Is SEO Cost Effective?", "parent": "How much does SEO cost?"}, {"name": "Why is SEO so expensive?", "parent": "How much does SEO cost?"}, {"name": "How do you price SEO services?", "parent": "How much does SEO cost?"}]}, {"name": "What is SEO in simple words?", "parent": "What is the SEO in marketing?", "children": [{"name": "What do SEO companies actually do?", "parent": "What is SEO in simple words?"}, {"name": "How can I check my SEO ranking?", "parent": "What is SEO in simple words?"}, {"name": "Why SEO is so important?", "parent": "What is SEO in simple words?"}, {"name": "What exactly is SEO?", "parent": "What is SEO in simple words?"}, {"name": "What is SEO writing?", "parent": "What is SEO in simple words?"}, {"name": "How can I learn SEO for free?", "parent": "What is SEO in simple words?"}, {"name": "How do you do SEO?", "parent": "What is SEO in simple words?"}, {"name": "How can I learn SEO?", "parent": "What is SEO in simple words?"}, {"name": "What is backlink in SEO?", "parent": "What is SEO in simple words?"}, {"name": "Is SEO free?", "parent": "What is SEO in simple words?"}, {"name": "How do you explain SEO?", "parent": "What is SEO in simple words?"}, {"name": "What is SEO and how it works?", "parent": "What is SEO in simple words?"}, {"name": "What do SEO companies actually do?", "parent": "What is SEO in simple words?"}, {"name": "Why SEO is so important?", "parent": "What is SEO in simple words?"}, {"name": "What exactly is SEO?", "parent": "What is SEO in simple words?"}, {"name": "What is SEO job?", "parent": "What is SEO in simple words?"}, {"name": "How do you explain SEO?", "parent": "What is SEO in simple words?"}, {"name": "What is SEO and how it works?", "parent": "What is SEO in simple words?"}, {"name": "What do SEO companies actually do?", "parent": "What is SEO in simple words?"}, {"name": "Why SEO is so important?", "parent": "What is SEO in simple words?"}, {"name": "What exactly is SEO?", "parent": "What is SEO in simple words?"}, {"name": "How can I check my SEO ranking?", "parent": "What is SEO in simple words?"}, {"name": "What is SEO writing?", "parent": "What is SEO in simple words?"}]}]}, {"name": "What is SEO and how it works?", "parent": "Top Level", "children": [{"name": "How SEO is done?", "parent": "What is SEO and how it works?", "children": [{"name": "Is SEO easy to do?", "parent": "How SEO is done?"}, {"name": "How can I make my SEO better?", "parent": "How SEO is done?"}, {"name": "How can I learn SEO fast?", "parent": "How SEO is done?"}, {"name": "Which is best SEO tool?", "parent": "How SEO is done?"}, {"name": "How do I SEO my website?", "parent": "How SEO is done?"}, {"name": "What are SEO best practices?", "parent": "How SEO is done?"}, {"name": "How can I do SEO for free?", "parent": "How SEO is done?"}, {"name": "How can I learn SEO for free?", "parent": "How SEO is done?"}, {"name": "Is SEO easy to do?", "parent": "How SEO is done?"}, {"name": "How can I make my SEO better?", "parent": "How SEO is done?"}, {"name": "How can I learn SEO fast?", "parent": "How SEO is done?"}, {"name": "How do I get started with SEO?", "parent": "How SEO is done?"}, {"name": "How can SEO be done in easiest way?", "parent": "How SEO is done?"}, {"name": "How can I learn SEO at home?", "parent": "How SEO is done?"}, {"name": "How can I do SEO for free?", "parent": "How SEO is done?"}, {"name": "How can I learn SEO for free?", "parent": "How SEO is done?"}]}, {"name": "How SEO works step by step?", "parent": "What is SEO and how it works?", "children": [{"name": "How can I use SEO keywords for my website?", "parent": "How SEO works step by step?"}, {"name": "What are the SEO tools?", "parent": "How SEO works step by step?"}, {"name": "What goes SEO?", "parent": "How SEO works step by step?"}, {"name": "How much does SEO cost?", "parent": "How SEO works step by step?"}, {"name": "What is SEO and its types?", "parent": "How SEO works step by step?"}, {"name": "How can I improve my SEO ranking?", "parent": "How SEO works step by step?"}, {"name": "How can I start SEO business?", "parent": "How SEO works step by step?"}, {"name": "What is SMO in SEO?", "parent": "How SEO works step by step?"}, {"name": "How can I use SEO keywords for my website?", "parent": "How SEO works step by step?"}, {"name": "How do I get the best SEO for my website?", "parent": "How SEO works step by step?"}, {"name": "What are the SEO tools?", "parent": "How SEO works step by step?"}, {"name": "How can I create SEO?", "parent": "How SEO works step by step?"}, {"name": "What is SEO and its types?", "parent": "How SEO works step by step?"}, {"name": "How can I use SEO keywords for my website?", "parent": "How SEO works step by step?"}, {"name": "Can I do SEO on my own?", "parent": "How SEO works step by step?"}, {"name": "What are the SEO tools?", "parent": "How SEO works step by step?"}]}, {"name": "What are the benefits of SEO?", "parent": "What is SEO and how it works?", "children": [{"name": "What is the need of SEO?", "parent": "What are the benefits of SEO?"}, {"name": "How SEO improve your business?", "parent": "What are the benefits of SEO?"}, {"name": "What is the purpose of SEO?", "parent": "What are the benefits of SEO?"}, {"name": "Is SEO Cost Effective?", "parent": "What are the benefits of SEO?"}, {"name": "Why do websites need SEO?", "parent": "What are the benefits of SEO?"}, {"name": "Why does SEO matter?", "parent": "What are the benefits of SEO?"}, {"name": "Does SEO really matter?", "parent": "What are the benefits of SEO?"}, {"name": "How long does it take to get SEO results?", "parent": "What are the benefits of SEO?"}, {"name": "Is SEO Cost Effective?", "parent": "What are the benefits of SEO?"}, {"name": "What is the need of SEO?", "parent": "What are the benefits of SEO?"}, {"name": "How SEO improve your business?", "parent": "What are the benefits of SEO?"}, {"name": "Does SEO really matter?", "parent": "What are the benefits of SEO?"}, {"name": "How long does it take to get SEO results?", "parent": "What are the benefits of SEO?"}, {"name": "What is the need of SEO?", "parent": "What are the benefits of SEO?"}, {"name": "How effective is SEO?", "parent": "What are the benefits of SEO?"}, {"name": "How SEO improve your business?", "parent": "What are the benefits of SEO?"}]}]}, {"name": "What is SEO and its types?", "parent": "Top Level", "children": [{"name": "What is SEO in simple words?", "parent": "What is SEO and its types?", "children": [{"name": "What is SEO writing?", "parent": "What is SEO in simple words?"}, {"name": "How do you do SEO?", "parent": "What is SEO in simple words?"}, {"name": "How can I learn SEO?", "parent": "What is SEO in simple words?"}, {"name": "How can I check my SEO ranking?", "parent": "What is SEO in simple words?"}, {"name": "How much does SEO cost?", "parent": "What is SEO in simple words?"}, {"name": "Is SEO free?", "parent": "What is SEO in simple words?"}, {"name": "What is SEO job?", "parent": "What is SEO in simple words?"}, {"name": "How do you explain SEO?", "parent": "What is SEO in simple words?"}, {"name": "What do SEO companies actually do?", "parent": "What is SEO in simple words?"}, {"name": "Why SEO is so important?", "parent": "What is SEO in simple words?"}, {"name": "What exactly is SEO?", "parent": "What is SEO in simple words?"}]}, {"name": "What is GREY hat techniques in SEO?", "parent": "What is SEO and its types?", "children": [{"name": "How can I increase traffic to my website for free?", "parent": "What is GREY hat techniques in SEO?"}, {"name": "How do I have a negative SEO?", "parent": "What is GREY hat techniques in SEO?"}, {"name": "What are the black hat SEO techniques?", "parent": "What is GREY hat techniques in SEO?"}, {"name": "How many types of SEO are there?", "parent": "What is GREY hat techniques in SEO?"}, {"name": "What are GREY hat techniques?", "parent": "What is GREY hat techniques in SEO?"}, {"name": "What are gray hat hackers?", "parent": "What is GREY hat techniques in SEO?"}, {"name": "How can I increase traffic to my website for free?", "parent": "What is GREY hat techniques in SEO?"}, {"name": "How do I have a negative SEO?", "parent": "What is GREY hat techniques in SEO?"}, {"name": "What are the black hat SEO techniques?", "parent": "What is GREY hat techniques in SEO?"}, {"name": "How many types of SEO are there?", "parent": "What is GREY hat techniques in SEO?"}, {"name": "What are GREY hat techniques?", "parent": "What is GREY hat techniques in SEO?"}, {"name": "What are gray hat hackers?", "parent": "What is GREY hat techniques in SEO?"}]}, {"name": "What are two types of SEO?", "parent": "What is SEO and its types?", "children": [{"name": "What are the 3 types of?", "parent": "What are two types of SEO?"}, {"name": "What is onpage and offpage SEO?", "parent": "What are two types of SEO?"}, {"name": "What are the techniques for SEO?", "parent": "What are two types of SEO?"}, {"name": "What is SEO and type of SEO?", "parent": "What are two types of SEO?"}, {"name": "What are the best off page SEO techniques?", "parent": "What are two types of SEO?"}, {"name": "How do you do off page SEO?", "parent": "What are two types of SEO?"}, {"name": "What are the 3 types of?", "parent": "What are two types of SEO?"}, {"name": "What is onpage and offpage SEO?", "parent": "What are two types of SEO?"}, {"name": "What are the SEO techniques?", "parent": "What are two types of SEO?"}, {"name": "What is SEO and type of SEO?", "parent": "What are two types of SEO?"}, {"name": "What are the best off page SEO techniques?", "parent": "What are two types of SEO?"}, {"name": "How do you do off page SEO?", "parent": "What are two types of SEO?"}]}]}, {"name": "What is the best way to do SEO for your website?", "parent": "Top Level", "children": [{"name": "How can I do SEO for free?", "parent": "What is the best way to do SEO for your website?", "children": [{"name": "How do I hire a SEO expert?", "parent": "How can I do SEO for free?"}, {"name": "How can I be SEO expert?", "parent": "How can I do SEO for free?"}, {"name": "How can I learn SEO fast?", "parent": "How can I do SEO for free?"}, {"name": "What is the fastest way to rank a keyword?", "parent": "How can I do SEO for free?"}, {"name": "How do I get my website to rank higher on Google?", "parent": "How can I do SEO for free?"}, {"name": "How do I start a career in SEO?", "parent": "How can I do SEO for free?"}]}, {"name": "Can I do SEO on my own?", "parent": "What is the best way to do SEO for your website?", "children": [{"name": "How do I become SEO certified?", "parent": "Can I do SEO on my own?"}, {"name": "How do I find a good company for SEO?", "parent": "Can I do SEO on my own?"}, {"name": "How can I make my SEO better?", "parent": "Can I do SEO on my own?"}, {"name": "How do I become an SEO analyst?", "parent": "Can I do SEO on my own?"}, {"name": "How can I create SEO?", "parent": "Can I do SEO on my own?"}, {"name": "How do I hire a SEO company?", "parent": "Can I do SEO on my own?"}]}, {"name": "How can I learn SEO for free?", "parent": "What is the best way to do SEO for your website?", "children": [{"name": "Is SEO easy to learn?", "parent": "How can I learn SEO for free?"}, {"name": "How much does SEO cost per month?", "parent": "How can I learn SEO for free?"}, {"name": "How can I do SEO at home?", "parent": "How can I learn SEO for free?"}, {"name": "How can I learn SEO easily?", "parent": "How can I learn SEO for free?"}, {"name": "How do I become an SEO expert?", "parent": "How can I learn SEO for free?"}, {"name": "How do you run a successful SEO campaign?", "parent": "How can I learn SEO for free?"}]}]}]}];
 40 | </script>
 41 | <script>
 42 | 
 43 | 
 44 | // ************** Generate the tree diagram	 *****************
 45 | var margin = {top: 20, right: 120, bottom: 20, left: 120},
 46 | 	width = 1080 - margin.right - margin.left,
 47 | 	height = 960 - margin.top - margin.bottom;
 48 | 	
 49 | var i = 0,
 50 | 	duration = 750,
 51 | 	root;
 52 | 
 53 | var tree = d3.layout.tree()
 54 | 	.size([height, width]);
 55 | 
 56 | var diagonal = d3.svg.diagonal()
 57 | 	.projection(function(d) { return [d.y, d.x]; });
 58 | 
 59 | var svg = d3.select("body").append("svg")
 60 | 	.attr("width", width + margin.right + margin.left)
 61 | 	.attr("height", height + margin.top + margin.bottom)
 62 |   .append("g")
 63 | 	.attr("transform", "translate(" + margin.left + "," + margin.top + ")");
 64 | 
 65 | root = treeData[0];
 66 | root.x0 = height / 2;
 67 | root.y0 = 0;
 68 |   
 69 | update(root);
 70 | 
 71 | d3.select(self.frameElement).style("height", "500px");
 72 | 
 73 | function update(source) {
 74 | 
 75 |   // Compute the new tree layout.
 76 |   var nodes = tree.nodes(root).reverse(),
 77 | 	  links = tree.links(nodes);
 78 | 
 79 |   // Normalize for fixed-depth.
 80 |   nodes.forEach(function(d) { d.y = d.depth * 180; });
 81 | 
 82 |   // Update the nodes…
 83 |   var node = svg.selectAll("g.node")
 84 | 	  .data(nodes, function(d) { return d.id || (d.id = ++i); });
 85 | 
 86 |   // Enter any new nodes at the parent's previous position.
 87 |   var nodeEnter = node.enter().append("g")
 88 | 	  .attr("class", "node")
 89 | 	  .attr("transform", function(d) { return "translate(" + source.y0 + "," + source.x0 + ")"; })
 90 | 	  .on("click", click);
 91 | 
 92 |   nodeEnter.append("circle")
 93 | 	  .attr("r", 1e-6)
 94 | 	  .style("fill", function(d) { return d._children ? "lightsteelblue" : "#fff"; });
 95 | 
 96 |   nodeEnter.append("text")
 97 | 	  .attr("x", function(d) { return d.children || d._children ? -13 : 13; })
 98 | 	  .attr("dy", ".35em")
 99 | 	  .attr("text-anchor", function(d) { return d.children || d._children ? "end" : "start"; })
100 | 	  .text(function(d) { return d.name; })
101 | 	  .style("fill-opacity", 1e-6);
102 | 
103 |   // Transition nodes to their new position.
104 |   var nodeUpdate = node.transition()
105 | 	  .duration(duration)
106 | 	  .attr("transform", function(d) { return "translate(" + d.y + "," + d.x + ")"; });
107 | 
108 |   nodeUpdate.select("circle")
109 | 	  .attr("r", 10)
110 | 	  .style("fill", function(d) { return d._children ? "lightsteelblue" : "#fff"; });
111 | 
112 |   nodeUpdate.select("text")
113 | 	  .style("fill-opacity", 1);
114 | 
115 |   // Transition exiting nodes to the parent's new position.
116 |   var nodeExit = node.exit().transition()
117 | 	  .duration(duration)
118 | 	  .attr("transform", function(d) { return "translate(" + source.y + "," + source.x + ")"; })
119 | 	  .remove();
120 | 
121 |   nodeExit.select("circle")
122 | 	  .attr("r", 1e-6);
123 | 
124 |   nodeExit.select("text")
125 | 	  .style("fill-opacity", 1e-6);
126 | 
127 |   // Update the links…
128 |   var link = svg.selectAll("path.link")
129 | 	  .data(links, function(d) { return d.target.id; });
130 | 
131 |   // Enter any new links at the parent's previous position.
132 |   link.enter().insert("path", "g")
133 | 	  .attr("class", "link")
134 | 	  .attr("d", function(d) {
135 | 		var o = {x: source.x0, y: source.y0};
136 | 		return diagonal({source: o, target: o});
137 | 	  });
138 | 
139 |   // Transition links to their new position.
140 |   link.transition()
141 | 	  .duration(duration)
142 | 	  .attr("d", diagonal);
143 | 
144 |   // Transition exiting nodes to the parent's new position.
145 |   link.exit().transition()
146 | 	  .duration(duration)
147 | 	  .attr("d", function(d) {
148 | 		var o = {x: source.x, y: source.y};
149 | 		return diagonal({source: o, target: o});
150 | 	  })
151 | 	  .remove();
152 | 
153 |   // Stash the old positions for transition.
154 |   nodes.forEach(function(d) {
155 | 	d.x0 = d.x;
156 | 	d.y0 = d.y;
157 |   });
158 | }
159 | 
160 | // Toggle children on click.
161 | function click(d) {
162 |   if (d.children) {
163 | 	d._children = d.children;
164 | 	d.children = null;
165 |   } else {
166 | 	d.children = d._children;
167 | 	d._children = null;
168 |   }
169 |   update(d);
170 | }
171 | 
172 | </script>
173 | 	
174 |   </body>
175 | </html>


--------------------------------------------------------------------------------
/html/amazon net worth_16-06-2019_14-07-55-212877.html:
--------------------------------------------------------------------------------
  1 | <!DOCTYPE html>
  2 | <html lang="en">
  3 |   <head>
  4 |     <meta charset="utf-8">
  5 | 
  6 |     <title>Tree Example</title>
  7 | 
  8 |     <style>
  9 | 	
 10 | 	.node {
 11 | 		cursor: pointer;
 12 | 	}
 13 | 
 14 | 	.node circle {
 15 | 	  fill: #fff;
 16 | 	  stroke: steelblue;
 17 | 	  stroke-width: 3px;
 18 | 	}
 19 | 
 20 | 	.node text {
 21 | 	  font: 12px sans-serif;
 22 | 	}
 23 | 
 24 | 	.link {
 25 | 	  fill: none;
 26 | 	  stroke: #ccc;
 27 | 	  stroke-width: 2px;
 28 | 	}
 29 | 	
 30 |     </style>
 31 | 
 32 |   </head>
 33 | 
 34 |   <body>
 35 | 
 36 | <!-- load the d3.js library -->	
 37 | <script src="http://d3js.org/d3.v3.min.js"></script>
 38 | <script>
 39 | var treeData = [{"name": "Top Level", "parent": "null", "children": [{"name": "What is Amazon's net worth 2018?", "parent": "Top Level", "children": [{"name": "How is Jeff Bezos richer than Bill Gates?", "parent": "What is Amazon's net worth 2018?", "children": [{"name": "Which famous billionaire had a talk show with her own name?", "parent": "How is Jeff Bezos richer than Bill Gates?"}, {"name": "Who is the wealthiest billionaire?", "parent": "How is Jeff Bezos richer than Bill Gates?"}, {"name": "Who is richer Bill Gates or Warren Buffett?", "parent": "How is Jeff Bezos richer than Bill Gates?"}, {"name": "Who is the richest person in history?", "parent": "How is Jeff Bezos richer than Bill Gates?"}, {"name": "Who will be the first trillionaire?", "parent": "How is Jeff Bezos richer than Bill Gates?"}, {"name": "Who is the richest person in the USA 2019?", "parent": "How is Jeff Bezos richer than Bill Gates?"}, {"name": "How much is Bezos worth today?", "parent": "How is Jeff Bezos richer than Bill Gates?"}, {"name": "What is Jeff Bezos net worth today?", "parent": "How is Jeff Bezos richer than Bill Gates?"}, {"name": "How rich is USA?", "parent": "How is Jeff Bezos richer than Bill Gates?"}, {"name": "Who's the richest man in United States?", "parent": "How is Jeff Bezos richer than Bill Gates?"}, {"name": "How does Jeff Bezos have so much money?", "parent": "How is Jeff Bezos richer than Bill Gates?"}, {"name": "Is Warren Buffett the richest man in America?", "parent": "How is Jeff Bezos richer than Bill Gates?"}]}, {"name": "Is Amazon richer than Apple?", "parent": "What is Amazon's net worth 2018?", "children": [{"name": "What is the richest company?", "parent": "Is Amazon richer than Apple?"}, {"name": "Is Walmart richer than Apple?", "parent": "Is Amazon richer than Apple?"}, {"name": "Is Amazon more valuable than Apple?", "parent": "Is Amazon richer than Apple?"}, {"name": "Is Amazon worth a trillion dollars?", "parent": "Is Amazon richer than Apple?"}, {"name": "How much is Microsoft net worth?", "parent": "Is Amazon richer than Apple?"}, {"name": "Is Microsoft worth more than Apple?", "parent": "Is Amazon richer than Apple?"}, {"name": "What is Amazon net worth?", "parent": "Is Amazon richer than Apple?"}, {"name": "Is Amazon an American company?", "parent": "Is Amazon richer than Apple?"}, {"name": "What is Google's net worth?", "parent": "Is Amazon richer than Apple?"}, {"name": "Who much is Oprah worth?", "parent": "Is Amazon richer than Apple?"}, {"name": "How Much Is Donald Trump really worth?", "parent": "Is Amazon richer than Apple?"}, {"name": "What did Susan Buffett die of?", "parent": "Is Amazon richer than Apple?"}]}]}, {"name": "How Much Is Amazon worth 2017?", "parent": "Top Level", "children": [{"name": "Is Amazon or Walmart worth more?", "parent": "How Much Is Amazon worth 2017?", "children": [{"name": "Is Walmart the richest company in the world?", "parent": "Is Amazon or Walmart worth more?"}, {"name": "Can Walmart beat Amazon?", "parent": "Is Amazon or Walmart worth more?"}, {"name": "Is Amazon cheaper than Walmart?", "parent": "Is Amazon or Walmart worth more?"}, {"name": "Who are the largest online retailers?", "parent": "Is Amazon or Walmart worth more?"}, {"name": "Who is Warren Buffet married to?", "parent": "Is Amazon or Walmart worth more?"}, {"name": "Who is Warren Buffett's daughter?", "parent": "Is Amazon or Walmart worth more?"}, {"name": "When did Susan Buffett die?", "parent": "Is Amazon or Walmart worth more?"}]}, {"name": "What's the most expensive company in the world?", "parent": "How Much Is Amazon worth 2017?", "children": [{"name": "Who is the richest company in the world 2018?", "parent": "What's the most expensive company in the world?"}, {"name": "Who is the richest company in the world 2019?", "parent": "What's the most expensive company in the world?"}, {"name": "Who owns the most shares of Apple?", "parent": "What's the most expensive company in the world?"}, {"name": "What is Disney's net worth?", "parent": "What's the most expensive company in the world?"}, {"name": "Is Aramco the biggest company in the world?", "parent": "What's the most expensive company in the world?"}, {"name": "What company employs the most workers in the world?", "parent": "What's the most expensive company in the world?"}, {"name": "What is Apple as a company?", "parent": "What's the most expensive company in the world?"}, {"name": "Where is alphabet Inc located?", "parent": "What's the most expensive company in the world?"}]}, {"name": "Who is Bill Gates net worth?", "parent": "How Much Is Amazon worth 2017?", "children": [{"name": "Who much is Oprah worth?", "parent": "Who is Bill Gates net worth?"}, {"name": "Why is Bill Gates so rich?", "parent": "Who is Bill Gates net worth?"}, {"name": "How much is Donald Trump worth?", "parent": "Who is Bill Gates net worth?"}, {"name": "Is Bill Gates the richest man alive?", "parent": "Who is Bill Gates net worth?"}, {"name": "Did Steve Jobs go to college?", "parent": "Who is Bill Gates net worth?"}, {"name": "How much money did Bill Gates give away?", "parent": "Who is Bill Gates net worth?"}, {"name": "Why is Bill Gates so rich?", "parent": "Who is Bill Gates net worth?"}, {"name": "Who is Elon Musk net worth?", "parent": "Who is Bill Gates net worth?"}, {"name": "Which is the richest man in the world?", "parent": "Who is Bill Gates net worth?"}]}]}, {"name": "What is Jeff Bezos net worth today?", "parent": "Top Level", "children": [{"name": "Which is the richest man in the world?", "parent": "What is Jeff Bezos net worth today?", "children": [{"name": "Who was the poorest US President?", "parent": "Which is the richest man in the world?"}, {"name": "What state has the most billionaires?", "parent": "Which is the richest man in the world?"}, {"name": "Is Mark Zuckerberg a billionaire?", "parent": "Which is the richest man in the world?"}, {"name": "Which country has the most millionaires?", "parent": "Which is the richest man in the world?"}, {"name": "Which country has the most billionaires 2019?", "parent": "Which is the richest man in the world?"}, {"name": "How old is Halle Berry?", "parent": "Which is the richest man in the world?"}]}, {"name": "Who is Elon Musk net worth?", "parent": "What is Jeff Bezos net worth today?", "children": [{"name": "How did Tesla start?", "parent": "Who is Elon Musk net worth?"}, {"name": "How does Elon Musk have so much money?", "parent": "Who is Elon Musk net worth?"}, {"name": "Is Tesla an American company?", "parent": "Who is Elon Musk net worth?"}, {"name": "How much is Elon Musk worth today?", "parent": "Who is Elon Musk net worth?"}, {"name": "Is Elon Musk married?", "parent": "Who is Elon Musk net worth?"}, {"name": "What did Elon Musk study?", "parent": "Who is Elon Musk net worth?"}]}, {"name": "Who are the richest woman in the world?", "parent": "What is Jeff Bezos net worth today?", "children": [{"name": "Who is the richest black woman in the world?", "parent": "Who are the richest woman in the world?"}, {"name": "Which state has the most black people?", "parent": "Who are the richest woman in the world?"}, {"name": "How did the Kardashians get so famous?", "parent": "Who are the richest woman in the world?"}, {"name": "How many billionaires are there in the world?", "parent": "Who are the richest woman in the world?"}, {"name": "How many wives did King David have?", "parent": "Who are the richest woman in the world?"}]}]}, {"name": "Is Amazon the richest company in the world?", "parent": "Top Level", "children": [{"name": "What's the world's largest company?", "parent": "Is Amazon the richest company in the world?", "children": [{"name": "What is Google's net worth?", "parent": "What's the world's largest company?"}, {"name": "What is Disney's net worth?", "parent": "What's the world's largest company?"}, {"name": "Is Aramco the biggest company in the world?", "parent": "What's the world's largest company?"}]}, {"name": "When was Amazon formed?", "parent": "Is Amazon the richest company in the world?", "children": [{"name": "Why did Jeff Bezos make Amazon?", "parent": "When was Amazon formed?"}, {"name": "How did Amazon get its start?", "parent": "When was Amazon formed?"}, {"name": "How many employees does Amazon have?", "parent": "When was Amazon formed?"}]}]}]}];
 40 | </script>
 41 | <script>
 42 | 
 43 | 
 44 | // ************** Generate the tree diagram	 *****************
 45 | var margin = {top: 20, right: 120, bottom: 20, left: 120},
 46 | 	width = 1080 - margin.right - margin.left,
 47 | 	height = 960 - margin.top - margin.bottom;
 48 | 	
 49 | var i = 0,
 50 | 	duration = 750,
 51 | 	root;
 52 | 
 53 | var tree = d3.layout.tree()
 54 | 	.size([height, width]);
 55 | 
 56 | var diagonal = d3.svg.diagonal()
 57 | 	.projection(function(d) { return [d.y, d.x]; });
 58 | 
 59 | var svg = d3.select("body").append("svg")
 60 | 	.attr("width", width + margin.right + margin.left)
 61 | 	.attr("height", height + margin.top + margin.bottom)
 62 |   .append("g")
 63 | 	.attr("transform", "translate(" + margin.left + "," + margin.top + ")");
 64 | 
 65 | root = treeData[0];
 66 | root.x0 = height / 2;
 67 | root.y0 = 0;
 68 |   
 69 | update(root);
 70 | 
 71 | d3.select(self.frameElement).style("height", "500px");
 72 | 
 73 | function update(source) {
 74 | 
 75 |   // Compute the new tree layout.
 76 |   var nodes = tree.nodes(root).reverse(),
 77 | 	  links = tree.links(nodes);
 78 | 
 79 |   // Normalize for fixed-depth.
 80 |   nodes.forEach(function(d) { d.y = d.depth * 180; });
 81 | 
 82 |   // Update the nodes…
 83 |   var node = svg.selectAll("g.node")
 84 | 	  .data(nodes, function(d) { return d.id || (d.id = ++i); });
 85 | 
 86 |   // Enter any new nodes at the parent's previous position.
 87 |   var nodeEnter = node.enter().append("g")
 88 | 	  .attr("class", "node")
 89 | 	  .attr("transform", function(d) { return "translate(" + source.y0 + "," + source.x0 + ")"; })
 90 | 	  .on("click", click);
 91 | 
 92 |   nodeEnter.append("circle")
 93 | 	  .attr("r", 1e-6)
 94 | 	  .style("fill", function(d) { return d._children ? "lightsteelblue" : "#fff"; });
 95 | 
 96 |   nodeEnter.append("text")
 97 | 	  .attr("x", function(d) { return d.children || d._children ? -13 : 13; })
 98 | 	  .attr("dy", ".35em")
 99 | 	  .attr("text-anchor", function(d) { return d.children || d._children ? "end" : "start"; })
100 | 	  .text(function(d) { return d.name; })
101 | 	  .style("fill-opacity", 1e-6);
102 | 
103 |   // Transition nodes to their new position.
104 |   var nodeUpdate = node.transition()
105 | 	  .duration(duration)
106 | 	  .attr("transform", function(d) { return "translate(" + d.y + "," + d.x + ")"; });
107 | 
108 |   nodeUpdate.select("circle")
109 | 	  .attr("r", 10)
110 | 	  .style("fill", function(d) { return d._children ? "lightsteelblue" : "#fff"; });
111 | 
112 |   nodeUpdate.select("text")
113 | 	  .style("fill-opacity", 1);
114 | 
115 |   // Transition exiting nodes to the parent's new position.
116 |   var nodeExit = node.exit().transition()
117 | 	  .duration(duration)
118 | 	  .attr("transform", function(d) { return "translate(" + source.y + "," + source.x + ")"; })
119 | 	  .remove();
120 | 
121 |   nodeExit.select("circle")
122 | 	  .attr("r", 1e-6);
123 | 
124 |   nodeExit.select("text")
125 | 	  .style("fill-opacity", 1e-6);
126 | 
127 |   // Update the links…
128 |   var link = svg.selectAll("path.link")
129 | 	  .data(links, function(d) { return d.target.id; });
130 | 
131 |   // Enter any new links at the parent's previous position.
132 |   link.enter().insert("path", "g")
133 | 	  .attr("class", "link")
134 | 	  .attr("d", function(d) {
135 | 		var o = {x: source.x0, y: source.y0};
136 | 		return diagonal({source: o, target: o});
137 | 	  });
138 | 
139 |   // Transition links to their new position.
140 |   link.transition()
141 | 	  .duration(duration)
142 | 	  .attr("d", diagonal);
143 | 
144 |   // Transition exiting nodes to the parent's new position.
145 |   link.exit().transition()
146 | 	  .duration(duration)
147 | 	  .attr("d", function(d) {
148 | 		var o = {x: source.x, y: source.y};
149 | 		return diagonal({source: o, target: o});
150 | 	  })
151 | 	  .remove();
152 | 
153 |   // Stash the old positions for transition.
154 |   nodes.forEach(function(d) {
155 | 	d.x0 = d.x;
156 | 	d.y0 = d.y;
157 |   });
158 | }
159 | 
160 | // Toggle children on click.
161 | function click(d) {
162 |   if (d.children) {
163 | 	d._children = d.children;
164 | 	d.children = null;
165 |   } else {
166 | 	d.children = d._children;
167 | 	d._children = null;
168 |   }
169 |   update(d);
170 | }
171 | 
172 | </script>
173 | 	
174 |   </body>
175 | </html>


--------------------------------------------------------------------------------
/html/how many season in mad men_16-06-2019_13-52-59-874430.html:
--------------------------------------------------------------------------------
  1 | <!DOCTYPE html>
  2 | <html lang="en">
  3 |   <head>
  4 |     <meta charset="utf-8">
  5 | 
  6 |     <title>Tree Example</title>
  7 | 
  8 |     <style>
  9 | 	
 10 | 	.node {
 11 | 		cursor: pointer;
 12 | 	}
 13 | 
 14 | 	.node circle {
 15 | 	  fill: #fff;
 16 | 	  stroke: steelblue;
 17 | 	  stroke-width: 3px;
 18 | 	}
 19 | 
 20 | 	.node text {
 21 | 	  font: 12px sans-serif;
 22 | 	}
 23 | 
 24 | 	.link {
 25 | 	  fill: none;
 26 | 	  stroke: #ccc;
 27 | 	  stroke-width: 2px;
 28 | 	}
 29 | 	
 30 |     </style>
 31 | 
 32 |   </head>
 33 | 
 34 |   <body>
 35 | 
 36 | <!-- load the d3.js library -->	
 37 | <script src="http://d3js.org/d3.v3.min.js"></script>
 38 | <script>
 39 | var treeData = [{"name": "Top Level", "parent": "null", "children": [{"name": "Is Mad Men coming back on?", "parent": "Top Level", "children": [{"name": "Is Don Draper based on a real person?", "parent": "Is Mad Men coming back on?", "children": []}, {"name": "Does Betty die in Mad Men?", "parent": "Is Mad Men coming back on?", "children": []}]}, {"name": "What years does madmen take place?", "parent": "Top Level", "children": [{"name": "Does Don Draper get divorced?", "parent": "What years does madmen take place?", "children": []}, {"name": "Is Sterling Cooper a real agency?", "parent": "What years does madmen take place?", "children": []}, {"name": "What year does Mad Men Season 5 take place?", "parent": "What years does madmen take place?", "children": []}]}, {"name": "How many Mad Men episodes are there?", "parent": "Top Level", "children": [{"name": "Will there be any more seasons of Mad Men?", "parent": "How many Mad Men episodes are there?", "children": []}]}]}];
 40 | </script>
 41 | <script>
 42 | 
 43 | 
 44 | // ************** Generate the tree diagram	 *****************
 45 | var margin = {top: 20, right: 120, bottom: 20, left: 120},
 46 | 	width = 960 - margin.right - margin.left,
 47 | 	height = 500 - margin.top - margin.bottom;
 48 | 	
 49 | var i = 0,
 50 | 	duration = 750,
 51 | 	root;
 52 | 
 53 | var tree = d3.layout.tree()
 54 | 	.size([height, width]);
 55 | 
 56 | var diagonal = d3.svg.diagonal()
 57 | 	.projection(function(d) { return [d.y, d.x]; });
 58 | 
 59 | var svg = d3.select("body").append("svg")
 60 | 	.attr("width", width + margin.right + margin.left)
 61 | 	.attr("height", height + margin.top + margin.bottom)
 62 |   .append("g")
 63 | 	.attr("transform", "translate(" + margin.left + "," + margin.top + ")");
 64 | 
 65 | root = treeData[0];
 66 | root.x0 = height / 2;
 67 | root.y0 = 0;
 68 |   
 69 | update(root);
 70 | 
 71 | d3.select(self.frameElement).style("height", "500px");
 72 | 
 73 | function update(source) {
 74 | 
 75 |   // Compute the new tree layout.
 76 |   var nodes = tree.nodes(root).reverse(),
 77 | 	  links = tree.links(nodes);
 78 | 
 79 |   // Normalize for fixed-depth.
 80 |   nodes.forEach(function(d) { d.y = d.depth * 180; });
 81 | 
 82 |   // Update the nodes…
 83 |   var node = svg.selectAll("g.node")
 84 | 	  .data(nodes, function(d) { return d.id || (d.id = ++i); });
 85 | 
 86 |   // Enter any new nodes at the parent's previous position.
 87 |   var nodeEnter = node.enter().append("g")
 88 | 	  .attr("class", "node")
 89 | 	  .attr("transform", function(d) { return "translate(" + source.y0 + "," + source.x0 + ")"; })
 90 | 	  .on("click", click);
 91 | 
 92 |   nodeEnter.append("circle")
 93 | 	  .attr("r", 1e-6)
 94 | 	  .style("fill", function(d) { return d._children ? "lightsteelblue" : "#fff"; });
 95 | 
 96 |   nodeEnter.append("text")
 97 | 	  .attr("x", function(d) { return d.children || d._children ? -13 : 13; })
 98 | 	  .attr("dy", ".35em")
 99 | 	  .attr("text-anchor", function(d) { return d.children || d._children ? "end" : "start"; })
100 | 	  .text(function(d) { return d.name; })
101 | 	  .style("fill-opacity", 1e-6);
102 | 
103 |   // Transition nodes to their new position.
104 |   var nodeUpdate = node.transition()
105 | 	  .duration(duration)
106 | 	  .attr("transform", function(d) { return "translate(" + d.y + "," + d.x + ")"; });
107 | 
108 |   nodeUpdate.select("circle")
109 | 	  .attr("r", 10)
110 | 	  .style("fill", function(d) { return d._children ? "lightsteelblue" : "#fff"; });
111 | 
112 |   nodeUpdate.select("text")
113 | 	  .style("fill-opacity", 1);
114 | 
115 |   // Transition exiting nodes to the parent's new position.
116 |   var nodeExit = node.exit().transition()
117 | 	  .duration(duration)
118 | 	  .attr("transform", function(d) { return "translate(" + source.y + "," + source.x + ")"; })
119 | 	  .remove();
120 | 
121 |   nodeExit.select("circle")
122 | 	  .attr("r", 1e-6);
123 | 
124 |   nodeExit.select("text")
125 | 	  .style("fill-opacity", 1e-6);
126 | 
127 |   // Update the links…
128 |   var link = svg.selectAll("path.link")
129 | 	  .data(links, function(d) { return d.target.id; });
130 | 
131 |   // Enter any new links at the parent's previous position.
132 |   link.enter().insert("path", "g")
133 | 	  .attr("class", "link")
134 | 	  .attr("d", function(d) {
135 | 		var o = {x: source.x0, y: source.y0};
136 | 		return diagonal({source: o, target: o});
137 | 	  });
138 | 
139 |   // Transition links to their new position.
140 |   link.transition()
141 | 	  .duration(duration)
142 | 	  .attr("d", diagonal);
143 | 
144 |   // Transition exiting nodes to the parent's new position.
145 |   link.exit().transition()
146 | 	  .duration(duration)
147 | 	  .attr("d", function(d) {
148 | 		var o = {x: source.x, y: source.y};
149 | 		return diagonal({source: o, target: o});
150 | 	  })
151 | 	  .remove();
152 | 
153 |   // Stash the old positions for transition.
154 |   nodes.forEach(function(d) {
155 | 	d.x0 = d.x;
156 | 	d.y0 = d.y;
157 |   });
158 | }
159 | 
160 | // Toggle children on click.
161 | function click(d) {
162 |   if (d.children) {
163 | 	d._children = d.children;
164 | 	d.children = null;
165 |   } else {
166 | 	d.children = d._children;
167 | 	d._children = null;
168 |   }
169 |   update(d);
170 | }
171 | 
172 | </script>
173 | 	
174 |   </body>
175 | </html>


--------------------------------------------------------------------------------
/html/what is affiliate marketing_16-06-2019_15-07-53-555584.html:
--------------------------------------------------------------------------------
  1 | <!DOCTYPE html>
  2 | <html lang="en">
  3 |   <head>
  4 |     <meta charset="utf-8">
  5 | 
  6 |     <title>Tree Example</title>
  7 | 
  8 |     <style>
  9 | 	
 10 | 	.node {
 11 | 		cursor: pointer;
 12 | 	}
 13 | 
 14 | 	.node circle {
 15 | 	  fill: #fff;
 16 | 	  stroke: steelblue;
 17 | 	  stroke-width: 3px;
 18 | 	}
 19 | 
 20 | 	.node text {
 21 | 	  font: 12px sans-serif;
 22 | 	}
 23 | 
 24 | 	.link {
 25 | 	  fill: none;
 26 | 	  stroke: #ccc;
 27 | 	  stroke-width: 2px;
 28 | 	}
 29 | 	
 30 |     </style>
 31 | 
 32 |   </head>
 33 | 
 34 |   <body>
 35 | 
 36 | <!-- load the d3.js library -->	
 37 | <script src="http://d3js.org/d3.v3.min.js"></script>
 38 | <script>
 39 | var treeData = [{"name": "what is affiliate marketing", "parent": "null", "children": [{"name": "Dictionary\naffiliate marketing\nnoun\na marketing arrangement by which an online retailer pays commission to an external website for traffic or sales generated from its referrals.\n\"most of my earnings are from affiliate marketing, direct ad sales, and sponsored posts\"\nTranslations, word origin, and more definitions\nFeedback", "parent": "what is affiliate marketing", "children": []}, {"name": "How do you become an affiliate marketer?", "parent": "what is affiliate marketing", "children": [{"name": "How do I become an Amazon affiliate marketer?", "parent": "How do you become an affiliate marketer?", "children": [{"name": "Can anyone become an Amazon affiliate?", "parent": "How do I become an Amazon affiliate marketer?"}, {"name": "How much can you make as an Amazon affiliate?", "parent": "How do I become an Amazon affiliate marketer?"}, {"name": "What is the best affiliate program?", "parent": "How do I become an Amazon affiliate marketer?"}, {"name": "How do affiliate marketers make money for beginners?", "parent": "How do I become an Amazon affiliate marketer?"}, {"name": "How can I start affiliate marketing without a website?", "parent": "How do I become an Amazon affiliate marketer?"}, {"name": "How can I make money on Amazon without selling?", "parent": "How do I become an Amazon affiliate marketer?"}, {"name": "What percentage do Amazon affiliates make?", "parent": "How do I become an Amazon affiliate marketer?"}, {"name": "Does Amazon affiliate pay for clicks?", "parent": "How do I become an Amazon affiliate marketer?"}, {"name": "How do I become an Amazon reviewer?", "parent": "How do I become an Amazon affiliate marketer?"}, {"name": "How Much Can Affiliate Marketers Make?", "parent": "How do I become an Amazon affiliate marketer?"}, {"name": "How do I create an Amazon affiliate store?", "parent": "How do I become an Amazon affiliate marketer?"}, {"name": "How much money do Amazon affiliates make?", "parent": "How do I become an Amazon affiliate marketer?"}, {"name": "How can I make money on Amazon without selling?", "parent": "How do I become an Amazon affiliate marketer?"}, {"name": "What percentage do Amazon affiliates make?", "parent": "How do I become an Amazon affiliate marketer?"}, {"name": "How do affiliate marketers make money for beginners?", "parent": "How do I become an Amazon affiliate marketer?"}, {"name": "How can I start affiliate marketing without a website?", "parent": "How do I become an Amazon affiliate marketer?"}, {"name": "What is Amazon affiliate program?", "parent": "How do I become an Amazon affiliate marketer?"}, {"name": "Can anyone become an Amazon affiliate?", "parent": "How do I become an Amazon affiliate marketer?"}, {"name": "How Much Can Affiliate Marketers Make?", "parent": "How do I become an Amazon affiliate marketer?"}, {"name": "How much money do Amazon affiliates make?", "parent": "How do I become an Amazon affiliate marketer?"}, {"name": "How Much Can Affiliate Marketers Make?", "parent": "How do I become an Amazon affiliate marketer?"}, {"name": "How much money do Amazon affiliates make?", "parent": "How do I become an Amazon affiliate marketer?"}, {"name": "How can I make money on Amazon without selling?", "parent": "How do I become an Amazon affiliate marketer?"}]}, {"name": "How do I get a job in affiliate marketing?", "parent": "How do you become an affiliate marketer?", "children": [{"name": "Are affiliate programs worth it?", "parent": "How do I get a job in affiliate marketing?"}, {"name": "Do you need a business license for affiliate marketing?", "parent": "How do I get a job in affiliate marketing?"}, {"name": "Does Amazon use affiliate marketing?", "parent": "How do I get a job in affiliate marketing?"}, {"name": "Is affiliate marketing still profitable?", "parent": "How do I get a job in affiliate marketing?"}, {"name": "How do affiliate programs make money?", "parent": "How do I get a job in affiliate marketing?"}, {"name": "How do I join Amazon affiliate marketing?", "parent": "How do I get a job in affiliate marketing?"}, {"name": "How do you make money in marketing?", "parent": "How do I get a job in affiliate marketing?"}, {"name": "How do I find affiliate marketing?", "parent": "How do I get a job in affiliate marketing?"}, {"name": "Does affiliate marketing still work in 2018?", "parent": "How do I get a job in affiliate marketing?"}, {"name": "Are affiliate programs worth it?", "parent": "How do I get a job in affiliate marketing?"}, {"name": "Do you need a business license for affiliate marketing?", "parent": "How do I get a job in affiliate marketing?"}, {"name": "Does Amazon use affiliate marketing?", "parent": "How do I get a job in affiliate marketing?"}, {"name": "Can affiliate marketing make you rich?", "parent": "How do I get a job in affiliate marketing?"}, {"name": "How do I join Amazon affiliate marketing?", "parent": "How do I get a job in affiliate marketing?"}, {"name": "How do you make money in marketing?", "parent": "How do I get a job in affiliate marketing?"}, {"name": "Is affiliate marketing still profitable?", "parent": "How do I get a job in affiliate marketing?"}, {"name": "Do you need a business license for affiliate marketing?", "parent": "How do I get a job in affiliate marketing?"}, {"name": "How do I make money as an affiliate?", "parent": "How do I get a job in affiliate marketing?"}, {"name": "Is affiliate marketing still profitable?", "parent": "How do I get a job in affiliate marketing?"}, {"name": "Do you need a business license for affiliate marketing?", "parent": "How do I get a job in affiliate marketing?"}, {"name": "Does Amazon use affiliate marketing?", "parent": "How do I get a job in affiliate marketing?"}, {"name": "Is affiliate marketing still profitable?", "parent": "How do I get a job in affiliate marketing?"}, {"name": "Can affiliate marketing make you rich?", "parent": "How do I get a job in affiliate marketing?"}, {"name": "How do affiliate programs make money?", "parent": "How do I get a job in affiliate marketing?"}]}]}, {"name": "What is affiliate marketing and how does it work for beginners?", "parent": "what is affiliate marketing", "children": [{"name": "How can I be successful in affiliate marketing?", "parent": "What is affiliate marketing and how does it work for beginners?", "children": [{"name": "Can affiliate marketing make you rich?", "parent": "How can I be successful in affiliate marketing?"}, {"name": "What is affiliate marketing and how does it work for beginners?", "parent": "How can I be successful in affiliate marketing?"}, {"name": "How can I maximize my affiliate marketing?", "parent": "How can I be successful in affiliate marketing?"}, {"name": "Which website is best for affiliate marketing?", "parent": "How can I be successful in affiliate marketing?"}, {"name": "How do I get a job in affiliate marketing?", "parent": "How can I be successful in affiliate marketing?"}, {"name": "How do I start affiliate marketing from scratch?", "parent": "How can I be successful in affiliate marketing?"}, {"name": "What is affiliate marketing and how does it work for beginners?", "parent": "How can I be successful in affiliate marketing?"}, {"name": "How can I maximize my affiliate marketing?", "parent": "How can I be successful in affiliate marketing?"}, {"name": "Can affiliate marketing make you rich?", "parent": "How can I be successful in affiliate marketing?"}, {"name": "Which website is best for affiliate marketing?", "parent": "How can I be successful in affiliate marketing?"}, {"name": "How do I become an Amazon affiliate marketer?", "parent": "How can I be successful in affiliate marketing?"}, {"name": "Can affiliate marketing make you rich?", "parent": "How can I be successful in affiliate marketing?"}, {"name": "How can I maximize my affiliate marketing?", "parent": "How can I be successful in affiliate marketing?"}, {"name": "How does affiliate marketing work step by step?", "parent": "How can I be successful in affiliate marketing?"}, {"name": "How can I maximize my affiliate marketing?", "parent": "How can I be successful in affiliate marketing?"}, {"name": "How does affiliate marketing work step by step?", "parent": "How can I be successful in affiliate marketing?"}]}, {"name": "How do I start an affiliate program?", "parent": "What is affiliate marketing and how does it work for beginners?", "children": [{"name": "How much does it cost to set up an affiliate program?", "parent": "How do I start an affiliate program?"}, {"name": "How do I become an affiliate?", "parent": "How do I start an affiliate program?"}, {"name": "How do I promote my affiliate program?", "parent": "How do I start an affiliate program?"}, {"name": "How can I be a good affiliate?", "parent": "How do I start an affiliate program?"}, {"name": "How do I start a successful affiliate program?", "parent": "How do I start an affiliate program?"}, {"name": "How do I start an affiliate program for my business?", "parent": "How do I start an affiliate program?"}, {"name": "What is the best travel affiliate program?", "parent": "How do I start an affiliate program?"}, {"name": "How do I become an affiliate?", "parent": "How do I start an affiliate program?"}, {"name": "How do I promote my affiliate program?", "parent": "How do I start an affiliate program?"}, {"name": "How do I start a successful affiliate program?", "parent": "How do I start an affiliate program?"}, {"name": "How do I become a successful affiliate?", "parent": "How do I start an affiliate program?"}, {"name": "How do I start an affiliate program for my business?", "parent": "How do I start an affiliate program?"}, {"name": "How can I be a good affiliate?", "parent": "How do I start an affiliate program?"}, {"name": "How do I start a successful affiliate program?", "parent": "How do I start an affiliate program?"}, {"name": "How do I start an affiliate program for my business?", "parent": "How do I start an affiliate program?"}, {"name": "How much does it cost to set up an affiliate program?", "parent": "How do I start an affiliate program?"}, {"name": "How do I start a successful affiliate program?", "parent": "How do I start an affiliate program?"}, {"name": "How do I start an affiliate program for my business?", "parent": "How do I start an affiliate program?"}]}, {"name": "What is Amazon affiliate marketing?", "parent": "What is affiliate marketing and how does it work for beginners?", "children": [{"name": "Can anyone become an Amazon affiliate?", "parent": "What is Amazon affiliate marketing?"}, {"name": "Is affiliate marketing a pyramid scheme?", "parent": "What is Amazon affiliate marketing?"}, {"name": "What is the best affiliate program?", "parent": "What is Amazon affiliate marketing?"}, {"name": "Can you make money with Amazon affiliate program?", "parent": "What is Amazon affiliate marketing?"}, {"name": "How can I start affiliate marketing without a website?", "parent": "What is Amazon affiliate marketing?"}, {"name": "Can anyone become an Amazon affiliate?", "parent": "What is Amazon affiliate marketing?"}, {"name": "Is affiliate marketing a pyramid scheme?", "parent": "What is Amazon affiliate marketing?"}, {"name": "What is the best affiliate program?", "parent": "What is Amazon affiliate marketing?"}, {"name": "Can you make money with Amazon affiliate program?", "parent": "What is Amazon affiliate marketing?"}, {"name": "How do I register for Amazon affiliate marketing?", "parent": "What is Amazon affiliate marketing?"}, {"name": "Can you make money with Amazon affiliate program?", "parent": "What is Amazon affiliate marketing?"}, {"name": "How can I start affiliate marketing without a website?", "parent": "What is Amazon affiliate marketing?"}, {"name": "Is affiliate marketing a pyramid scheme?", "parent": "What is Amazon affiliate marketing?"}, {"name": "Can you make money with Amazon affiliate program?", "parent": "What is Amazon affiliate marketing?"}]}]}, {"name": "Can you really make money with affiliate marketing?", "parent": "what is affiliate marketing", "children": [{"name": "How much does it cost to start affiliate marketing?", "parent": "Can you really make money with affiliate marketing?", "children": [{"name": "Can you have multiple affiliate programs?", "parent": "How much does it cost to start affiliate marketing?"}, {"name": "What are website affiliate programs?", "parent": "How much does it cost to start affiliate marketing?"}, {"name": "How much does it cost to join ShareASale?", "parent": "How much does it cost to start affiliate marketing?"}, {"name": "Can you have multiple affiliate programs?", "parent": "How much does it cost to start affiliate marketing?"}, {"name": "Can you have multiple affiliate programs?", "parent": "How much does it cost to start affiliate marketing?"}, {"name": "What are website affiliate programs?", "parent": "How much does it cost to start affiliate marketing?"}, {"name": "How do I become an Amazon affiliate?", "parent": "How much does it cost to start affiliate marketing?"}, {"name": "Can you have multiple affiliate programs?", "parent": "How much does it cost to start affiliate marketing?"}]}, {"name": "How do you get paid from affiliate marketing?", "parent": "Can you really make money with affiliate marketing?", "children": [{"name": "Are affiliate programs worth it?", "parent": "How do you get paid from affiliate marketing?"}, {"name": "How do I get a job in affiliate marketing?", "parent": "How do you get paid from affiliate marketing?"}, {"name": "How do I become an Amazon affiliate?", "parent": "How do you get paid from affiliate marketing?"}, {"name": "What is affiliate marketing and how does it work for beginners?", "parent": "How do you get paid from affiliate marketing?"}, {"name": "Is affiliate marketing a pyramid scheme?", "parent": "How do you get paid from affiliate marketing?"}, {"name": "What is the best affiliate program?", "parent": "How do you get paid from affiliate marketing?"}, {"name": "What is affiliate marketing and how does it work for beginners?", "parent": "How do you get paid from affiliate marketing?"}, {"name": "Is affiliate marketing a pyramid scheme?", "parent": "How do you get paid from affiliate marketing?"}, {"name": "What is the best affiliate program?", "parent": "How do you get paid from affiliate marketing?"}, {"name": "Are affiliate programs worth it?", "parent": "How do you get paid from affiliate marketing?"}, {"name": "What is affiliate marketing and how does it work for beginners?", "parent": "How do you get paid from affiliate marketing?"}, {"name": "How do I get a job in affiliate marketing?", "parent": "How do you get paid from affiliate marketing?"}]}, {"name": "Is affiliate marketing still profitable?", "parent": "Can you really make money with affiliate marketing?", "children": [{"name": "What are the most profitable niches for affiliate marketing?", "parent": "Is affiliate marketing still profitable?"}, {"name": "How do I start an affiliate marketing business?", "parent": "Is affiliate marketing still profitable?"}, {"name": "How Much Can Affiliate Marketers Make?", "parent": "Is affiliate marketing still profitable?"}, {"name": "What are the most profitable niches for affiliate marketing?", "parent": "Is affiliate marketing still profitable?"}, {"name": "How do I get a job in affiliate marketing?", "parent": "Is affiliate marketing still profitable?"}, {"name": "How do I become an Amazon affiliate?", "parent": "Is affiliate marketing still profitable?"}, {"name": "What are the most profitable niches for affiliate marketing?", "parent": "Is affiliate marketing still profitable?"}, {"name": "How do I get a job in affiliate marketing?", "parent": "Is affiliate marketing still profitable?"}, {"name": "How do I become an Amazon affiliate?", "parent": "Is affiliate marketing still profitable?"}, {"name": "What are the most profitable niches for affiliate marketing?", "parent": "Is affiliate marketing still profitable?"}, {"name": "How do I start an affiliate marketing business?", "parent": "Is affiliate marketing still profitable?"}, {"name": "Do you need a website to be an affiliate marketer?", "parent": "Is affiliate marketing still profitable?"}]}]}, {"name": "Is affiliate marketing a pyramid scheme?", "parent": "what is affiliate marketing", "children": [{"name": "Are affiliate programs worth it?", "parent": "Is affiliate marketing a pyramid scheme?", "children": [{"name": "Is affiliate marketing a good idea?", "parent": "Are affiliate programs worth it?"}, {"name": "Do affiliate websites make money?", "parent": "Are affiliate programs worth it?"}, {"name": "What is better than affiliate marketing?", "parent": "Are affiliate programs worth it?"}, {"name": "What is better than affiliate marketing?", "parent": "Are affiliate programs worth it?"}, {"name": "What is the best affiliate program?", "parent": "Are affiliate programs worth it?"}, {"name": "Does affiliate marketing still work in 2018?", "parent": "Are affiliate programs worth it?"}]}, {"name": "Is affiliate marketing passive income?", "parent": "Is affiliate marketing a pyramid scheme?", "children": [{"name": "How do I start an affiliate marketing business?", "parent": "Is affiliate marketing passive income?"}, {"name": "How do I find affiliate marketing?", "parent": "Is affiliate marketing passive income?"}, {"name": "How does PPC affiliate marketing make money?", "parent": "Is affiliate marketing passive income?"}, {"name": "What are the different types of affiliate marketing programs?", "parent": "Is affiliate marketing passive income?"}, {"name": "How do I find affiliate marketing?", "parent": "Is affiliate marketing passive income?"}, {"name": "How does PPC affiliate marketing make money?", "parent": "Is affiliate marketing passive income?"}]}, {"name": "Do you need a website to be an affiliate marketer?", "parent": "Is affiliate marketing a pyramid scheme?", "children": [{"name": "What kind of website is best for affiliate marketing?", "parent": "Do you need a website to be an affiliate marketer?"}, {"name": "Does it cost to be an Amazon affiliate?", "parent": "Do you need a website to be an affiliate marketer?"}, {"name": "Do you need a business license for affiliate marketing?", "parent": "Do you need a website to be an affiliate marketer?"}, {"name": "How do I become an affiliate marketer without a website?", "parent": "Do you need a website to be an affiliate marketer?"}, {"name": "What kind of website is best for affiliate marketing?", "parent": "Do you need a website to be an affiliate marketer?"}, {"name": "Does it cost to be an Amazon affiliate?", "parent": "Do you need a website to be an affiliate marketer?"}]}]}]}];
 40 | </script>
 41 | <script>
 42 | 
 43 | 
 44 | // ************** Generate the tree diagram	 *****************
 45 | var margin = {top: 20, right: 120, bottom: 20, left: 120},
 46 | 	width = 1080 - margin.right - margin.left,
 47 | 	height = 960 - margin.top - margin.bottom;
 48 | 	
 49 | var i = 0,
 50 | 	duration = 750,
 51 | 	root;
 52 | 
 53 | var tree = d3.layout.tree()
 54 | 	.size([height, width]);
 55 | 
 56 | var diagonal = d3.svg.diagonal()
 57 | 	.projection(function(d) { return [d.y, d.x]; });
 58 | 
 59 | var svg = d3.select("body").append("svg")
 60 | 	.attr("width", width + margin.right + margin.left)
 61 | 	.attr("height", height + margin.top + margin.bottom)
 62 |   .append("g")
 63 | 	.attr("transform", "translate(" + margin.left + "," + margin.top + ")");
 64 | 
 65 | root = treeData[0];
 66 | root.x0 = height / 2;
 67 | root.y0 = 0;
 68 |   
 69 | update(root);
 70 | 
 71 | d3.select(self.frameElement).style("height", "500px");
 72 | 
 73 | function update(source) {
 74 | 
 75 |   // Compute the new tree layout.
 76 |   var nodes = tree.nodes(root).reverse(),
 77 | 	  links = tree.links(nodes);
 78 | 
 79 |   // Normalize for fixed-depth.
 80 |   nodes.forEach(function(d) { d.y = d.depth * 180; });
 81 | 
 82 |   // Update the nodes…
 83 |   var node = svg.selectAll("g.node")
 84 | 	  .data(nodes, function(d) { return d.id || (d.id = ++i); });
 85 | 
 86 |   // Enter any new nodes at the parent's previous position.
 87 |   var nodeEnter = node.enter().append("g")
 88 | 	  .attr("class", "node")
 89 | 	  .attr("transform", function(d) { return "translate(" + source.y0 + "," + source.x0 + ")"; })
 90 | 	  .on("click", click);
 91 | 
 92 |   nodeEnter.append("circle")
 93 | 	  .attr("r", 1e-6)
 94 | 	  .style("fill", function(d) { return d._children ? "lightsteelblue" : "#fff"; });
 95 | 
 96 |   nodeEnter.append("text")
 97 | 	  .attr("x", function(d) { return d.children || d._children ? -13 : 13; })
 98 | 	  .attr("dy", ".35em")
 99 | 	  .attr("text-anchor", function(d) { return d.children || d._children ? "end" : "start"; })
100 | 	  .text(function(d) { return d.name; })
101 | 	  .style("fill-opacity", 1e-6);
102 | 
103 |   // Transition nodes to their new position.
104 |   var nodeUpdate = node.transition()
105 | 	  .duration(duration)
106 | 	  .attr("transform", function(d) { return "translate(" + d.y + "," + d.x + ")"; });
107 | 
108 |   nodeUpdate.select("circle")
109 | 	  .attr("r", 10)
110 | 	  .style("fill", function(d) { return d._children ? "lightsteelblue" : "#fff"; });
111 | 
112 |   nodeUpdate.select("text")
113 | 	  .style("fill-opacity", 1);
114 | 
115 |   // Transition exiting nodes to the parent's new position.
116 |   var nodeExit = node.exit().transition()
117 | 	  .duration(duration)
118 | 	  .attr("transform", function(d) { return "translate(" + source.y + "," + source.x + ")"; })
119 | 	  .remove();
120 | 
121 |   nodeExit.select("circle")
122 | 	  .attr("r", 1e-6);
123 | 
124 |   nodeExit.select("text")
125 | 	  .style("fill-opacity", 1e-6);
126 | 
127 |   // Update the links…
128 |   var link = svg.selectAll("path.link")
129 | 	  .data(links, function(d) { return d.target.id; });
130 | 
131 |   // Enter any new links at the parent's previous position.
132 |   link.enter().insert("path", "g")
133 | 	  .attr("class", "link")
134 | 	  .attr("d", function(d) {
135 | 		var o = {x: source.x0, y: source.y0};
136 | 		return diagonal({source: o, target: o});
137 | 	  });
138 | 
139 |   // Transition links to their new position.
140 |   link.transition()
141 | 	  .duration(duration)
142 | 	  .attr("d", diagonal);
143 | 
144 |   // Transition exiting nodes to the parent's new position.
145 |   link.exit().transition()
146 | 	  .duration(duration)
147 | 	  .attr("d", function(d) {
148 | 		var o = {x: source.x, y: source.y};
149 | 		return diagonal({source: o, target: o});
150 | 	  })
151 | 	  .remove();
152 | 
153 |   // Stash the old positions for transition.
154 |   nodes.forEach(function(d) {
155 | 	d.x0 = d.x;
156 | 	d.y0 = d.y;
157 |   });
158 | }
159 | 
160 | // Toggle children on click.
161 | function click(d) {
162 |   if (d.children) {
163 | 	d._children = d.children;
164 | 	d.children = null;
165 |   } else {
166 | 	d.children = d._children;
167 | 	d._children = null;
168 |   }
169 |   update(d);
170 | }
171 | 
172 | </script>
173 | 	
174 |   </body>
175 | </html>


--------------------------------------------------------------------------------
/html/why buy a new car_16-06-2019_15-28-12-437060.html:
--------------------------------------------------------------------------------
  1 | <!DOCTYPE html>
  2 | <html lang="en">
  3 |   <head>
  4 |     <meta charset="utf-8">
  5 | 
  6 |     <title>Tree Example</title>
  7 | 
  8 |     <style>
  9 | 	
 10 | 	.node {
 11 | 		cursor: pointer;
 12 | 	}
 13 | 
 14 | 	.node circle {
 15 | 	  fill: #fff;
 16 | 	  stroke: steelblue;
 17 | 	  stroke-width: 3px;
 18 | 	}
 19 | 
 20 | 	.node text {
 21 | 	  font: 12px sans-serif;
 22 | 	}
 23 | 
 24 | 	.link {
 25 | 	  fill: none;
 26 | 	  stroke: #ccc;
 27 | 	  stroke-width: 2px;
 28 | 	}
 29 | 	
 30 |     </style>
 31 | 
 32 |   </head>
 33 | 
 34 |   <body>
 35 | 
 36 | <!-- load the d3.js library -->	
 37 | <script src="http://d3js.org/d3.v3.min.js"></script>
 38 | <script>
 39 | var treeData = [{"name": "why buy a new car", "parent": "null", "children": [{"name": "Is buying a new car worth it?", "parent": "why buy a new car", "children": [{"name": "Should I buy a new car or keep mine?", "parent": "Is buying a new car worth it?", "children": [{"name": "Is it better to buy a used or new car?", "parent": "Should I buy a new car or keep mine?"}, {"name": "What are the advantages and disadvantages of buying a new car?", "parent": "Should I buy a new car or keep mine?"}, {"name": "Is it cheaper to rebuild an engine or replace it?", "parent": "Should I buy a new car or keep mine?"}, {"name": "How much should I spend on a car based on salary?", "parent": "Should I buy a new car or keep mine?"}, {"name": "How many years should you keep a new car?", "parent": "Should I buy a new car or keep mine?"}, {"name": "How many miles should a car last?", "parent": "Should I buy a new car or keep mine?"}, {"name": "Why you should never buy a new car?", "parent": "Should I buy a new car or keep mine?"}, {"name": "Is it cheaper to buy a new car or maintain an old one?", "parent": "Should I buy a new car or keep mine?"}, {"name": "What are the advantages of buying a new car as compared to used one?", "parent": "Should I buy a new car or keep mine?"}, {"name": "Why you should never buy a new car?", "parent": "Should I buy a new car or keep mine?"}, {"name": "Is it cheaper to rebuild an engine or replace it?", "parent": "Should I buy a new car or keep mine?"}, {"name": "How many years should you keep a new car?", "parent": "Should I buy a new car or keep mine?"}]}, {"name": "Is a new car a good investment?", "parent": "Is buying a new car worth it?", "children": [{"name": "Is buying a new car with cash a good idea?", "parent": "Is a new car a good investment?"}, {"name": "Which car is the best investment?", "parent": "Is a new car a good investment?"}, {"name": "Can I afford a new car?", "parent": "Is a new car a good investment?"}, {"name": "How long should you keep your car?", "parent": "Is a new car a good investment?"}, {"name": "Does a car count as an investment?", "parent": "Is a new car a good investment?"}, {"name": "How much should I invest in my car?", "parent": "Is a new car a good investment?"}, {"name": "What are the advantages and disadvantages of buying a new car?", "parent": "Is a new car a good investment?"}, {"name": "Should I buy a new car or used car?", "parent": "Is a new car a good investment?"}, {"name": "How do I get the best deal on a new car?", "parent": "Is a new car a good investment?"}, {"name": "What are the benefits of buying a new car?", "parent": "Is a new car a good investment?"}, {"name": "Is buying a new car ever worth it?", "parent": "Is a new car a good investment?"}, {"name": "Which car is the best investment?", "parent": "Is a new car a good investment?"}]}]}, {"name": "What are the advantages of buying a new car as compared to used one?", "parent": "why buy a new car", "children": [{"name": "What do dealers do with unsold new cars?", "parent": "What are the advantages of buying a new car as compared to used one?", "children": [{"name": "How much does a dealer make on a new car?", "parent": "What do dealers do with unsold new cars?"}, {"name": "Is it better to pay cash for a car?", "parent": "What do dealers do with unsold new cars?"}, {"name": "What happens to new unsold vehicles?", "parent": "What do dealers do with unsold new cars?"}, {"name": "Is it better to buy last year car model?", "parent": "What do dealers do with unsold new cars?"}, {"name": "What happens when a car dies?", "parent": "What do dealers do with unsold new cars?"}, {"name": "What is the best month to buy a new car?", "parent": "What do dealers do with unsold new cars?"}, {"name": "What happens to new unsold vehicles?", "parent": "What do dealers do with unsold new cars?"}, {"name": "Is it better to buy a used or new car?", "parent": "What do dealers do with unsold new cars?"}]}, {"name": "Is it better to get a car loan from bank or dealer?", "parent": "What are the advantages of buying a new car as compared to used one?", "children": [{"name": "Is car finance a bad idea?", "parent": "Is it better to get a car loan from bank or dealer?"}, {"name": "Do car dealers prefer cash or financing?", "parent": "Is it better to get a car loan from bank or dealer?"}, {"name": "Which bank is best for car loan?", "parent": "Is it better to get a car loan from bank or dealer?"}, {"name": "Is it better to get your own financing for a car?", "parent": "Is it better to get a car loan from bank or dealer?"}, {"name": "What's the best way to finance a car?", "parent": "Is it better to get a car loan from bank or dealer?"}, {"name": "Do car dealers prefer cash or financing?", "parent": "Is it better to get a car loan from bank or dealer?"}, {"name": "Which bank is best for car loan?", "parent": "Is it better to get a car loan from bank or dealer?"}, {"name": "What is 0 Financing on a car?", "parent": "Is it better to get a car loan from bank or dealer?"}]}, {"name": "How much of a car payment can I afford?", "parent": "What are the advantages of buying a new car as compared to used one?", "children": [{"name": "What car can I afford on 40k salary?", "parent": "How much of a car payment can I afford?"}, {"name": "Is buying a new car worth it?", "parent": "How much of a car payment can I afford?"}, {"name": "How much debt can I afford?", "parent": "How much of a car payment can I afford?"}, {"name": "What car can I afford on 60k salary?", "parent": "How much of a car payment can I afford?"}, {"name": "How can I get a low car payment?", "parent": "How much of a car payment can I afford?"}, {"name": "Can I afford a new car?", "parent": "How much of a car payment can I afford?"}, {"name": "What car can I afford on 40k salary?", "parent": "How much of a car payment can I afford?"}, {"name": "How much debt can I afford?", "parent": "How much of a car payment can I afford?"}, {"name": "Can you pay more on your car payment?", "parent": "How much of a car payment can I afford?"}]}]}, {"name": "What is the best time of year to buy a new car?", "parent": "why buy a new car", "children": [{"name": "How much should I offer for a new car?", "parent": "What is the best time of year to buy a new car?", "children": [{"name": "How much can you get off MSRP New Car?", "parent": "How much should I offer for a new car?"}, {"name": "How much does a dealer pay for a new car?", "parent": "How much should I offer for a new car?"}, {"name": "What month do new car models come out?", "parent": "How much should I offer for a new car?"}, {"name": "What is a good deal on a new car?", "parent": "How much should I offer for a new car?"}, {"name": "How much can you negotiate on a new car?", "parent": "How much should I offer for a new car?"}]}, {"name": "What is the best month to buy a new car?", "parent": "What is the best time of year to buy a new car?", "children": [{"name": "How do I buy a new car?", "parent": "What is the best month to buy a new car?"}, {"name": "Is February a good month to buy a car?", "parent": "What is the best month to buy a new car?"}, {"name": "How do you buy a car cash from a dealer?", "parent": "What is the best month to buy a new car?"}, {"name": "Should I buy a new car or keep my old one?", "parent": "What is the best month to buy a new car?"}, {"name": "Is it better to buy last year car model?", "parent": "What is the best month to buy a new car?"}, {"name": "What do dealerships do with unsold new cars?", "parent": "What is the best month to buy a new car?"}]}, {"name": "How much can you negotiate on a new car?", "parent": "What is the best time of year to buy a new car?", "children": [{"name": "What should I know before buying a new car?", "parent": "How much can you negotiate on a new car?"}, {"name": "Should you pay MSRP for a new car?", "parent": "How much can you negotiate on a new car?"}, {"name": "Are new car prices negotiable?", "parent": "How much can you negotiate on a new car?"}, {"name": "How much can a dealer take off MSRP?", "parent": "How much can you negotiate on a new car?"}, {"name": "What month do new car models come out?", "parent": "How much can you negotiate on a new car?"}, {"name": "How do I get the best deal on a new car?", "parent": "How much can you negotiate on a new car?"}]}]}, {"name": "Why you should not buy a new car?", "parent": "why buy a new car", "children": [{"name": "Is buying a new car a bad idea?", "parent": "Why you should not buy a new car?", "children": [{"name": "What are the advantages and disadvantages of buying a new car?", "parent": "Is buying a new car a bad idea?"}, {"name": "How long should you keep your car?", "parent": "Is buying a new car a bad idea?"}, {"name": "Is a new car a good investment?", "parent": "Is buying a new car a bad idea?"}]}, {"name": "Why financing a car is a bad idea?", "parent": "Why you should not buy a new car?", "children": [{"name": "Is paying cash for a car a good idea?", "parent": "Why financing a car is a bad idea?"}, {"name": "Can I afford a $500 car payment?", "parent": "Why financing a car is a bad idea?"}, {"name": "Can I get a car loan with a credit score of 600?", "parent": "Why financing a car is a bad idea?"}]}, {"name": "Is it better to pay cash or finance a car?", "parent": "Why you should not buy a new car?", "children": [{"name": "Why you should never buy a new car?", "parent": "Is it better to pay cash or finance a car?"}, {"name": "Does paying cash for a car get you a better deal?", "parent": "Is it better to pay cash or finance a car?"}, {"name": "Is financing a car a bad idea?", "parent": "Is it better to pay cash or finance a car?"}]}]}]}];
 40 | </script>
 41 | <script>
 42 | 
 43 | 
 44 | // ************** Generate the tree diagram	 *****************
 45 | var margin = {top: 20, right: 120, bottom: 20, left: 120},
 46 | 	width = 1080 - margin.right - margin.left,
 47 | 	height = 960 - margin.top - margin.bottom;
 48 | 	
 49 | var i = 0,
 50 | 	duration = 750,
 51 | 	root;
 52 | 
 53 | var tree = d3.layout.tree()
 54 | 	.size([height, width]);
 55 | 
 56 | var diagonal = d3.svg.diagonal()
 57 | 	.projection(function(d) { return [d.y, d.x]; });
 58 | 
 59 | var svg = d3.select("body").append("svg")
 60 | 	.attr("width", width + margin.right + margin.left)
 61 | 	.attr("height", height + margin.top + margin.bottom)
 62 |   .append("g")
 63 | 	.attr("transform", "translate(" + margin.left + "," + margin.top + ")");
 64 | 
 65 | root = treeData[0];
 66 | root.x0 = height / 2;
 67 | root.y0 = 0;
 68 |   
 69 | update(root);
 70 | 
 71 | d3.select(self.frameElement).style("height", "500px");
 72 | 
 73 | function update(source) {
 74 | 
 75 |   // Compute the new tree layout.
 76 |   var nodes = tree.nodes(root).reverse(),
 77 | 	  links = tree.links(nodes);
 78 | 
 79 |   // Normalize for fixed-depth.
 80 |   nodes.forEach(function(d) { d.y = d.depth * 180; });
 81 | 
 82 |   // Update the nodes…
 83 |   var node = svg.selectAll("g.node")
 84 | 	  .data(nodes, function(d) { return d.id || (d.id = ++i); });
 85 | 
 86 |   // Enter any new nodes at the parent's previous position.
 87 |   var nodeEnter = node.enter().append("g")
 88 | 	  .attr("class", "node")
 89 | 	  .attr("transform", function(d) { return "translate(" + source.y0 + "," + source.x0 + ")"; })
 90 | 	  .on("click", click);
 91 | 
 92 |   nodeEnter.append("circle")
 93 | 	  .attr("r", 1e-6)
 94 | 	  .style("fill", function(d) { return d._children ? "lightsteelblue" : "#fff"; });
 95 | 
 96 |   nodeEnter.append("text")
 97 | 	  .attr("x", function(d) { return d.children || d._children ? -13 : 13; })
 98 | 	  .attr("dy", ".35em")
 99 | 	  .attr("text-anchor", function(d) { return d.children || d._children ? "end" : "start"; })
100 | 	  .text(function(d) { return d.name; })
101 | 	  .style("fill-opacity", 1e-6);
102 | 
103 |   // Transition nodes to their new position.
104 |   var nodeUpdate = node.transition()
105 | 	  .duration(duration)
106 | 	  .attr("transform", function(d) { return "translate(" + d.y + "," + d.x + ")"; });
107 | 
108 |   nodeUpdate.select("circle")
109 | 	  .attr("r", 10)
110 | 	  .style("fill", function(d) { return d._children ? "lightsteelblue" : "#fff"; });
111 | 
112 |   nodeUpdate.select("text")
113 | 	  .style("fill-opacity", 1);
114 | 
115 |   // Transition exiting nodes to the parent's new position.
116 |   var nodeExit = node.exit().transition()
117 | 	  .duration(duration)
118 | 	  .attr("transform", function(d) { return "translate(" + source.y + "," + source.x + ")"; })
119 | 	  .remove();
120 | 
121 |   nodeExit.select("circle")
122 | 	  .attr("r", 1e-6);
123 | 
124 |   nodeExit.select("text")
125 | 	  .style("fill-opacity", 1e-6);
126 | 
127 |   // Update the links…
128 |   var link = svg.selectAll("path.link")
129 | 	  .data(links, function(d) { return d.target.id; });
130 | 
131 |   // Enter any new links at the parent's previous position.
132 |   link.enter().insert("path", "g")
133 | 	  .attr("class", "link")
134 | 	  .attr("d", function(d) {
135 | 		var o = {x: source.x0, y: source.y0};
136 | 		return diagonal({source: o, target: o});
137 | 	  });
138 | 
139 |   // Transition links to their new position.
140 |   link.transition()
141 | 	  .duration(duration)
142 | 	  .attr("d", diagonal);
143 | 
144 |   // Transition exiting nodes to the parent's new position.
145 |   link.exit().transition()
146 | 	  .duration(duration)
147 | 	  .attr("d", function(d) {
148 | 		var o = {x: source.x, y: source.y};
149 | 		return diagonal({source: o, target: o});
150 | 	  })
151 | 	  .remove();
152 | 
153 |   // Stash the old positions for transition.
154 |   nodes.forEach(function(d) {
155 | 	d.x0 = d.x;
156 | 	d.y0 = d.y;
157 |   });
158 | }
159 | 
160 | // Toggle children on click.
161 | function click(d) {
162 |   if (d.children) {
163 | 	d._children = d.children;
164 | 	d.children = null;
165 |   } else {
166 | 	d.children = d._children;
167 | 	d._children = null;
168 |   }
169 |   update(d);
170 | }
171 | 
172 | </script>
173 | 	
174 |   </body>
175 | </html>


--------------------------------------------------------------------------------
/license.txt:
--------------------------------------------------------------------------------
  1 |                     GNU GENERAL PUBLIC LICENSE
  2 |                        Version 3, 29 June 2007
  3 | 
  4 |  Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
  5 |  Everyone is permitted to copy and distribute verbatim copies
  6 |  of this license document, but changing it is not allowed.
  7 | 
  8 |                             Preamble
  9 | 
 10 |   The GNU General Public License is a free, copyleft license for
 11 | software and other kinds of works.
 12 | 
 13 |   The licenses for most software and other practical works are designed
 14 | to take away your freedom to share and change the works.  By contrast,
 15 | the GNU General Public License is intended to guarantee your freedom to
 16 | share and change all versions of a program--to make sure it remains free
 17 | software for all its users.  We, the Free Software Foundation, use the
 18 | GNU General Public License for most of our software; it applies also to
 19 | any other work released this way by its authors.  You can apply it to
 20 | your programs, too.
 21 | 
 22 |   When we speak of free software, we are referring to freedom, not
 23 | price.  Our General Public Licenses are designed to make sure that you
 24 | have the freedom to distribute copies of free software (and charge for
 25 | them if you wish), that you receive source code or can get it if you
 26 | want it, that you can change the software or use pieces of it in new
 27 | free programs, and that you know you can do these things.
 28 | 
 29 |   To protect your rights, we need to prevent others from denying you
 30 | these rights or asking you to surrender the rights.  Therefore, you have
 31 | certain responsibilities if you distribute copies of the software, or if
 32 | you modify it: responsibilities to respect the freedom of others.
 33 | 
 34 |   For example, if you distribute copies of such a program, whether
 35 | gratis or for a fee, you must pass on to the recipients the same
 36 | freedoms that you received.  You must make sure that they, too, receive
 37 | or can get the source code.  And you must show them these terms so they
 38 | know their rights.
 39 | 
 40 |   Developers that use the GNU GPL protect your rights with two steps:
 41 | (1) assert copyright on the software, and (2) offer you this License
 42 | giving you legal permission to copy, distribute and/or modify it.
 43 | 
 44 |   For the developers' and authors' protection, the GPL clearly explains
 45 | that there is no warranty for this free software.  For both users' and
 46 | authors' sake, the GPL requires that modified versions be marked as
 47 | changed, so that their problems will not be attributed erroneously to
 48 | authors of previous versions.
 49 | 
 50 |   Some devices are designed to deny users access to install or run
 51 | modified versions of the software inside them, although the manufacturer
 52 | can do so.  This is fundamentally incompatible with the aim of
 53 | protecting users' freedom to change the software.  The systematic
 54 | pattern of such abuse occurs in the area of products for individuals to
 55 | use, which is precisely where it is most unacceptable.  Therefore, we
 56 | have designed this version of the GPL to prohibit the practice for those
 57 | products.  If such problems arise substantially in other domains, we
 58 | stand ready to extend this provision to those domains in future versions
 59 | of the GPL, as needed to protect the freedom of users.
 60 | 
 61 |   Finally, every program is threatened constantly by software patents.
 62 | States should not allow patents to restrict development and use of
 63 | software on general-purpose computers, but in those that do, we wish to
 64 | avoid the special danger that patents applied to a free program could
 65 | make it effectively proprietary.  To prevent this, the GPL assures that
 66 | patents cannot be used to render the program non-free.
 67 | 
 68 |   The precise terms and conditions for copying, distribution and
 69 | modification follow.
 70 | 
 71 |                        TERMS AND CONDITIONS
 72 | 
 73 |   0. Definitions.
 74 | 
 75 |   "This License" refers to version 3 of the GNU General Public License.
 76 | 
 77 |   "Copyright" also means copyright-like laws that apply to other kinds of
 78 | works, such as semiconductor masks.
 79 | 
 80 |   "The Program" refers to any copyrightable work licensed under this
 81 | License.  Each licensee is addressed as "you".  "Licensees" and
 82 | "recipients" may be individuals or organizations.
 83 | 
 84 |   To "modify" a work means to copy from or adapt all or part of the work
 85 | in a fashion requiring copyright permission, other than the making of an
 86 | exact copy.  The resulting work is called a "modified version" of the
 87 | earlier work or a work "based on" the earlier work.
 88 | 
 89 |   A "covered work" means either the unmodified Program or a work based
 90 | on the Program.
 91 | 
 92 |   To "propagate" a work means to do anything with it that, without
 93 | permission, would make you directly or secondarily liable for
 94 | infringement under applicable copyright law, except executing it on a
 95 | computer or modifying a private copy.  Propagation includes copying,
 96 | distribution (with or without modification), making available to the
 97 | public, and in some countries other activities as well.
 98 | 
 99 |   To "convey" a work means any kind of propagation that enables other
100 | parties to make or receive copies.  Mere interaction with a user through
101 | a computer network, with no transfer of a copy, is not conveying.
102 | 
103 |   An interactive user interface displays "Appropriate Legal Notices"
104 | to the extent that it includes a convenient and prominently visible
105 | feature that (1) displays an appropriate copyright notice, and (2)
106 | tells the user that there is no warranty for the work (except to the
107 | extent that warranties are provided), that licensees may convey the
108 | work under this License, and how to view a copy of this License.  If
109 | the interface presents a list of user commands or options, such as a
110 | menu, a prominent item in the list meets this criterion.
111 | 
112 |   1. Source Code.
113 | 
114 |   The "source code" for a work means the preferred form of the work
115 | for making modifications to it.  "Object code" means any non-source
116 | form of a work.
117 | 
118 |   A "Standard Interface" means an interface that either is an official
119 | standard defined by a recognized standards body, or, in the case of
120 | interfaces specified for a particular programming language, one that
121 | is widely used among developers working in that language.
122 | 
123 |   The "System Libraries" of an executable work include anything, other
124 | than the work as a whole, that (a) is included in the normal form of
125 | packaging a Major Component, but which is not part of that Major
126 | Component, and (b) serves only to enable use of the work with that
127 | Major Component, or to implement a Standard Interface for which an
128 | implementation is available to the public in source code form.  A
129 | "Major Component", in this context, means a major essential component
130 | (kernel, window system, and so on) of the specific operating system
131 | (if any) on which the executable work runs, or a compiler used to
132 | produce the work, or an object code interpreter used to run it.
133 | 
134 |   The "Corresponding Source" for a work in object code form means all
135 | the source code needed to generate, install, and (for an executable
136 | work) run the object code and to modify the work, including scripts to
137 | control those activities.  However, it does not include the work's
138 | System Libraries, or general-purpose tools or generally available free
139 | programs which are used unmodified in performing those activities but
140 | which are not part of the work.  For example, Corresponding Source
141 | includes interface definition files associated with source files for
142 | the work, and the source code for shared libraries and dynamically
143 | linked subprograms that the work is specifically designed to require,
144 | such as by intimate data communication or control flow between those
145 | subprograms and other parts of the work.
146 | 
147 |   The Corresponding Source need not include anything that users
148 | can regenerate automatically from other parts of the Corresponding
149 | Source.
150 | 
151 |   The Corresponding Source for a work in source code form is that
152 | same work.
153 | 
154 |   2. Basic Permissions.
155 | 
156 |   All rights granted under this License are granted for the term of
157 | copyright on the Program, and are irrevocable provided the stated
158 | conditions are met.  This License explicitly affirms your unlimited
159 | permission to run the unmodified Program.  The output from running a
160 | covered work is covered by this License only if the output, given its
161 | content, constitutes a covered work.  This License acknowledges your
162 | rights of fair use or other equivalent, as provided by copyright law.
163 | 
164 |   You may make, run and propagate covered works that you do not
165 | convey, without conditions so long as your license otherwise remains
166 | in force.  You may convey covered works to others for the sole purpose
167 | of having them make modifications exclusively for you, or provide you
168 | with facilities for running those works, provided that you comply with
169 | the terms of this License in conveying all material for which you do
170 | not control copyright.  Those thus making or running the covered works
171 | for you must do so exclusively on your behalf, under your direction
172 | and control, on terms that prohibit them from making any copies of
173 | your copyrighted material outside their relationship with you.
174 | 
175 |   Conveying under any other circumstances is permitted solely under
176 | the conditions stated below.  Sublicensing is not allowed; section 10
177 | makes it unnecessary.
178 | 
179 |   3. Protecting Users' Legal Rights From Anti-Circumvention Law.
180 | 
181 |   No covered work shall be deemed part of an effective technological
182 | measure under any applicable law fulfilling obligations under article
183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or
184 | similar laws prohibiting or restricting circumvention of such
185 | measures.
186 | 
187 |   When you convey a covered work, you waive any legal power to forbid
188 | circumvention of technological measures to the extent such circumvention
189 | is effected by exercising rights under this License with respect to
190 | the covered work, and you disclaim any intention to limit operation or
191 | modification of the work as a means of enforcing, against the work's
192 | users, your or third parties' legal rights to forbid circumvention of
193 | technological measures.
194 | 
195 |   4. Conveying Verbatim Copies.
196 | 
197 |   You may convey verbatim copies of the Program's source code as you
198 | receive it, in any medium, provided that you conspicuously and
199 | appropriately publish on each copy an appropriate copyright notice;
200 | keep intact all notices stating that this License and any
201 | non-permissive terms added in accord with section 7 apply to the code;
202 | keep intact all notices of the absence of any warranty; and give all
203 | recipients a copy of this License along with the Program.
204 | 
205 |   You may charge any price or no price for each copy that you convey,
206 | and you may offer support or warranty protection for a fee.
207 | 
208 |   5. Conveying Modified Source Versions.
209 | 
210 |   You may convey a work based on the Program, or the modifications to
211 | produce it from the Program, in the form of source code under the
212 | terms of section 4, provided that you also meet all of these conditions:
213 | 
214 |     a) The work must carry prominent notices stating that you modified
215 |     it, and giving a relevant date.
216 | 
217 |     b) The work must carry prominent notices stating that it is
218 |     released under this License and any conditions added under section
219 |     7.  This requirement modifies the requirement in section 4 to
220 |     "keep intact all notices".
221 | 
222 |     c) You must license the entire work, as a whole, under this
223 |     License to anyone who comes into possession of a copy.  This
224 |     License will therefore apply, along with any applicable section 7
225 |     additional terms, to the whole of the work, and all its parts,
226 |     regardless of how they are packaged.  This License gives no
227 |     permission to license the work in any other way, but it does not
228 |     invalidate such permission if you have separately received it.
229 | 
230 |     d) If the work has interactive user interfaces, each must display
231 |     Appropriate Legal Notices; however, if the Program has interactive
232 |     interfaces that do not display Appropriate Legal Notices, your
233 |     work need not make them do so.
234 | 
235 |   A compilation of a covered work with other separate and independent
236 | works, which are not by their nature extensions of the covered work,
237 | and which are not combined with it such as to form a larger program,
238 | in or on a volume of a storage or distribution medium, is called an
239 | "aggregate" if the compilation and its resulting copyright are not
240 | used to limit the access or legal rights of the compilation's users
241 | beyond what the individual works permit.  Inclusion of a covered work
242 | in an aggregate does not cause this License to apply to the other
243 | parts of the aggregate.
244 | 
245 |   6. Conveying Non-Source Forms.
246 | 
247 |   You may convey a covered work in object code form under the terms
248 | of sections 4 and 5, provided that you also convey the
249 | machine-readable Corresponding Source under the terms of this License,
250 | in one of these ways:
251 | 
252 |     a) Convey the object code in, or embodied in, a physical product
253 |     (including a physical distribution medium), accompanied by the
254 |     Corresponding Source fixed on a durable physical medium
255 |     customarily used for software interchange.
256 | 
257 |     b) Convey the object code in, or embodied in, a physical product
258 |     (including a physical distribution medium), accompanied by a
259 |     written offer, valid for at least three years and valid for as
260 |     long as you offer spare parts or customer support for that product
261 |     model, to give anyone who possesses the object code either (1) a
262 |     copy of the Corresponding Source for all the software in the
263 |     product that is covered by this License, on a durable physical
264 |     medium customarily used for software interchange, for a price no
265 |     more than your reasonable cost of physically performing this
266 |     conveying of source, or (2) access to copy the
267 |     Corresponding Source from a network server at no charge.
268 | 
269 |     c) Convey individual copies of the object code with a copy of the
270 |     written offer to provide the Corresponding Source.  This
271 |     alternative is allowed only occasionally and noncommercially, and
272 |     only if you received the object code with such an offer, in accord
273 |     with subsection 6b.
274 | 
275 |     d) Convey the object code by offering access from a designated
276 |     place (gratis or for a charge), and offer equivalent access to the
277 |     Corresponding Source in the same way through the same place at no
278 |     further charge.  You need not require recipients to copy the
279 |     Corresponding Source along with the object code.  If the place to
280 |     copy the object code is a network server, the Corresponding Source
281 |     may be on a different server (operated by you or a third party)
282 |     that supports equivalent copying facilities, provided you maintain
283 |     clear directions next to the object code saying where to find the
284 |     Corresponding Source.  Regardless of what server hosts the
285 |     Corresponding Source, you remain obligated to ensure that it is
286 |     available for as long as needed to satisfy these requirements.
287 | 
288 |     e) Convey the object code using peer-to-peer transmission, provided
289 |     you inform other peers where the object code and Corresponding
290 |     Source of the work are being offered to the general public at no
291 |     charge under subsection 6d.
292 | 
293 |   A separable portion of the object code, whose source code is excluded
294 | from the Corresponding Source as a System Library, need not be
295 | included in conveying the object code work.
296 | 
297 |   A "User Product" is either (1) a "consumer product", which means any
298 | tangible personal property which is normally used for personal, family,
299 | or household purposes, or (2) anything designed or sold for incorporation
300 | into a dwelling.  In determining whether a product is a consumer product,
301 | doubtful cases shall be resolved in favor of coverage.  For a particular
302 | product received by a particular user, "normally used" refers to a
303 | typical or common use of that class of product, regardless of the status
304 | of the particular user or of the way in which the particular user
305 | actually uses, or expects or is expected to use, the product.  A product
306 | is a consumer product regardless of whether the product has substantial
307 | commercial, industrial or non-consumer uses, unless such uses represent
308 | the only significant mode of use of the product.
309 | 
310 |   "Installation Information" for a User Product means any methods,
311 | procedures, authorization keys, or other information required to install
312 | and execute modified versions of a covered work in that User Product from
313 | a modified version of its Corresponding Source.  The information must
314 | suffice to ensure that the continued functioning of the modified object
315 | code is in no case prevented or interfered with solely because
316 | modification has been made.
317 | 
318 |   If you convey an object code work under this section in, or with, or
319 | specifically for use in, a User Product, and the conveying occurs as
320 | part of a transaction in which the right of possession and use of the
321 | User Product is transferred to the recipient in perpetuity or for a
322 | fixed term (regardless of how the transaction is characterized), the
323 | Corresponding Source conveyed under this section must be accompanied
324 | by the Installation Information.  But this requirement does not apply
325 | if neither you nor any third party retains the ability to install
326 | modified object code on the User Product (for example, the work has
327 | been installed in ROM).
328 | 
329 |   The requirement to provide Installation Information does not include a
330 | requirement to continue to provide support service, warranty, or updates
331 | for a work that has been modified or installed by the recipient, or for
332 | the User Product in which it has been modified or installed.  Access to a
333 | network may be denied when the modification itself materially and
334 | adversely affects the operation of the network or violates the rules and
335 | protocols for communication across the network.
336 | 
337 |   Corresponding Source conveyed, and Installation Information provided,
338 | in accord with this section must be in a format that is publicly
339 | documented (and with an implementation available to the public in
340 | source code form), and must require no special password or key for
341 | unpacking, reading or copying.
342 | 
343 |   7. Additional Terms.
344 | 
345 |   "Additional permissions" are terms that supplement the terms of this
346 | License by making exceptions from one or more of its conditions.
347 | Additional permissions that are applicable to the entire Program shall
348 | be treated as though they were included in this License, to the extent
349 | that they are valid under applicable law.  If additional permissions
350 | apply only to part of the Program, that part may be used separately
351 | under those permissions, but the entire Program remains governed by
352 | this License without regard to the additional permissions.
353 | 
354 |   When you convey a copy of a covered work, you may at your option
355 | remove any additional permissions from that copy, or from any part of
356 | it.  (Additional permissions may be written to require their own
357 | removal in certain cases when you modify the work.)  You may place
358 | additional permissions on material, added by you to a covered work,
359 | for which you have or can give appropriate copyright permission.
360 | 
361 |   Notwithstanding any other provision of this License, for material you
362 | add to a covered work, you may (if authorized by the copyright holders of
363 | that material) supplement the terms of this License with terms:
364 | 
365 |     a) Disclaiming warranty or limiting liability differently from the
366 |     terms of sections 15 and 16 of this License; or
367 | 
368 |     b) Requiring preservation of specified reasonable legal notices or
369 |     author attributions in that material or in the Appropriate Legal
370 |     Notices displayed by works containing it; or
371 | 
372 |     c) Prohibiting misrepresentation of the origin of that material, or
373 |     requiring that modified versions of such material be marked in
374 |     reasonable ways as different from the original version; or
375 | 
376 |     d) Limiting the use for publicity purposes of names of licensors or
377 |     authors of the material; or
378 | 
379 |     e) Declining to grant rights under trademark law for use of some
380 |     trade names, trademarks, or service marks; or
381 | 
382 |     f) Requiring indemnification of licensors and authors of that
383 |     material by anyone who conveys the material (or modified versions of
384 |     it) with contractual assumptions of liability to the recipient, for
385 |     any liability that these contractual assumptions directly impose on
386 |     those licensors and authors.
387 | 
388 |   All other non-permissive additional terms are considered "further
389 | restrictions" within the meaning of section 10.  If the Program as you
390 | received it, or any part of it, contains a notice stating that it is
391 | governed by this License along with a term that is a further
392 | restriction, you may remove that term.  If a license document contains
393 | a further restriction but permits relicensing or conveying under this
394 | License, you may add to a covered work material governed by the terms
395 | of that license document, provided that the further restriction does
396 | not survive such relicensing or conveying.
397 | 
398 |   If you add terms to a covered work in accord with this section, you
399 | must place, in the relevant source files, a statement of the
400 | additional terms that apply to those files, or a notice indicating
401 | where to find the applicable terms.
402 | 
403 |   Additional terms, permissive or non-permissive, may be stated in the
404 | form of a separately written license, or stated as exceptions;
405 | the above requirements apply either way.
406 | 
407 |   8. Termination.
408 | 
409 |   You may not propagate or modify a covered work except as expressly
410 | provided under this License.  Any attempt otherwise to propagate or
411 | modify it is void, and will automatically terminate your rights under
412 | this License (including any patent licenses granted under the third
413 | paragraph of section 11).
414 | 
415 |   However, if you cease all violation of this License, then your
416 | license from a particular copyright holder is reinstated (a)
417 | provisionally, unless and until the copyright holder explicitly and
418 | finally terminates your license, and (b) permanently, if the copyright
419 | holder fails to notify you of the violation by some reasonable means
420 | prior to 60 days after the cessation.
421 | 
422 |   Moreover, your license from a particular copyright holder is
423 | reinstated permanently if the copyright holder notifies you of the
424 | violation by some reasonable means, this is the first time you have
425 | received notice of violation of this License (for any work) from that
426 | copyright holder, and you cure the violation prior to 30 days after
427 | your receipt of the notice.
428 | 
429 |   Termination of your rights under this section does not terminate the
430 | licenses of parties who have received copies or rights from you under
431 | this License.  If your rights have been terminated and not permanently
432 | reinstated, you do not qualify to receive new licenses for the same
433 | material under section 10.
434 | 
435 |   9. Acceptance Not Required for Having Copies.
436 | 
437 |   You are not required to accept this License in order to receive or
438 | run a copy of the Program.  Ancillary propagation of a covered work
439 | occurring solely as a consequence of using peer-to-peer transmission
440 | to receive a copy likewise does not require acceptance.  However,
441 | nothing other than this License grants you permission to propagate or
442 | modify any covered work.  These actions infringe copyright if you do
443 | not accept this License.  Therefore, by modifying or propagating a
444 | covered work, you indicate your acceptance of this License to do so.
445 | 
446 |   10. Automatic Licensing of Downstream Recipients.
447 | 
448 |   Each time you convey a covered work, the recipient automatically
449 | receives a license from the original licensors, to run, modify and
450 | propagate that work, subject to this License.  You are not responsible
451 | for enforcing compliance by third parties with this License.
452 | 
453 |   An "entity transaction" is a transaction transferring control of an
454 | organization, or substantially all assets of one, or subdividing an
455 | organization, or merging organizations.  If propagation of a covered
456 | work results from an entity transaction, each party to that
457 | transaction who receives a copy of the work also receives whatever
458 | licenses to the work the party's predecessor in interest had or could
459 | give under the previous paragraph, plus a right to possession of the
460 | Corresponding Source of the work from the predecessor in interest, if
461 | the predecessor has it or can get it with reasonable efforts.
462 | 
463 |   You may not impose any further restrictions on the exercise of the
464 | rights granted or affirmed under this License.  For example, you may
465 | not impose a license fee, royalty, or other charge for exercise of
466 | rights granted under this License, and you may not initiate litigation
467 | (including a cross-claim or counterclaim in a lawsuit) alleging that
468 | any patent claim is infringed by making, using, selling, offering for
469 | sale, or importing the Program or any portion of it.
470 | 
471 |   11. Patents.
472 | 
473 |   A "contributor" is a copyright holder who authorizes use under this
474 | License of the Program or a work on which the Program is based.  The
475 | work thus licensed is called the contributor's "contributor version".
476 | 
477 |   A contributor's "essential patent claims" are all patent claims
478 | owned or controlled by the contributor, whether already acquired or
479 | hereafter acquired, that would be infringed by some manner, permitted
480 | by this License, of making, using, or selling its contributor version,
481 | but do not include claims that would be infringed only as a
482 | consequence of further modification of the contributor version.  For
483 | purposes of this definition, "control" includes the right to grant
484 | patent sublicenses in a manner consistent with the requirements of
485 | this License.
486 | 
487 |   Each contributor grants you a non-exclusive, worldwide, royalty-free
488 | patent license under the contributor's essential patent claims, to
489 | make, use, sell, offer for sale, import and otherwise run, modify and
490 | propagate the contents of its contributor version.
491 | 
492 |   In the following three paragraphs, a "patent license" is any express
493 | agreement or commitment, however denominated, not to enforce a patent
494 | (such as an express permission to practice a patent or covenant not to
495 | sue for patent infringement).  To "grant" such a patent license to a
496 | party means to make such an agreement or commitment not to enforce a
497 | patent against the party.
498 | 
499 |   If you convey a covered work, knowingly relying on a patent license,
500 | and the Corresponding Source of the work is not available for anyone
501 | to copy, free of charge and under the terms of this License, through a
502 | publicly available network server or other readily accessible means,
503 | then you must either (1) cause the Corresponding Source to be so
504 | available, or (2) arrange to deprive yourself of the benefit of the
505 | patent license for this particular work, or (3) arrange, in a manner
506 | consistent with the requirements of this License, to extend the patent
507 | license to downstream recipients.  "Knowingly relying" means you have
508 | actual knowledge that, but for the patent license, your conveying the
509 | covered work in a country, or your recipient's use of the covered work
510 | in a country, would infringe one or more identifiable patents in that
511 | country that you have reason to believe are valid.
512 | 
513 |   If, pursuant to or in connection with a single transaction or
514 | arrangement, you convey, or propagate by procuring conveyance of, a
515 | covered work, and grant a patent license to some of the parties
516 | receiving the covered work authorizing them to use, propagate, modify
517 | or convey a specific copy of the covered work, then the patent license
518 | you grant is automatically extended to all recipients of the covered
519 | work and works based on it.
520 | 
521 |   A patent license is "discriminatory" if it does not include within
522 | the scope of its coverage, prohibits the exercise of, or is
523 | conditioned on the non-exercise of one or more of the rights that are
524 | specifically granted under this License.  You may not convey a covered
525 | work if you are a party to an arrangement with a third party that is
526 | in the business of distributing software, under which you make payment
527 | to the third party based on the extent of your activity of conveying
528 | the work, and under which the third party grants, to any of the
529 | parties who would receive the covered work from you, a discriminatory
530 | patent license (a) in connection with copies of the covered work
531 | conveyed by you (or copies made from those copies), or (b) primarily
532 | for and in connection with specific products or compilations that
533 | contain the covered work, unless you entered into that arrangement,
534 | or that patent license was granted, prior to 28 March 2007.
535 | 
536 |   Nothing in this License shall be construed as excluding or limiting
537 | any implied license or other defenses to infringement that may
538 | otherwise be available to you under applicable patent law.
539 | 
540 |   12. No Surrender of Others' Freedom.
541 | 
542 |   If conditions are imposed on you (whether by court order, agreement or
543 | otherwise) that contradict the conditions of this License, they do not
544 | excuse you from the conditions of this License.  If you cannot convey a
545 | covered work so as to satisfy simultaneously your obligations under this
546 | License and any other pertinent obligations, then as a consequence you may
547 | not convey it at all.  For example, if you agree to terms that obligate you
548 | to collect a royalty for further conveying from those to whom you convey
549 | the Program, the only way you could satisfy both those terms and this
550 | License would be to refrain entirely from conveying the Program.
551 | 
552 |   13. Use with the GNU Affero General Public License.
553 | 
554 |   Notwithstanding any other provision of this License, you have
555 | permission to link or combine any covered work with a work licensed
556 | under version 3 of the GNU Affero General Public License into a single
557 | combined work, and to convey the resulting work.  The terms of this
558 | License will continue to apply to the part which is the covered work,
559 | but the special requirements of the GNU Affero General Public License,
560 | section 13, concerning interaction through a network will apply to the
561 | combination as such.
562 | 
563 |   14. Revised Versions of this License.
564 | 
565 |   The Free Software Foundation may publish revised and/or new versions of
566 | the GNU General Public License from time to time.  Such new versions will
567 | be similar in spirit to the present version, but may differ in detail to
568 | address new problems or concerns.
569 | 
570 |   Each version is given a distinguishing version number.  If the
571 | Program specifies that a certain numbered version of the GNU General
572 | Public License "or any later version" applies to it, you have the
573 | option of following the terms and conditions either of that numbered
574 | version or of any later version published by the Free Software
575 | Foundation.  If the Program does not specify a version number of the
576 | GNU General Public License, you may choose any version ever published
577 | by the Free Software Foundation.
578 | 
579 |   If the Program specifies that a proxy can decide which future
580 | versions of the GNU General Public License can be used, that proxy's
581 | public statement of acceptance of a version permanently authorizes you
582 | to choose that version for the Program.
583 | 
584 |   Later license versions may give you additional or different
585 | permissions.  However, no additional obligations are imposed on any
586 | author or copyright holder as a result of your choosing to follow a
587 | later version.
588 | 
589 |   15. Disclaimer of Warranty.
590 | 
591 |   THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
592 | APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
596 | PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
597 | IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
599 | 
600 |   16. Limitation of Liability.
601 | 
602 |   IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
610 | SUCH DAMAGES.
611 | 
612 |   17. Interpretation of Sections 15 and 16.
613 | 
614 |   If the disclaimer of warranty and limitation of liability provided
615 | above cannot be given local legal effect according to their terms,
616 | reviewing courts shall apply local law that most closely approximates
617 | an absolute waiver of all civil liability in connection with the
618 | Program, unless a warranty or assumption of liability accompanies a
619 | copy of the Program in return for a fee.
620 | 
621 |                      END OF TERMS AND CONDITIONS
622 | 
623 |             How to Apply These Terms to Your New Programs
624 | 
625 |   If you develop a new program, and you want it to be of the greatest
626 | possible use to the public, the best way to achieve this is to make it
627 | free software which everyone can redistribute and change under these terms.
628 | 
629 |   To do so, attach the following notices to the program.  It is safest
630 | to attach them to the start of each source file to most effectively
631 | state the exclusion of warranty; and each file should have at least
632 | the "copyright" line and a pointer to where the full notice is found.
633 | 
634 |     <one line to give the program's name and a brief idea of what it does.>
635 |     Copyright (C) <year>  <name of author>
636 | 
637 |     This program is free software: you can redistribute it and/or modify
638 |     it under the terms of the GNU General Public License as published by
639 |     the Free Software Foundation, either version 3 of the License, or
640 |     (at your option) any later version.
641 | 
642 |     This program is distributed in the hope that it will be useful,
643 |     but WITHOUT ANY WARRANTY; without even the implied warranty of
644 |     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
645 |     GNU General Public License for more details.
646 | 
647 |     You should have received a copy of the GNU General Public License
648 |     along with this program.  If not, see <https://www.gnu.org/licenses/>.
649 | 
650 | Also add information on how to contact you by electronic and paper mail.
651 | 
652 |   If the program does terminal interaction, make it output a short
653 | notice like this when it starts in an interactive mode:
654 | 
655 |     <program>  Copyright (C) <year>  <name of author>
656 |     This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
657 |     This is free software, and you are welcome to redistribute it
658 |     under certain conditions; type `show c' for details.
659 | 
660 | The hypothetical commands `show w' and `show c' should show the appropriate
661 | parts of the General Public License.  Of course, your program's commands
662 | might be different; for a GUI interface, you would use an "about box".
663 | 
664 |   You should also get your employer (if you work as a programmer) or school,
665 | if any, to sign a "copyright disclaimer" for the program, if necessary.
666 | For more information on this, and how to apply and follow the GNU GPL, see
667 | <https://www.gnu.org/licenses/>.
668 | 
669 |   The GNU General Public License does not permit incorporating your program
670 | into proprietary programs.  If your program is a subroutine library, you
671 | may consider it more useful to permit linking proprietary applications with
672 | the library.  If this is what you want to do, use the GNU Lesser General
673 | Public License instead of this License.  But first, please read
674 | <https://www.gnu.org/licenses/why-not-lgpl.html>.


--------------------------------------------------------------------------------
/requirements.txt:
--------------------------------------------------------------------------------
 1 | docopt==0.6.2
 2 | Jinja2==2.10.1
 3 | MarkupSafe==1.1.1
 4 | numpy==1.16.4
 5 | pandas==0.24.2
 6 | python-dateutil==2.8.0
 7 | pytz==2019.1
 8 | selenium==3.141.0
 9 | six==1.12.0
10 | tqdm==4.32.1
11 | urllib3==1.25.3
12 | 


--------------------------------------------------------------------------------
/templates/index.html:
--------------------------------------------------------------------------------
  1 | <!DOCTYPE html>
  2 | <html lang="en">
  3 |   <head>
  4 |     <meta charset="utf-8">
  5 | 
  6 |     <title>Tree Example</title>
  7 | 
  8 |     <style>
  9 | 	
 10 | 	.node {
 11 | 		cursor: pointer;
 12 | 	}
 13 | 
 14 | 	.node circle {
 15 | 	  fill: #fff;
 16 | 	  stroke: steelblue;
 17 | 	  stroke-width: 3px;
 18 | 	}
 19 | 
 20 | 	.node text {
 21 | 	  font: 12px sans-serif;
 22 | 	}
 23 | 
 24 | 	.link {
 25 | 	  fill: none;
 26 | 	  stroke: #ccc;
 27 | 	  stroke-width: 2px;
 28 | 	}
 29 | 	
 30 |     </style>
 31 | 
 32 |   </head>
 33 | 
 34 |   <body>
 35 | 
 36 | <!-- load the d3.js library -->	
 37 | <script src="http://d3js.org/d3.v3.min.js"></script>
 38 | <script>
 39 | {{ treeData }}
 40 | </script>
 41 | <script>
 42 | 
 43 | 
 44 | // ************** Generate the tree diagram	 *****************
 45 | var margin = {top: 20, right: 120, bottom: 20, left: 120},
 46 | 	width = 1080 - margin.right - margin.left,
 47 | 	height = 960 - margin.top - margin.bottom;
 48 | 	
 49 | var i = 0,
 50 | 	duration = 750,
 51 | 	root;
 52 | 
 53 | var tree = d3.layout.tree()
 54 | 	.size([height, width]);
 55 | 
 56 | var diagonal = d3.svg.diagonal()
 57 | 	.projection(function(d) { return [d.y, d.x]; });
 58 | 
 59 | var svg = d3.select("body").append("svg")
 60 | 	.attr("width", width + margin.right + margin.left)
 61 | 	.attr("height", height + margin.top + margin.bottom)
 62 |   .append("g")
 63 | 	.attr("transform", "translate(" + margin.left + "," + margin.top + ")");
 64 | 
 65 | root = treeData[0];
 66 | root.x0 = height / 2;
 67 | root.y0 = 0;
 68 |   
 69 | update(root);
 70 | 
 71 | d3.select(self.frameElement).style("height", "500px");
 72 | 
 73 | function update(source) {
 74 | 
 75 |   // Compute the new tree layout.
 76 |   var nodes = tree.nodes(root).reverse(),
 77 | 	  links = tree.links(nodes);
 78 | 
 79 |   // Normalize for fixed-depth.
 80 |   nodes.forEach(function(d) { d.y = d.depth * 180; });
 81 | 
 82 |   // Update the nodes…
 83 |   var node = svg.selectAll("g.node")
 84 | 	  .data(nodes, function(d) { return d.id || (d.id = ++i); });
 85 | 
 86 |   // Enter any new nodes at the parent's previous position.
 87 |   var nodeEnter = node.enter().append("g")
 88 | 	  .attr("class", "node")
 89 | 	  .attr("transform", function(d) { return "translate(" + source.y0 + "," + source.x0 + ")"; })
 90 | 	  .on("click", click);
 91 | 
 92 |   nodeEnter.append("circle")
 93 | 	  .attr("r", 1e-6)
 94 | 	  .style("fill", function(d) { return d._children ? "lightsteelblue" : "#fff"; });
 95 | 
 96 |   nodeEnter.append("text")
 97 | 	  .attr("x", function(d) { return d.children || d._children ? -13 : 13; })
 98 | 	  .attr("dy", ".35em")
 99 | 	  .attr("text-anchor", function(d) { return d.children || d._children ? "end" : "start"; })
100 | 	  .text(function(d) { return d.name; })
101 | 	  .style("fill-opacity", 1e-6);
102 | 
103 |   // Transition nodes to their new position.
104 |   var nodeUpdate = node.transition()
105 | 	  .duration(duration)
106 | 	  .attr("transform", function(d) { return "translate(" + d.y + "," + d.x + ")"; });
107 | 
108 |   nodeUpdate.select("circle")
109 | 	  .attr("r", 10)
110 | 	  .style("fill", function(d) { return d._children ? "lightsteelblue" : "#fff"; });
111 | 
112 |   nodeUpdate.select("text")
113 | 	  .style("fill-opacity", 1);
114 | 
115 |   // Transition exiting nodes to the parent's new position.
116 |   var nodeExit = node.exit().transition()
117 | 	  .duration(duration)
118 | 	  .attr("transform", function(d) { return "translate(" + source.y + "," + source.x + ")"; })
119 | 	  .remove();
120 | 
121 |   nodeExit.select("circle")
122 | 	  .attr("r", 1e-6);
123 | 
124 |   nodeExit.select("text")
125 | 	  .style("fill-opacity", 1e-6);
126 | 
127 |   // Update the links…
128 |   var link = svg.selectAll("path.link")
129 | 	  .data(links, function(d) { return d.target.id; });
130 | 
131 |   // Enter any new links at the parent's previous position.
132 |   link.enter().insert("path", "g")
133 | 	  .attr("class", "link")
134 | 	  .attr("d", function(d) {
135 | 		var o = {x: source.x0, y: source.y0};
136 | 		return diagonal({source: o, target: o});
137 | 	  });
138 | 
139 |   // Transition links to their new position.
140 |   link.transition()
141 | 	  .duration(duration)
142 | 	  .attr("d", diagonal);
143 | 
144 |   // Transition exiting nodes to the parent's new position.
145 |   link.exit().transition()
146 | 	  .duration(duration)
147 | 	  .attr("d", function(d) {
148 | 		var o = {x: source.x, y: source.y};
149 | 		return diagonal({source: o, target: o});
150 | 	  })
151 | 	  .remove();
152 | 
153 |   // Stash the old positions for transition.
154 |   nodes.forEach(function(d) {
155 | 	d.x0 = d.x;
156 | 	d.y0 = d.y;
157 |   });
158 | }
159 | 
160 | // Toggle children on click.
161 | function click(d) {
162 |   if (d.children) {
163 | 	d._children = d.children;
164 | 	d.children = null;
165 |   } else {
166 | 	d.children = d._children;
167 | 	d._children = null;
168 |   }
169 |   update(d);
170 | }
171 | 
172 | </script>
173 | 	
174 |   </body>
175 | </html>


--------------------------------------------------------------------------------