├── .gitignore ├── LICENSE ├── README.md ├── css └── main.css ├── data ├── data.js └── data_simple.js ├── examples ├── adding_nodes.html ├── appearance_options.html ├── import_data.html ├── layout_options.html └── layout_orientation.html ├── familytree.html └── js ├── d3-dag.js └── familytree.js /.gitignore: -------------------------------------------------------------------------------- 1 | .vscode/ 2 | data/data_large.js 3 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 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 | 635 | Copyright (C) 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 . 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 | Copyright (C) 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 | . 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 | . 675 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # js_family_tree 2 | 3 | Interactive visualization and -exploration tool for large family trees. 4 | 5 | Author: Benjamin W. Portner 6 | 7 | License: GNU General Public License v3.0 8 | 9 | [Live example here.](https://rawcdn.githack.com/BenPortner/js_family_tree/31118b43b0933e8ff1f3210e32ae9e9d347da365/familytree.html) (Kudos to [Pavel Puchkin](https://neoascetic.me/) from [githack.com](https://raw.githack.com/) for providing the caching proxy!) 10 | 11 | [JSFiddle here.](https://jsfiddle.net/BenPortner/6mnt1wy4/18/) 12 | 13 | ## Features 14 | 15 | The code is based on the [collapsible d3 tree example](https://bl.ocks.org/d3noob/43a860bc0024792f8803bba8ca0d5ecd) by d3noob. 16 | 17 | Features in the original: 18 | - uses [d3-hierarchy](https://github.com/d3/d3-hierarchy) 19 | - collapsible children nodes 20 | - nice transitions 21 | 22 | New features: 23 | - uses [d3-dag](https://github.com/erikbrinkman/d3-dag) instead of d3-hierarchy (allows two parents per node) 24 | - introduces union nodes to connect parents and children via common way point 25 | - nodes are collapsible in all directions: children, parents, partners (nodes memorize their dependencies) 26 | - use [d3-tip](https://github.com/caged/d3-tip) to show metadata on hover 27 | - use d3-zoom to enable zooming and panning 28 | 29 | ## How to use 30 | 31 | - Edit `data/data.js` to represent your family tree 32 | - Open `familytree.html` 33 | - Done! 34 | 35 | ## Data format 36 | 37 | The file `data/data.js` contains a single javascript object, which represents the family tree. The fields are as follows: 38 | 39 | - `start`: Enter here the id of the person, which should be the starting point of the family tree. 40 | - `persons`: Contains metadata about each person. Make sure each `id` is unique. Also, make sure each element in `own_unions` refers to a valid `union` defined in `data.unions`. 41 | - `unions`: Contains metadata about each family. Each entry in `partner` and `children` must refer to a valid `person` defined in `data.persons`. 42 | - `links`: Defines how unions and persons are to be linked (edge list). Basically an alternative representation of the information contained in `person.own_unions`, `union.partner` and `union.children`. Unfortunately, this redundancy is for now necessary to ensure proper functioning of the code! 43 | 44 | ```javascript 45 | data = { 46 | "start":"id4", 47 | "persons": { 48 | "id1": { "id": "id1", "name": "Adam", "birthyear": 1900, "deathyear": 1980, "own_unions": ["u1"], "birthplace":"Alberta", "deathplace":"Austin"}, 49 | "id2": { "id": "id2", "name": "Berta", "birthyear": 1901, "deathyear": 1985, "own_unions": ["u1"], "birthplace":"Berlin", "deathplace":"Bern" }, 50 | "id3": { "id": "id3", "name": "Charlene", "birthyear": 1930, "deathyear": 2010, "own_unions": ["u3", "u4"], "parent_union": "u1", "birthplace":"Château", "deathplace":"Cuxhaven" }, 51 | "id4": { "id": "id4", "name": "Dan", "birthyear": 1926, "deathyear": 2009, "own_unions": [], "parent_union": "u1", "birthplace":"den Haag", "deathplace":"Derince" }, 52 | "id5": { "id": "id5", "name": "Eric", "birthyear": 1931, "deathyear": 2015, "own_unions": ["u3"], "parent_union": "u2", "birthplace":"Essen", "deathplace":"Edinburgh" }, 53 | "id6": { "id": "id6", "name": "Francis", "birthyear": 1902, "deathyear": 1970, "own_unions": ["u2"], "birthplace":"Firenze", "deathplace":"Faizabad" }, 54 | "id7": { "id": "id7", "name": "Greta", "birthyear": 1905, "deathyear": 1990, "own_unions": ["u2"] }, 55 | "id8": { "id": "id8", "name": "Heinz", "birthyear": 1970, "own_unions": ["u5"], "parent_union": "u3" }, 56 | "id9": { "id": "id9", "name": "Iver", "birthyear": 1925, "deathyear": 1963, "own_unions": ["u4"] }, 57 | "id10": { "id": "id10", "name": "Jennifer", "birthyear": 1950, "own_unions": [], "parent_union": "u4" }, 58 | "id11": { "id": "id11", "name": "Klaus", "birthyear": 1933, "deathyear": 2013, "own_unions": [], "parent_union": "u1" }, 59 | "id12": { "id": "id12", "name": "Lennart", "birthyear": 1999, "own_unions": [], "parent_union": "u5" }, 60 | }, 61 | "unions": { 62 | "u1": { "id": "u1", "partner": ["id1", "id2"], "children": ["id3", "id4", "id11"] }, 63 | "u2": { "id": "u2", "partner": ["id6", "id7"], "children": ["id5"] }, 64 | "u3": { "id": "u3", "partner": ["id3", "id5"], "children": ["id8"] }, 65 | "u4": { "id": "u4", "partner": ["id3", "id9"], "children": ["id10"] }, 66 | "u5": { "id": "u5", "partner": ["id8"], "children": ["id12"] }, 67 | }, 68 | "links": [ 69 | ["id1", "u1"], 70 | ["id2", "u1"], 71 | ["u1", "id3"], 72 | ["u1", "id4"], 73 | ["id6", "u2"], 74 | ["id7", "u2"], 75 | ["u2", "id5"], 76 | ["id3", "u3"], 77 | ["id5", "u3"], 78 | ["u3", "id8"], 79 | ["id3", "u4"], 80 | ["id9", "u4"], 81 | ["u4", "id10"], 82 | ["u1", "id11"], 83 | ["id8", "u5"], 84 | ["u5", "id12"], 85 | ] 86 | } 87 | ``` -------------------------------------------------------------------------------- /css/main.css: -------------------------------------------------------------------------------- 1 | body { 2 | width: 100%; 3 | height: 100%; 4 | overflow: hidden; 5 | } 6 | 7 | .person { 8 | stroke: steelblue; 9 | stroke-width: 3px; 10 | } 11 | 12 | .extendable { 13 | fill: lightsteelblue; 14 | } 15 | 16 | .non-extendable { 17 | fill: #fff; 18 | } 19 | 20 | .node-label { 21 | font: 12px sans-serif; 22 | } 23 | 24 | .link { 25 | fill: none; 26 | stroke: #ccc; 27 | stroke-width: 2px; 28 | } 29 | 30 | .tooltip { 31 | position: absolute; 32 | font: 12px sans-serif; 33 | padding: 12px; 34 | background: rgba(0, 0, 0, 0.8); 35 | color: #fff; 36 | border-radius: 2px; 37 | } -------------------------------------------------------------------------------- /data/data.js: -------------------------------------------------------------------------------- 1 | // Game of Thrones family tree (https://en.wikipedia.org/wiki/Game_of_Thrones) 2 | // file created by djBirdman (https://github.com/djBirdman) 3 | data = { 4 | "start": "benjenstark1", 5 | "persons": { 6 | "benjenstark1": { "id": "benjenstark1", "name": "Benjen Stark", "birthyear": 84, "deathyear": "101-121", "own_unions": ["uBenjenLysa"] }, 7 | "lysalocke1": { "id": "lysalocke1", "name": "Lysa Locke", "birthyear": 84, "own_unions": ["uBenjenLysa"] }, 8 | "rickonstark1": { "id": "rickonstark1", "name": "Rickon Stark", "birthyear": 96, "deathyear": 121, "own_unions": ["uRickonGilliane"], "parent_union": "uBenjenLysa" }, 9 | "bennardstark1": { "id": "bennardstark1", "name": "Bennard Stark", "birthyear": 105, "deathyear": 126, "own_unions": ["uBennardMargaret"], "parent_union": "uBenjenLysa" }, 10 | "gillianeglover1": { "id": "gillianeglover1", "name": "Lady Gilliane Glover", "birthyear": 96, "deathyear": 109, "own_unions": ["uRickonGilliane"] }, 11 | "margaretcarstark1": { "id": "margaretcarstark1", "name": "Margaret Karstark", "birthyear": 112, "own_unions": ["uBennardMargaret"] }, 12 | "creganstark1": { "id": "creganstark1", "name": "Cregan Stark", "birthyear": 108, "deathyear": "157-196", "own_unions": ["uCreganArra", "uCreganAlysanne", "uCreganLynara"], "parent_union": "uRickonGilliane" }, 13 | "benjenstark2": { "id": "benjenstark2", "name": "Benjen Stark", "birthyear": 124, "own_unions": [], "parent_union": "uBennardMargaret" }, 14 | "brandonstark1": { "id": "brandonstark1", "name": "Brandon Stark", "birthyear": 125, "own_unions": [], "parent_union": "uBennardMargaret" }, 15 | "elricstark1": { "id": "elricstark1", "name": "Elric Stark", "birthyear": 126, "own_unions": [], "parent_union": "uBennardMargaret" }, 16 | "arranorrey1": { "id": "arranorrey1", "name": "Arra Norrey", "birthyear": 116, "deathyear": 128, "own_unions": ["uCreganArra"] }, 17 | "alysanneblackwood1": { "id": "alysanneblackwood1", "name": "Alysanne Blackwood", "birthyear": 113, "deathyear": "136-179", "own_unions": ["uCreganAlysanne"] }, 18 | "lynarastark1": { "id": "lynarastark1", "name": "Lynara Stark", "own_unions": ["uCreganLynara"] }, 19 | "rickonstark2": { "id": "rickonstark2", "name": "Rickon Stark", "birthyear": 128, "deathyear": 157, "own_unions": ["uRickonJeyne"], "parent_union": "uCreganArra" }, 20 | "sarrastark1": { "id": "sarrastark1", "name": "Sarra Stark", "birthyear": 133, "own_unions": [], "parent_union": "uCreganAlysanne" }, 21 | "alysstark1": { "id": "alysstark1", "name": "Alys Stark", "birthyear": 134, "own_unions": [], "parent_union": "uCreganAlysanne" }, 22 | "rayastark1": { "id": "rayastark1", "name": "Raya Stark", "birthyear": 135, "own_unions": [], "parent_union": "uCreganAlysanne" }, 23 | "mariahstark1": { "id": "mariahstark1", "name": "Mariah Stark", "birthyear": 136, "own_unions": [], "parent_union": "uCreganAlysanne" }, 24 | "jonnelstark1": { "id": "jonnelstark1", "name": "Jonnel Stark", "birthyear": 136, "deathyear": "157-209", "own_unions": ["uJonnelStark1Inbreed", "uJonnelRobyn"], "parent_union": "uCreganLynara" }, 25 | "jonnelstark1inbreednote": { "id": "jonnelstark1inbreednote", "name": "Jonnel married half-brother Rickon's d. Sansa", "own_unions": [], "parent_union": "uJonnelStark1Inbreed" }, 26 | "jonnelstark1inbreed": { "id": "jonnelstark1inbreed", "name": "Jonnel Stark", "birthyear": 136, "deathyear": "157-209", "own_unions": ["uJonnelSansa"] }, 27 | "edricstark1": { "id": "edricstark1", "name": "Edric Stark", "birthyear": 137, "deathyear": "153-209", "own_unions": ["uEdricStark1Inbreed"], "parent_union": "uCreganLynara" }, 28 | "edricstark1inbreednote": { "id": "edricstark1inbreednote", "name": "Edric married half-brother Rickon's d. Serena", "own_unions": [], "parent_union": "uEdricStark1Inbreed" }, 29 | "edricstark1inbreed": { "id": "edricstark1inbreed", "name": "Edric Stark", "birthyear": 137, "deathyear": "153-209", "own_unions": ["uEdricSerena"] }, 30 | "lyannastark1": { "id": "lyannastark1", "name": "Lyanna Stark", "birthyear": 138, "own_unions": [], "parent_union": "uCreganLynara" }, 31 | "barthoganstark1": { "id": "barthoganstark1", "name": "Barthogan Stark", "birthyear": 139, "deathyear": "184-209", "own_unions": [], "parent_union": "uCreganLynara" }, 32 | "brandonstark2": { "id": "brandonstark2", "name": "Brandon Stark", "birthyear": 140, "deathyear": "184-212", "own_unions": ["uBrandonWylla", "uBrandonAlys"], "parent_union": "uCreganLynara" }, 33 | "robynryswell1": { "id": "robynryswell1", "name": "Robyn Ryswell", "birthyear": 141, "own_unions": ["uJonnelRobyn"] }, 34 | "jeynemanderly1": { "id": "jeynemanderly1", "name": "Jeyne Manderly", "own_unions": ["uRickonJeyne"] }, 35 | "wyllafenn1": { "id": "wyllafenn1", "name": "Wylla Fenn", "own_unions": ["uBrandonWylla"] }, 36 | "alyskarstark1": { "id": "alyskarstark1", "name": "Alys Karstark", "own_unions": ["uBrandonAlys"] }, 37 | "sansastark1": { "id": "sansastark1", "name": "Sansa Stark", "birthyear": 140, "own_unions": ["uJonnelSansa"], "parent_union": "uRickonJeyne" }, 38 | "sansastark1inbreed": { "id": "sansastark1inbreed", "name": "Sansa Stark (see Rickon Stark)", "birthyear": 140, "own_unions": ["uJonnelStark1Inbreed"] }, 39 | "serenastark1": { "id": "serenastark1", "name": "Serena Stark", "birthyear": 141, "own_unions": ["uEdricSerena", "uJonSerena"], "parent_union": "uRickonJeyne" }, 40 | "serenastark1inbreed": { "id": "serenastark1inbreed", "name": "Serena Stark (see Rickon Stark)", "birthyear": 141, "own_unions": ["uEdricStark1Inbreed"] }, 41 | "jonumber1": { "id": "jonumber1", "name": "Jon Umber", "own_unions": ["uJonSerena"] }, 42 | "cregardstark1": { "id": "cregardstark1", "name": "Cregard Stark", "birthyear": 162, "own_unions": [], "parent_union": "uEdricSerena" }, 43 | "torrhenstark1": { "id": "torrhenstark1", "name": "Torrhen Stark", "birthyear": 162, "own_unions": [], "parent_union": "uEdricSerena" }, 44 | "arranastark1": { "id": "arranastark1", "name": "Arrana Stark", "birthyear": 163, "own_unions": ["uOsricArrana"], "parent_union": "uEdricSerena" }, 45 | "aragellestark1": { "id": "aragellestark1", "name": "Aragelle Stark", "birthyear": 164, "own_unions": ["uRobardAregelle"], "parent_union": "uEdricSerena" }, 46 | "lonnelsnow1": { "id": "lonnelsnow1", "name": "Lonnel Snow", "birthyear": 1, "own_unions": [], "parent_union": "uBrandonWylla" }, 47 | "rodwellstark1": { "id": "lonnelsnow1", "name": "Rodwell Stark", "birthyear": 170, "deathyear": "184-212", "own_unions": ["uRodwellMyriame"], "parent_union": "uBrandonAlys" }, 48 | "beronstark1": { "id": "lonnelsnow1", "name": "Beron Stark", "birthyear": 172, "deathyear": 212, "own_unions": ["uBeronLorra"], "parent_union": "uBrandonAlys" }, 49 | "arsastark1": { "id": "lonnelsnow1", "name": "Arsa Stark", "birthyear": 173, "own_unions": [], "parent_union": "uBrandonAlys" }, 50 | "osricumber1": { "id": "osricumber1", "name": "Osric Umber", "birthyear": 160, "own_unions": ["uOsricArrana"] }, 51 | "robardcerwyn1": { "id": "robardcerwyn1", "name": "Robard Cerwyn", "own_unions": ["uRobardAregelle"] }, 52 | "myriamemanderly1": { "id": "myriamemanderly1", "name": "Myriame Manderly", "own_unions": ["uRodwellMyriame"] }, 53 | "lorraroyce1": { "id": "lorraroyce1", "name": "Lorra Royce", "own_unions": ["uBeronLorra"] }, 54 | "unknown1": { "id": "unknown1", "name": "Unknown", "own_unions": [], "parent_union": "uOsricArrana" }, 55 | "unknown2": { "id": "unknown2", "name": "Unknown", "own_unions": [], "parent_union": "uRobardAregelle" }, 56 | "donnorstark1": { "id": "donnorstark1", "name": "Donnor Stark", "birthyear": 194, "deathyear": "212-226", "own_unions": [], "parent_union": "uBeronLorra" }, 57 | "willamstark1": { "id": "willamstark1", "name": "Willam Stark", "birthyear": 195, "deathyear": 226, "own_unions": ["uWillamLyanne", "uWillamMelantha"], "parent_union": "uBeronLorra" }, 58 | "artosstark1": { "id": "artosstark1", "name": "Artos Stark", "birthyear": 196, "own_unions": ["uArtosLysara"], "parent_union": "uBeronLorra" }, 59 | "berenastark1": { "id": "berenastark1", "name": "Berena Stark", "birthyear": 197, "own_unions": [], "parent_union": "uBeronLorra" }, 60 | "alysannestark1": { "id": "alysannestark1", "name": "Alysanne Stark", "birthyear": 198, "own_unions": [], "parent_union": "uBeronLorra" }, 61 | "erroldstark1": { "id": "erroldstark1", "name": "Errold Stark", "birthyear": 199, "own_unions": [], "parent_union": "uBeronLorra" }, 62 | "rodrikstark1": { "id": "rodrikstark1", "name": "Rodrik Stark", "birthyear": 200, "own_unions": ["uRodrikArya"], "parent_union": "uBeronLorra" }, 63 | "lyanneglover1": { "id": "lyanneglover1", "name": "Lyanne Glover", "deathyear": 206, "own_unions": ["uWillamLyanne"] }, 64 | "melanthablackwood1": { "id": "melanthablackwood1", "name": "Melantha Blackwood", "own_unions": ["uWillamMelantha"] }, 65 | "lysarakarstark1": { "id": "lysarakarstark1", "name": "Lysara Karstark", "own_unions": ["uArtosLysara"] }, 66 | "aryaflint1": { "id": "aryaflint1", "name": "Arya Flint", "own_unions": ["uRodrikArya"] }, 67 | "brandonstark3": { "id": "brandonstark3", "name": "Brandon Stark", "birthyear": 206, "deathyear": 209, "own_unions": [], "parent_union": "uWillamLyanne" }, 68 | "edwylestark1": { "id": "edwylestark1", "name": "Edwyle Stark", "birthyear": 208, "own_unions": ["uEdwyleMarna"], "parent_union": "uWillamMelantha" }, 69 | "jocelynstark1": { "id": "jocelynstark1", "name": "Jocelyn Stark", "birthyear": 209, "own_unions": ["uBenedictJocelyn"], "parent_union": "uWillamMelantha" }, 70 | "brandonstark4": { "id": "brandonstark4", "name": "Brandon Stark", "birthyear": 210, "own_unions": ["uBrandonUnknown"], "parent_union": "uArtosLysara" }, 71 | "benjenstark3": { "id": "benjenstark3", "name": "Benjen Stark", "birthyear": 210, "own_unions": ["uBenjenUnknown"], "parent_union": "uArtosLysara" }, 72 | "brandastark1": { "id": "brandastark1", "name": "Branda Stark", "birthyear": 220, "own_unions": ["uHarroldBranda"], "parent_union": "uRodrikArya" }, 73 | "lyarrastark1": { "id": "lyarrastark1", "name": "Lyarra Stark", "birthyear": 221, "own_unions": ["uLyarraStark1Inbreed"], "parent_union": "uRodrikArya" }, 74 | "lyarrastark1inbreednote": { "id": "lyarrastark1inbreednote", "name": "Lyarra married cousin Edwyle's son Rickard", "own_unions": [], "parent_union": "uLyarraStark1Inbreed" }, 75 | "lyarrastark1inbreed": { "id": "lyarrastark1inbreed", "name": "Lyarra Stark", "birthyear": 136, "deathyear": "157-209", "own_unions": ["uRickardLyarra"] }, 76 | "marnalocke1": { "id": "marnalocke1", "name": "Marna Locke", "own_unions": ["uEdwyleMarna"] }, 77 | "benedictjoyce1": { "id": "benedictjoyce1", "name": "Benedict Joyce", "own_unions": ["uBenedictJocelyn"] }, 78 | "harroldrogers1": { "id": "harroldrogers1", "name": "Harrold Rogers", "own_unions": ["uHarroldBranda"] }, 79 | "rickardstark1": { "id": "rickardstark1", "name": "Rickard Stark", "birthyear": 238, "deathyear": 282, "own_unions": ["uRickardLyarra"], "parent_union": "uEdwyleMarna" }, 80 | "rickardstark1inbreed": { "id": "rickardstark1inbreed", "name": "Rickard Stark (see Willam Stark > Edwyle Stark)", "birthyear": 238, "deathyear": 282, "own_unions": ["uLyarraStark1Inbreed"] }, 81 | "unknown3": { "id": "unknown3", "name": "Unknown Daughter", "birthyear": 230, "own_unions": [], "parent_union": "uBenedictJocelyn" }, 82 | "unknown4": { "id": "unknown4", "name": "Unknown Daughter", "birthyear": 232, "own_unions": [], "parent_union": "uBenedictJocelyn" }, 83 | "unknown5": { "id": "unknown5", "name": "Unknown Daughter", "birthyear": 234, "own_unions": [], "parent_union": "uBenedictJocelyn" }, 84 | "unknown6mother": { "id": "unknown6mother", "name": "Unknown", "own_unions": ["uBrandonUnknown"] }, 85 | "unknown6": { "id": "unknown6", "name": "Unknown", "own_unions": [], "parent_union": "uBrandonUnknown" }, 86 | "unknown7mother": { "id": "unknown7mother", "name": "Unknown", "own_unions": ["uBenjenUnknown"] }, 87 | "unknown7": { "id": "unknown7", "name": "Unknown", "own_unions": [], "parent_union": "uBenjenUnknown" }, 88 | "brandonstark5": { "id": "brandonstark5", "name": "Brandon Stark", "birthyear": 262, "deathyear": 282, "own_unions": [], "parent_union": "uRickardLyarra" }, 89 | "eddardstark1": { "id": "eddardstark1", "name": "Eddard Stark", "birthyear": 263, "deathyear": 299, "own_unions": ["uEddardUnknown", "uEddardCatelyn"], "parent_union": "uRickardLyarra" }, 90 | "lyannastark2": { "id": "lyannastark2", "name": "Lyanna Stark", "birthyear": 266, "deathyear": 283, "own_unions": [], "parent_union": "uRickardLyarra" }, 91 | "benjenstark4": { "id": "benjenstark4", "name": "Benjen Stark", "birthyear": 267, "own_unions": [], "parent_union": "uRickardLyarra" }, 92 | "catelyntully1": { "id": "catelyntully1", "name": "Catelyn Tully", "birthyear": 264, "deathyear": 299, "own_unions": ["uEddardCatelyn"] }, 93 | "unknown8": { "id": "unknown8", "name": "Unknown", "own_unions": ["uEddardUnknown"] }, 94 | "jonsnow1": { "id": "jonsnow1", "name": "Jon Snow", "birthyear": 283, "own_unions": [], "parent_union": "uEddardUnknown" }, 95 | "robbstark1": { "id": "robbstark1", "name": "Robb Stark", "birthyear": 283, "deathyear": 299, "own_unions": [], "parent_union": "uEddardCatelyn" }, 96 | "sansastark2": { "id": "sansastark2", "name": "Sansa Stark", "birthyear": 286, "own_unions": [], "parent_union": "uEddardCatelyn" }, 97 | "aryastark1": { "id": "aryastark1", "name": "Arya Stark", "birthyear": 289, "own_unions": [], "parent_union": "uEddardCatelyn" }, 98 | "branstark1": { "id": "branstark1", "name": "Bran Stark", "birthyear": 290, "own_unions": [], "parent_union": "uEddardCatelyn" }, 99 | "rickonstark3": { "id": "rickonstark3", "name": "Rickon Stark", "birthyear": 295, "own_unions": [], "parent_union": "uEddardCatelyn" }, 100 | }, 101 | "unions": { 102 | "uBenjenLysa": { "id": "uBenjenLysa", "partner": ["benjenstark1", "lysalocke1"], "children": ["rickonstark1", "bennardstark1"], "unionYear": 1 }, 103 | "uRickonGilliane": { "id": "uRickonGilliane", "partner": ["rickonstark1", "gillianeglover1"], "children": ["creganstark1"], "unionYear": 1 }, 104 | "uBennardMargaret": { "id": "uBennardMargaret", "partner": ["bennardstark1", "margaretcarstark1"], "children": ["benjenstark2", "brandonstark1", "elricstark1"], "unionYear": 1 }, 105 | "uCreganArra": { "id": "uCreganArra", "partner": ["creganstark1", "arranorrey1"], "children": ["rickonstark2"], "unionYear": 126 }, 106 | "uCreganAlysanne": { "id": "uCreganAlysanne", "partner": ["creganstark1", "alysanneblackwood1"], "children": ["sarrastark1", "alysstark1", "rayastark1", "mariahstark1"], "unionYear": 132 }, 107 | "uCreganLynara": { "id": "uCreganLynara", "partner": ["creganstark1", "lynarastark1"], "children": ["jonnelstark1", "edricstark1", "lyannastark1", "barthoganstark1", "brandonstark2"], "unionYear": 136 }, 108 | "uRickonJeyne": { "id": "uRickonJeyne", "partner": ["rickonstark2", "jeynemanderly1"], "children": ["sansastark1", "serenastark1"], "unionYear": 1 }, 109 | "uJonnelStark1Inbreed": { "id": "uJonnelStark1Inbreed", "partner": ["jonnelstark1", "sansastark1inbreed"], "children": ["jonnelstark1inbreednote"], "unionYear": 150 }, 110 | "uJonnelSansa": { "id": "uJonnelSansa", "partner": ["jonnelstark1inbreed", "sansastark1"], "unionYear": 150 }, 111 | "uJonnelRobyn": { "id": "uJonnelRobyn", "partner": ["jonnelstark1", "robynryswell1"], "unionYear": 151 }, 112 | "uEdricStark1Inbreed": { "id": "uEdricStark1Inbreed", "partner": ["edricstark1", "serenastark1inbreed"], "children": ["edricstark1inbreednote"], "unionYear": 162 }, 113 | "uEdricSerena": { "id": "uEdricSerena", "partner": ["edricstark1inbreed", "serenastark1"], "children": ["cregardstark1", "torrhenstark1", "arranastark1", "aragellestark1"], "unionYear": 162 }, 114 | "uBrandonWylla": { "id": "uBrandonWylla", "partner": ["brandonstark2", "wyllafenn1"], "children": ["lonnelsnow1"], "unionYear": 152 }, 115 | "uBrandonAlys": { "id": "uBrandonAlys", "partner": ["brandonstark2", "alyskarstark1"], "children": ["rodwellstark1", "beronstark1", "arsastark1"], "unionYear": 153 }, 116 | "uJonSerena": { "id": "uJonSerena", "partner": ["jonumber1", "serenastark1"], "unionYear": 161 }, 117 | "uOsricArrana": { "id": "uOsricArrana", "partner": ["arranastark1", "osricumber1"], "children": ["unknown1"], "unionYear": 1 }, 118 | "uRobardAregelle": { "id": "uRobardAregelle", "partner": ["aragellestark1", "robardcerwyn1"], "children": ["unknown2"], "unionYear": 1 }, 119 | "uRodwellMyriame": { "id": "uRodwellMyriame", "partner": ["rodwellstark1", "myriamemanderly1"], "unionYear": 1 }, 120 | "uBeronLorra": { "id": "uBeronLorra", "partner": ["beronstark1", "lorraroyce1"], "children": ["donnorstark1", "willamstark1", "artosstark1", "berenastark1", "alysannestark1", "erroldstark1", "rodrikstark1"], "unionYear": 1 }, 121 | "uWillamLyanne": { "id": "uWillamLyanne", "partner": ["willamstark1", "lyanneglover1"], "children": ["brandonstark3"], "unionYear": 204 }, 122 | "uWillamMelantha": { "id": "uWillamMelantha", "partner": ["willamstark1", "melanthablackwood1"], "children": ["edwylestark1", "jocelynstark1"], "unionYear": 207 }, 123 | "uArtosLysara": { "id": "uArtosLysara", "partner": ["artosstark1", "lysarakarstark1"], "children": ["brandonstark4", "benjenstark3"], "unionYear": 2 }, 124 | "uRodrikArya": { "id": "uRodrikArya", "partner": ["rodrikstark1", "aryaflint1"], "children": ["brandastark1", "lyarrastark1"], "unionYear": 2 }, 125 | "uEdwyleMarna": { "id": "uEdwyleMarna", "partner": ["edwylestark1", "marnalocke1"], "children": ["rickardstark1"], "unionYear": 2 }, 126 | "uBenedictJocelyn": { "id": "uBenedictJocelyn", "partner": ["benedictjoyce1", "jocelynstark1"], "children": ["unknown3", "unknown4", "unknown5"], "unionYear": 2 }, 127 | "uBrandonUnknown": { "id": "uBrandonUnknown", "partner": ["brandonstark4", "unknown6mother"], "children": ["unknown6"], "unionYear": 2 }, 128 | "uBenjenUnknown": { "id": "uBenjenUnknown", "partner": ["benjenstark3", "unknown7mother"], "children": ["unknown7"], "unionYear": 2 }, 129 | "uHarroldBranda": { "id": "uHarroldBranda", "partner": ["harroldrogers1", "brandastark1"], "unionYear": 2 }, 130 | "uLyarraStark1Inbreed": { "id": "uLyarraStark1Inbreed", "partner": ["rickardstark1inbreed", "lyarrastark1"], "children": ["lyarrastark1inbreednote"], "unionYear": 2 }, 131 | "uRickardLyarra": { "id": "uRickardLyarra", "partner": ["rickardstark1", "lyarrastark1inbreed"], "children": ["brandonstark5", "eddardstark1", "lyannastark2", "benjenstark4"], "unionYear": 2 }, 132 | "uEddardUnknown": { "id": "uEddardUnknown", "partner": ["eddardstark1", "unknown8"], "children": ["jonsnow1"], "unionYear": 282 }, 133 | "uEddardCatelyn": { "id": "uEddardCatelyn", "partner": ["eddardstark1", "catelyntully1"], "children": ["robbstark1", "sansastark2", "aryastark1", "branstark1", "rickonstark3"], "unionYear": 283 }, 134 | }, 135 | "links": [ 136 | ["benjenstark1", "uBenjenLysa"], 137 | ["lysalocke1", "uBenjenLysa"], 138 | ["uBenjenLysa", "rickonstark1"], 139 | ["uBenjenLysa", "bennardstark1"], 140 | ["rickonstark1", "uRickonGilliane"], 141 | ["gillianeglover1", "uRickonGilliane"], 142 | ["bennardstark1", "uBennardMargaret"], 143 | ["margaretcarstark1", "uBennardMargaret"], 144 | ["uRickonGilliane", "creganstark1"], 145 | ["uBennardMargaret", "benjenstark2"], 146 | ["uBennardMargaret", "brandonstark1"], 147 | ["uBennardMargaret", "elricstark1"], 148 | ["creganstark1", "uCreganArra"], 149 | ["arranorrey1", "uCreganArra"], 150 | ["creganstark1", "uCreganAlysanne"], 151 | ["alysanneblackwood1", "uCreganAlysanne"], 152 | ["creganstark1", "uCreganLynara"], 153 | ["lynarastark1", "uCreganLynara"], 154 | ["uCreganArra", "rickonstark2"], 155 | ["uCreganAlysanne", "sarrastark1"], 156 | ["uCreganAlysanne", "alysstark1"], 157 | ["uCreganAlysanne", "rayastark1"], 158 | ["uCreganAlysanne", "mariahstark1"], 159 | ["uCreganLynara", "jonnelstark1"], 160 | ["uCreganLynara", "edricstark1"], 161 | ["uCreganLynara", "lyannastark1"], 162 | ["uCreganLynara", "barthoganstark1"], 163 | ["uCreganLynara", "brandonstark2"], 164 | ["rickonstark2", "uRickonJeyne"], 165 | ["jeynemanderly1", "uRickonJeyne"], 166 | ["uRickonJeyne", "sansastark1"], 167 | ["uRickonJeyne", "serenastark1"], 168 | ["jonnelstark1", "uJonnelStark1Inbreed"], 169 | ["sansastark1inbreed", "uJonnelStark1Inbreed"], 170 | ["uJonnelStark1Inbreed", "jonnelstark1inbreednote"], 171 | ["jonnelstark1inbreed", "uJonnelSansa"], 172 | ["sansastark1", "uJonnelSansa"], 173 | ["jonnelstark1", "uJonnelRobyn"], 174 | ["robynryswell1", "uJonnelRobyn"], 175 | ["jonumber1", "uJonSerena"], 176 | ["serenastark1", "uJonSerena"], 177 | ["edricstark1", "uEdricStark1Inbreed"], 178 | ["serenastark1inbreed", "uEdricStark1Inbreed"], 179 | ["uEdricStark1Inbreed", "edricstark1inbreednote"], 180 | ["edricstark1inbreed", "uEdricSerena"], 181 | ["serenastark1", "uEdricSerena"], 182 | ["brandonstark2", "uBrandonWylla"], 183 | ["wyllafenn1", "uBrandonWylla"], 184 | ["brandonstark2", "uBrandonAlys"], 185 | ["alyskarstark1", "uBrandonAlys"], 186 | ["uEdricSerena", "cregardstark1"], 187 | ["uEdricSerena", "torrhenstark1"], 188 | ["uEdricSerena", "arranastark1"], 189 | ["uEdricSerena", "aragellestark1"], 190 | ["uBrandonWylla", "lonnelsnow1"], 191 | ["uBrandonAlys", "rodwellstark1"], 192 | ["uBrandonAlys", "beronstark1"], 193 | ["uBrandonAlys", "arsastark1"], 194 | ["arranastark1", "uOsricArrana"], 195 | ["osricumber1", "uOsricArrana"], 196 | ["uOsricArrana", "unknown1"], 197 | ["aragellestark1", "uRobardAregelle"], 198 | ["robardcerwyn1", "uRobardAregelle"], 199 | ["uRobardAregelle", "unknown2"], 200 | ["rodwellstark1", "uRodwellMyriame"], 201 | ["myriamemanderly1", "uRodwellMyriame"], 202 | ["beronstark1", "uBeronLorra"], 203 | ["lorraroyce1", "uBeronLorra"], 204 | ["uBeronLorra", "donnorstark1"], 205 | ["uBeronLorra", "willamstark1"], 206 | ["uBeronLorra", "artosstark1"], 207 | ["uBeronLorra", "berenastark1"], 208 | ["uBeronLorra", "alysannestark1"], 209 | ["uBeronLorra", "erroldstark1"], 210 | ["uBeronLorra", "rodrikstark1"], 211 | ["willamstark1", "uWillamLyanne"], 212 | ["lyanneglover1", "uWillamLyanne"], 213 | ["uWillamLyanne", "brandonstark3"], 214 | ["willamstark1", "uWillamMelantha"], 215 | ["melanthablackwood1", "uWillamMelantha"], 216 | ["uWillamMelantha", "edwylestark1"], 217 | ["uWillamMelantha", "jocelynstark1"], 218 | ["artosstark1", "uArtosLysara"], 219 | ["lysarakarstark1", "uArtosLysara"], 220 | ["uArtosLysara", "brandonstark4"], 221 | ["uArtosLysara", "benjenstark3"], 222 | ["rodrikstark1", "uRodrikArya"], 223 | ["aryaflint1", "uRodrikArya"], 224 | ["uRodrikArya", "brandastark1"], 225 | ["uRodrikArya", "lyarrastark1"], 226 | ["edwylestark1", "uEdwyleMarna"], 227 | ["marnalocke1", "uEdwyleMarna"], 228 | ["uEdwyleMarna", "rickardstark1"], 229 | ["benedictjoyce1", "uBenedictJocelyn"], 230 | ["jocelynstark1", "uBenedictJocelyn"], 231 | ["uBenedictJocelyn", "unknown3"], 232 | ["uBenedictJocelyn", "unknown4"], 233 | ["uBenedictJocelyn", "unknown5"], 234 | ["brandonstark4", "uBrandonUnknown"], 235 | ["unknown6mother", "uBrandonUnknown"], 236 | ["uBrandonUnknown", "unknown6"], 237 | ["benjenstark3", "uBenjenUnknown"], 238 | ["unknown7mother", "uBenjenUnknown"], 239 | ["uBenjenUnknown", "unknown7"], 240 | ["harroldrogers1", "uHarroldBranda"], 241 | ["brandastark1", "uHarroldBranda"], 242 | ["rickardstark1inbreed", "uLyarraStark1Inbreed"], 243 | ["lyarrastark1", "uLyarraStark1Inbreed"], 244 | ["uLyarraStark1Inbreed", "lyarrastark1inbreednote"], 245 | ["rickardstark1", "uRickardLyarra"], 246 | ["lyarrastark1inbreed", "uRickardLyarra"], 247 | ["uRickardLyarra", "brandonstark5"], 248 | ["uRickardLyarra", "eddardstark1"], 249 | ["uRickardLyarra", "lyannastark2"], 250 | ["uRickardLyarra", "benjenstark4"], 251 | ["eddardstark1", "uEddardUnknown"], 252 | ["unknown8", "uEddardUnknown"], 253 | ["uEddardUnknown", "jonsnow1"], 254 | ["eddardstark1", "uEddardCatelyn"], 255 | ["catelyntully1", "uEddardCatelyn"], 256 | ["uEddardCatelyn", "robbstark1"], 257 | ["uEddardCatelyn", "sansastark2"], 258 | ["uEddardCatelyn", "aryastark1"], 259 | ["uEddardCatelyn", "branstark1"], 260 | ["uEddardCatelyn", "rickonstark3"], 261 | ] 262 | } -------------------------------------------------------------------------------- /data/data_simple.js: -------------------------------------------------------------------------------- 1 | data = { 2 | "start":"id4", 3 | "persons": { 4 | "id1": { "id": "id1", "name": "Adam", "birthyear": 1900, "deathyear": 1980, "own_unions": ["u1"], "birthplace":"Alberta", "deathplace":"Austin"}, 5 | "id2": { "id": "id2", "name": "Berta", "birthyear": 1901, "deathyear": 1985, "own_unions": ["u1"], "birthplace":"Berlin", "deathplace":"Bern" }, 6 | "id3": { "id": "id3", "name": "Charlene", "birthyear": 1930, "deathyear": 2010, "own_unions": ["u3", "u4"], "parent_union": "u1", "birthplace":"Château", "deathplace":"Cuxhaven" }, 7 | "id4": { "id": "id4", "name": "Dan", "birthyear": 1926, "deathyear": 2009, "own_unions": [], "parent_union": "u1", "birthplace":"den Haag", "deathplace":"Derince" }, 8 | "id5": { "id": "id5", "name": "Eric", "birthyear": 1931, "deathyear": 2015, "own_unions": ["u3"], "parent_union": "u2", "birthplace":"Essen", "deathplace":"Edinburgh" }, 9 | "id6": { "id": "id6", "name": "Francis", "birthyear": 1902, "deathyear": 1970, "own_unions": ["u2"], "birthplace":"Firenze", "deathplace":"Faizabad" }, 10 | "id7": { "id": "id7", "name": "Greta", "birthyear": 1905, "deathyear": 1990, "own_unions": ["u2"] }, 11 | "id8": { "id": "id8", "name": "Heinz", "birthyear": 1970, "own_unions": ["u5"], "parent_union": "u3" }, 12 | "id9": { "id": "id9", "name": "Iver", "birthyear": 1925, "deathyear": 1963, "own_unions": ["u4"] }, 13 | "id10": { "id": "id10", "name": "Jennifer", "birthyear": 1950, "own_unions": [], "parent_union": "u4" }, 14 | "id11": { "id": "id11", "name": "Klaus", "birthyear": 1933, "deathyear": 2013, "own_unions": [], "parent_union": "u1" }, 15 | "id12": { "id": "id12", "name": "Lennart", "birthyear": 1999, "own_unions": [], "parent_union": "u5" }, 16 | }, 17 | "unions": { 18 | "u1": { "id": "u1", "partner": ["id1", "id2"], "children": ["id3", "id4", "id11"] }, 19 | "u2": { "id": "u2", "partner": ["id6", "id7"], "children": ["id5"] }, 20 | "u3": { "id": "u3", "partner": ["id3", "id5"], "children": ["id8"] }, 21 | "u4": { "id": "u4", "partner": ["id3", "id9"], "children": ["id10"] }, 22 | "u5": { "id": "u5", "partner": ["id8"], "children": ["id12"] }, 23 | }, 24 | "links": [ 25 | ["id1", "u1"], 26 | ["id2", "u1"], 27 | ["u1", "id3"], 28 | ["u1", "id4"], 29 | ["id6", "u2"], 30 | ["id7", "u2"], 31 | ["u2", "id5"], 32 | ["id3", "u3"], 33 | ["id5", "u3"], 34 | ["u3", "id8"], 35 | ["id3", "u4"], 36 | ["id9", "u4"], 37 | ["u4", "id10"], 38 | ["u1", "id11"], 39 | ["id8", "u5"], 40 | ["u5", "id12"], 41 | ] 42 | } -------------------------------------------------------------------------------- /examples/adding_nodes.html: -------------------------------------------------------------------------------- 1 | 2 | 3 | 19 | 20 | 21 | 22 | 23 | 24 | 25 | 26 | 27 | 28 | 29 | 30 | 83 | -------------------------------------------------------------------------------- /examples/appearance_options.html: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 30 | -------------------------------------------------------------------------------- /examples/import_data.html: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 28 | -------------------------------------------------------------------------------- /examples/layout_options.html: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 29 | -------------------------------------------------------------------------------- /examples/layout_orientation.html: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 26 | -------------------------------------------------------------------------------- /familytree.html: -------------------------------------------------------------------------------- 1 | 2 | 3 | 19 | 20 | 21 | 22 | 23 | 24 | 25 | 26 | 27 | 28 | 29 | 30 | 42 | -------------------------------------------------------------------------------- /js/familytree.js: -------------------------------------------------------------------------------- 1 | // extend javascript array class by a remove function 2 | // copied from https://stackoverflow.com/a/3955096/12267732 3 | Array.prototype.remove = function() { 4 | var what, a = arguments, 5 | L = a.length, 6 | ax; 7 | while (L && this.length) { 8 | what = a[--L]; 9 | while ((ax = this.indexOf(what)) !== -1) { 10 | this.splice(ax, 1); 11 | } 12 | } 13 | return this; 14 | }; 15 | 16 | 17 | function d3_append_multiline_text(d3element, text, delimiter = "_", css_class = undefined, line_sep = 14, 18 | line_offset = undefined, x = 13, dominant_baseline = "central") { 19 | // adds a multi-line text label to a d3 element 20 | if (!text) return; 21 | const d3text = d3element.append("text") 22 | .attr("class", css_class) 23 | .attr("dominant-baseline", dominant_baseline); 24 | const arr = text.split(delimiter); 25 | if (!line_offset) { line_offset = -line_sep * (arr.length - 1) / 2; } 26 | if (arr != undefined) { 27 | for (let i = 0; i < arr.length; i++) { 28 | d3text.append("tspan") 29 | .text(arr[i]) 30 | .attr("dy", i == 0 ? line_offset : line_sep) 31 | .attr("x", x); 32 | } 33 | } 34 | }; 35 | 36 | class FTDataHandler { 37 | 38 | constructor(data, start_node_id = data.start) { 39 | 40 | // check if edge list defined 41 | if (data.links.length > 0) { 42 | 43 | // make dag from edge list 44 | this.dag = d3.dagConnect()(data.links); 45 | 46 | // dag must be a node with id undefined. fix if necessary 47 | if (this.dag.id != undefined) { 48 | this.root = this.dag.copy(); 49 | this.root.id = undefined; 50 | this.root.children = [this.dag]; 51 | this.dag = this.root; 52 | } 53 | 54 | // get all d3-dag nodes and convert to family tree nodes 55 | this.nodes = this.dag.descendants().map(node => { 56 | if (node.id in data.unions) return new Union(node, this) 57 | else if (node.id in data.persons) return new Person(node, this); 58 | }); 59 | 60 | // relink children arrays: use family tree nodes instead of d3-dag nodes 61 | this.nodes.forEach(n => n._children = n._children.map(c => c.ftnode)); 62 | 63 | // make sure each node has an id 64 | this.number_nodes = 0; 65 | this.nodes.forEach(node => { 66 | node.id = node.id || this.number_nodes; 67 | this.number_nodes++; 68 | }) 69 | 70 | // set root node 71 | this.root = this.find_node_by_id(start_node_id); 72 | this.root.visible = true; 73 | this.dag.children = [this.root]; 74 | 75 | } 76 | // if no edges but only nodes are defined: root = dag 77 | else if (Object.values(data.persons).length > 0) { 78 | 79 | const root_data = data.persons[start_node_id]; 80 | this.root = new d3.dagNode(start_node_id, root_data); 81 | this.root = new Person(this.root, this); 82 | this.root.visible = true; 83 | this.number_nodes = 1; 84 | this.nodes = [this.root]; 85 | 86 | // dag must be a node with id undefined 87 | this.dag = new d3.dagNode(undefined, {}); 88 | this.dag.children = this.root; 89 | } 90 | }; 91 | 92 | update_roots() { 93 | this.dag.children = [this.root]; 94 | const FT = this; 95 | 96 | function find_roots_recursive(node) { 97 | node.get_visible_inserted_neighbors().forEach(node => { 98 | if (node.is_root()) FT.dag.children.push(node); 99 | find_roots_recursive(node); 100 | }); 101 | }; 102 | find_roots_recursive(this.root); 103 | }; 104 | 105 | find_node_by_id(id) { 106 | return this.nodes.find(node => node.id == id); 107 | }; 108 | 109 | }; 110 | 111 | class FTNode extends d3.dagNode { 112 | 113 | is_extendable() { 114 | return this.get_neighbors().filter(node => !node.visible).length > 0; 115 | }; 116 | 117 | get_visible_neighbors() { 118 | return this.get_neighbors().filter(node => node.visible); 119 | } 120 | 121 | get_visible_inserted_neighbors() { 122 | return this.get_visible_neighbors().filter(node => this.inserted_nodes.includes(node)); 123 | }; 124 | 125 | }; 126 | 127 | class Union extends FTNode { 128 | 129 | constructor(dagNode, ft_datahandler) { 130 | super(dagNode.id, data.unions[dagNode.id]); 131 | // link to new object 132 | dagNode.ftnode = this; 133 | // define additional family tree properties 134 | this.ft_datahandler = ft_datahandler; 135 | this._children = dagNode.children; 136 | this.children = []; 137 | this._childLinkData = dagNode._childLinkData; 138 | this.inserted_nodes = []; 139 | this.inserted_links = []; 140 | this.visible = false; 141 | }; 142 | 143 | get_neighbors() { 144 | return this.get_parents().concat(this.get_children()) 145 | }; 146 | 147 | get_parents() { 148 | var parents = this.data.partner 149 | .map(id => this.ft_datahandler.find_node_by_id(id)) 150 | .filter(node => node != undefined); 151 | if (parents) return parents 152 | else return []; 153 | } 154 | 155 | get_hidden_parents() { 156 | return this.get_parents().filter(parent => !parent.visible); 157 | }; 158 | 159 | get_visible_parents() { 160 | return this.get_parents().filter(parent => parent.visible); 161 | }; 162 | 163 | get_children() { 164 | var children = []; 165 | children = this.children.concat(this._children); 166 | // sort children by birth year, filter undefined 167 | children = children 168 | .filter(c => c != undefined) 169 | // .sort((a, b) => Math.sign((getBirthYear(a) || 0) - (getBirthYear(b) || 0))); 170 | return children 171 | }; 172 | 173 | get_hidden_children() { 174 | return this.get_children().filter(child => !child.visible); 175 | }; 176 | 177 | get_visible_children() { 178 | return this.get_children().filter(child => child.visible); 179 | }; 180 | 181 | show_child(child) { 182 | if (!this._children.includes(child)) { 183 | console.warn("Child node not in this' _children array."); 184 | } 185 | this.children.push(child); 186 | this._children.remove(child); 187 | // if child is already visible, note a connection to destroy it later 188 | if (child.visible) { 189 | this.inserted_links.push([this, child]); 190 | } 191 | // if child is hidden, show it 192 | else { 193 | child.visible = true; 194 | this.inserted_nodes.push(child); 195 | // downstream part of the family tree is automatically reconstructed because children attribute 196 | // is not reset when hiding 197 | 198 | } 199 | }; 200 | 201 | show_parent(parent) { 202 | if (!parent._children.includes(this)) { 203 | console.warn("This node not in parent's _children array."); 204 | } 205 | parent.children.push(this); 206 | parent._children.remove(this); 207 | // if parent is already visible, note a connection to destroy it later 208 | if (parent.visible) { 209 | this.inserted_links.push([parent, this]); 210 | } 211 | // if parent is hidden, show it 212 | else { 213 | parent.visible = true; 214 | this.inserted_nodes.push(parent); 215 | } 216 | }; 217 | 218 | show() { 219 | 220 | this.visible = true; 221 | 222 | // show neighboring children 223 | this.get_children().forEach(child => { 224 | this.show_child(child); 225 | }); 226 | 227 | // show neighboring parents 228 | this.get_parents().forEach(parent => { 229 | this.show_parent(parent); 230 | }); 231 | 232 | }; 233 | 234 | get_visible_inserted_children() { 235 | return this.children.filter(child => this.inserted_nodes.includes(child)); 236 | }; 237 | 238 | get_visible_inserted_parents() { 239 | return this.get_visible_parents().filter(parent => this.inserted_nodes.includes(parent)); 240 | }; 241 | 242 | is_root() { 243 | return false; 244 | } 245 | 246 | hide_child(child) { 247 | if (!this.children.includes(child)) { 248 | console.warn("Child node not in this's children array."); 249 | } 250 | child.visible = false; 251 | this._children.push(child); 252 | this.children.remove(child); 253 | this.inserted_nodes.remove(child); 254 | }; 255 | 256 | hide_parent(parent) { 257 | if (!parent.children.includes(this)) { 258 | console.warn("This node not in parent's children array."); 259 | } 260 | parent.visible = false; 261 | parent._children.push(this); 262 | parent.children.remove(this); 263 | this.inserted_nodes.remove(parent); 264 | }; 265 | 266 | hide() { 267 | 268 | this.visible = false; 269 | 270 | // hide neighboring children, if inserted by this node 271 | this.get_visible_inserted_children().forEach(child => { 272 | this.hide_child(child); 273 | }); 274 | 275 | // hide neighboring parents, if inserted by this node 276 | this.get_visible_inserted_parents().forEach(parent => { 277 | this.hide_parent(parent); 278 | }); 279 | 280 | // hide only edge (not node) if not inserted by this node 281 | this.inserted_links.forEach(edge => { 282 | const source = edge[0]; 283 | const target = edge[1]; 284 | if (this == source) { 285 | this._children.push(target); 286 | this.children.remove(target); 287 | } else if (this == target) { 288 | source._children.push(this); 289 | source.children.remove(this); 290 | }; 291 | }); 292 | this.inserted_links = []; 293 | 294 | }; 295 | 296 | get_own_unions() { 297 | return []; 298 | }; 299 | 300 | get_parent_unions() { 301 | return []; 302 | }; 303 | 304 | get_name() { 305 | return undefined; 306 | }; 307 | 308 | get_birth_year() { 309 | return undefined; 310 | }; 311 | 312 | get_birth_place() { 313 | return undefined; 314 | }; 315 | 316 | get_death_year() { 317 | return undefined; 318 | }; 319 | 320 | get_death_place() { 321 | return undefined; 322 | }; 323 | 324 | is_union() { 325 | return true; 326 | }; 327 | 328 | add_parent(person_data) { 329 | // make person object 330 | const id = person_data.id || "p" + ++this.ft_datahandler.number_nodes; 331 | const dagNode = new d3.dagNode(id, person_data); 332 | const person = new Person(dagNode, this.ft_datahandler); 333 | if (!("parent_union" in person_data)) person_data.parent_union = undefined; 334 | if (!("own_unions" in person_data)) { 335 | person_data.own_unions = [this.id]; 336 | person._childLinkData = [ 337 | [person.id, this.id] 338 | ]; 339 | person._children.push(this); 340 | } 341 | person.data = person_data; 342 | this.ft_datahandler.nodes.push(person); 343 | // make sure person lists this union as an own union 344 | if (!person_data.own_unions.includes(this.id)) person_data.own_unions.push(this.id); 345 | // make sure this union lists person as parent 346 | if (!this.data.partner.includes(person.id)) this.data.partner.push(person.id); 347 | // make union visible 348 | this.show_parent(person); 349 | this.ft_datahandler.update_roots(); 350 | return person; 351 | }; 352 | 353 | add_child(person_data) { 354 | // make person object 355 | const id = person_data.id || "p" + ++this.ft_datahandler.number_nodes; 356 | const dagNode = new d3.dagNode(id, person_data); 357 | const person = new Person(dagNode, this.ft_datahandler); 358 | if (!("parent_union" in person_data)) person_data.parent_union = this.id; 359 | if (!("own_unions" in person_data)) person_data.own_unions = []; 360 | person.data = person_data; 361 | this.ft_datahandler.nodes.push(person); 362 | // make sure person lists this union as an parent union 363 | if (!person_data.parent_union == this.id) person_data.parent_union == this.id; 364 | // make sure this union lists person as child 365 | if (!this.data.children.includes(person.id)) this.data.children.push(person.id); 366 | if (!this._childLinkData.includes([this.id, person.id])) this._childLinkData.push([this.id, person.id]); 367 | // make union visible 368 | this.show_child(person); 369 | return person; 370 | } 371 | 372 | }; 373 | 374 | class Person extends FTNode { 375 | 376 | constructor(dagNode, ft_datahandler) { 377 | super(dagNode.id, data.persons[dagNode.id]); 378 | // link to new object 379 | dagNode.ftnode = this; 380 | // define additional family tree properties 381 | this.ft_datahandler = ft_datahandler; 382 | this._children = dagNode.children; 383 | this.children = []; 384 | this._childLinkData = dagNode._childLinkData; 385 | this.inserted_nodes = []; 386 | this.inserted_links = []; 387 | this.visible = false; 388 | }; 389 | 390 | get_name() { 391 | return this.data.name; 392 | }; 393 | 394 | get_birth_year() { 395 | return this.data.birthyear; 396 | }; 397 | 398 | get_birth_place() { 399 | return this.data.birthplace; 400 | }; 401 | 402 | get_death_year() { 403 | return this.data.deathyear; 404 | }; 405 | 406 | get_death_place() { 407 | return this.data.deathplace; 408 | }; 409 | 410 | get_neighbors() { 411 | return this.get_own_unions().concat(this.get_parent_unions()); 412 | }; 413 | 414 | get_parent_unions() { 415 | var unions = [this.data.parent_union] 416 | .map(id => this.ft_datahandler.find_node_by_id(id)) 417 | .filter(node => node != undefined); 418 | var u_id = this.data.parent_union; 419 | if (unions) return unions 420 | else return []; 421 | }; 422 | 423 | get_hidden_parent_unions() { 424 | return this.get_parent_unions().filter(union => !union.visible); 425 | }; 426 | 427 | get_visible_parent_unions() { 428 | return this.get_parent_unions().filter(union => union.visible); 429 | }; 430 | 431 | get_visible_inserted_parent_unions() { 432 | return this.get_visible_parent_unions().filter(union => this.inserted_nodes.includes(union)); 433 | }; 434 | 435 | is_root() { 436 | return this.get_visible_parent_unions().length == 0; 437 | }; 438 | 439 | is_union() { 440 | return false; 441 | }; 442 | 443 | get_own_unions() { 444 | var unions = (this.data.own_unions ?? []) 445 | .map(id => this.ft_datahandler.find_node_by_id(id)) 446 | .filter(u => u != undefined); 447 | if (unions) return unions 448 | else return []; 449 | }; 450 | 451 | get_hidden_own_unions() { 452 | return this.get_own_unions().filter(union => !union.visible); 453 | }; 454 | 455 | get_visible_own_unions() { 456 | return this.get_own_unions().filter(union => union.visible); 457 | }; 458 | 459 | get_visible_inserted_own_unions() { 460 | return this.get_visible_own_unions().filter(union => this.inserted_nodes.includes(union)); 461 | }; 462 | 463 | get_parents() { 464 | var parents = []; 465 | this.get_parent_unions().forEach( 466 | u => parents = parents.concat(u.get_parents()) 467 | ); 468 | }; 469 | 470 | get_other_partner(union_data) { 471 | var partner_id = union_data.partner.find( 472 | p_id => p_id != this.id & p_id != undefined 473 | ); 474 | return all_nodes.find(n => n.id == partner_id) 475 | }; 476 | 477 | get_partners() { 478 | var partners = []; 479 | this.get_own_unions().forEach( 480 | u => { 481 | partners.push(this.get_other_partner(u.data)) 482 | } 483 | ) 484 | return partners.filter(p => p != undefined) 485 | }; 486 | 487 | get_children() { 488 | var children = []; 489 | this.get_own_unions().forEach( 490 | u => children = children.concat(getChildren(u)) 491 | ) 492 | // sort children by birth year, filter undefined 493 | children = children 494 | .filter(c => c != undefined) 495 | // .sort((a, b) => Math.sign((getBirthYear(a) || 0) - (getBirthYear(b) || 0))); 496 | return children 497 | }; 498 | 499 | show_union(union) { 500 | union.show(); 501 | this.inserted_nodes.push(union); 502 | }; 503 | 504 | hide_own_union(union) { 505 | union.hide(); 506 | this.inserted_nodes.remove(union); 507 | }; 508 | 509 | hide_parent_union(union) { 510 | union.hide(); 511 | }; 512 | 513 | show() { 514 | this.get_hidden_own_unions().forEach(union => this.show_union(union)); 515 | this.get_hidden_parent_unions().forEach(union => this.show_union(union)); 516 | }; 517 | 518 | hide() { 519 | this.get_visible_inserted_own_unions().forEach(union => this.hide_own_union(union)); 520 | this.get_visible_inserted_parent_unions().forEach(union => this.hide_parent_union(union)); 521 | }; 522 | 523 | click() { 524 | // extend if there are uncollapsed neighbor unions 525 | if (this.is_extendable()) this.show(); 526 | // collapse if fully extended 527 | else this.hide(); 528 | // update dag roots 529 | this.ft_datahandler.update_roots(); 530 | }; 531 | 532 | add_own_union(union_data) { 533 | // make union object 534 | const id = union_data.id || "u" + ++this.ft_datahandler.number_nodes; 535 | const dagNode = new d3.dagNode(id, union_data); 536 | const union = new Union(dagNode, this.ft_datahandler); 537 | if (!("partner" in union_data)) union_data.partner = [this.id]; 538 | if (!("children" in union_data)) { 539 | union_data.children = []; 540 | union._childLinkData = []; 541 | } 542 | union.data = union_data; 543 | this.ft_datahandler.nodes.push(union); 544 | // make sure union lists this person as a partner 545 | if (!union_data.partner.includes(this.id)) union_data.partner.push(this.id); 546 | // make sure this person lists union as own_union 547 | if (!this.data.own_unions.includes(union.id)) this.data.own_unions.push(union.id); 548 | if (!this._childLinkData.includes([this.id, union.id])) this._childLinkData.push([this.id, union.id]); 549 | // make union visible 550 | this.show_union(union); 551 | return union; 552 | }; 553 | 554 | add_parent_union(union_data) { 555 | // make union object 556 | const id = union_data.id || "u" + ++this.ft_datahandler.number_nodes; 557 | const dagNode = new d3.dagNode(id, union_data); 558 | const union = new Union(dagNode, this.ft_datahandler); 559 | if (!("partner" in union_data)) union_data.partner = []; 560 | if (!("children" in union_data)) { 561 | union_data.children = [this.id]; 562 | union._childLinkData = [ 563 | [union.id, this.id] 564 | ]; 565 | union._children.push(this); 566 | } 567 | union.data = union_data; 568 | this.ft_datahandler.nodes.push(union); 569 | // make sure union lists this person as a child 570 | if (!union_data.children.includes(this.id)) union_data.children.push(this.id); 571 | // make sure this person lists union as own_union 572 | this.data.parent_union = union.id; 573 | // make union visible 574 | this.show_union(union); 575 | this.ft_datahandler.update_roots(); 576 | return union; 577 | }; 578 | 579 | }; 580 | 581 | class FTDrawer { 582 | 583 | static label_delimiter = "_"; 584 | 585 | constructor( 586 | ft_datahandler, 587 | svg, 588 | x0, 589 | y0, 590 | ) { 591 | this.ft_datahandler = ft_datahandler; 592 | this.svg = svg; 593 | this._orientation = null; 594 | this.link_css_class = "link"; 595 | 596 | // append group element to draw family tree in 597 | this.g = this.svg.append("g"); 598 | 599 | // initialize panning, zooming 600 | this.zoom = d3.zoom().on("zoom", event => this.g.attr("transform", event.transform)); 601 | this.svg.call(this.zoom); 602 | 603 | // initialize tooltips 604 | this._tooltip_div = d3.select("body").append("div") 605 | .attr("class", "tooltip") 606 | .style("opacity", 0) 607 | .style("visibility", "hidden"); 608 | this.tooltip(FTDrawer.default_tooltip_func); 609 | 610 | // initialize dag layout maker 611 | this.layout = d3.sugiyama() 612 | .nodeSize([120, 120]) 613 | .layering(d3.layeringSimplex()) 614 | .decross(d3.decrossOpt) 615 | .coord(d3.coordVert()); 616 | 617 | // defaults 618 | this.orientation("horizontal"); 619 | this.transition_duration(750); 620 | this.link_path(FTDrawer.default_link_path_func); 621 | this.node_label(FTDrawer.default_node_label_func); 622 | this.node_size(FTDrawer.default_node_size_func); 623 | this.node_class(FTDrawer.default_node_class_func); 624 | 625 | // set starting position for root node 626 | const default_pos = this.default_root_position(); 627 | this.ft_datahandler.root.x0 = x0 || default_pos[0]; 628 | this.ft_datahandler.root.y0 = y0 || default_pos[1]; 629 | }; 630 | 631 | default_root_position() { 632 | return [ 633 | this.svg.attr("width") / 2, 634 | this.svg.attr("height") / 2 635 | ]; 636 | } 637 | 638 | orientation(value) { 639 | // getter/setter for tree orientation (horizontal/vertical) 640 | if (!value) return this.orientation; 641 | else { 642 | this._orientation = value; 643 | return this; 644 | } 645 | }; 646 | 647 | node_separation(value) { 648 | // getter/setter for separation of nodes in x and y direction (see d3-dag documentation) 649 | if (!value) return this.layout.nodeSize(); 650 | else { 651 | this.layout.nodeSize(value); 652 | return this; 653 | } 654 | }; 655 | 656 | layering(value) { 657 | // getter/setter for layout operator (see d3-dag documentation) 658 | if (!value) return this.layout.layering(); 659 | else { 660 | this.layout.layering(value); 661 | return this; 662 | } 663 | }; 664 | 665 | decross(value) { 666 | // getter/setter for descross operator (see d3-dag documentation) 667 | if (!value) return this.layout.decross(); 668 | else { 669 | this.layout.decross(value); 670 | return this; 671 | } 672 | }; 673 | 674 | coord(value) { 675 | // getter/setter for coordinate operator (see d3-dag documentation) 676 | if (!value) return this.layout.coord(); 677 | else { 678 | this.layout.coord(value); 679 | return this; 680 | } 681 | }; 682 | 683 | transition_duration(value) { 684 | // getter/setter for animation transition duration 685 | if (value != 0 & !value) return this._transition_duration; 686 | else { 687 | this._transition_duration = value; 688 | return this; 689 | } 690 | }; 691 | 692 | static default_tooltip_func(node) { 693 | if (node.is_union()) return; 694 | var content = ` 695 | ` + node.get_name() + `
696 | 697 | 698 | 699 |
born` + (node.get_birth_year() || "?") + ` in ` + (node.data.birthplace || "?") + `
died` + (node.get_death_year() || "?") + ` in ` + (node.data.deathplace || "?") + `
700 | ` 701 | return content.replace(new RegExp("null", "g"), "?"); 702 | }; 703 | 704 | tooltip(tooltip_func) { 705 | // setter for tooltips 706 | if (!tooltip_func) { 707 | this.show_tooltips = false; 708 | } else { 709 | this.show_tooltips = true; 710 | this._tooltip_func = tooltip_func; 711 | } 712 | return this; 713 | }; 714 | 715 | static default_node_label_func(node) { 716 | // node label function 717 | // text will be split into multiple lines where `label_delimiter` is used 718 | if (node.is_union()) return; 719 | return node.get_name() + 720 | FTDrawer.label_delimiter + 721 | (node.get_birth_year() || "?") + " - " + (node.get_death_year() || "?"); 722 | }; 723 | 724 | node_label(node_label_func) { 725 | // setter for node labels 726 | if (!node_label_func) {} else { this.node_label_func = node_label_func }; 727 | return this; 728 | }; 729 | 730 | static default_node_class_func(node) { 731 | // returns a node's css classes as a string 732 | if (node.is_union()) return; 733 | else { 734 | if (node.is_extendable()) return "person extendable" 735 | else return "person non-extendable" 736 | }; 737 | }; 738 | 739 | node_class(node_class_func) { 740 | // setter for node css class function 741 | if (!node_class_func) {} else { this.node_class_func = node_class_func }; 742 | return this; 743 | }; 744 | 745 | static default_node_size_func(node) { 746 | // returns an integer determining the node's size 747 | if (node.is_union()) return 0; 748 | else return 10; 749 | } 750 | 751 | node_size(node_size_func) { 752 | // setter for node size function 753 | if (!node_size_func) {} else { this.node_size_func = node_size_func }; 754 | return this; 755 | }; 756 | 757 | static default_link_path_func(s, d) { 758 | function vertical_s_bend(s, d) { 759 | // Creates a diagonal curve fit for vertically oriented trees 760 | return `M ${s.x} ${s.y} 761 | C ${s.x} ${(s.y + d.y) / 2}, 762 | ${d.x} ${(s.y + d.y) / 2}, 763 | ${d.x} ${d.y}` 764 | } 765 | 766 | function horizontal_s_bend(s, d) { 767 | // Creates a diagonal curve fit for horizontally oriented trees 768 | return `M ${s.x} ${s.y} 769 | C ${(s.x + d.x) / 2} ${s.y}, 770 | ${(s.x + d.x) / 2} ${d.y}, 771 | ${d.x} ${d.y}` 772 | } 773 | return this._orientation == "vertical" ? vertical_s_bend(s, d) : horizontal_s_bend(s, d); 774 | } 775 | 776 | link_path(link_path_func) { 777 | // setter for link path function 778 | if (!link_path_func) {} else { this.link_path_func = link_path_func }; 779 | return this; 780 | } 781 | 782 | static make_unique_link_id(link) { 783 | return link.id || link.source.id + "_" + link.target.id; 784 | } 785 | 786 | draw(source = this.ft_datahandler.root) { 787 | 788 | // get visible nodes and links 789 | const nodes = this.ft_datahandler.dag.descendants(), 790 | links = this.ft_datahandler.dag.links(); 791 | 792 | // assign new x and y positions to all nodes 793 | this.layout(this.ft_datahandler.dag); 794 | 795 | // switch x and y coordinates if orientation = "horizontal" 796 | if (this._orientation == "horizontal") { 797 | var buffer = null; 798 | nodes.forEach(function(d) { 799 | buffer = d.x 800 | d.x = d.y; 801 | d.y = buffer; 802 | }); 803 | } 804 | 805 | // ****************** Nodes section *************************** 806 | 807 | // assign node data 808 | var node = this.g.selectAll('g.node') 809 | .data(nodes, node => node.id) 810 | 811 | // insert new nodes at the parent's previous position. 812 | var nodeEnter = node.enter().append('g') 813 | .attr('class', 'node') 814 | .attr("transform", _ => "translate(" + source.x0 + "," + source.y0 + ")") 815 | .on('click', (_, node) => { 816 | node.click(); 817 | this.draw(node); 818 | }) 819 | .attr('visible', true); 820 | 821 | // add tooltip 822 | if (this.show_tooltips) { 823 | const tooltip_div = this._tooltip_div, 824 | tooltip_func = this._tooltip_func; 825 | nodeEnter 826 | .on("mouseover", function (event, d) { 827 | tooltip_div.transition() 828 | .duration(200) 829 | .style("opacity", 1) 830 | .transition() 831 | .style("visibility", undefined); 832 | tooltip_div.html(tooltip_func(d)); 833 | let height = tooltip_div.node().getBoundingClientRect().height; 834 | tooltip_div.style("left", (event.pageX + 10) + "px") 835 | .style("top", (event.pageY-height/2) + "px"); 836 | }) 837 | .on("mouseout", function (d) { 838 | tooltip_div.transition() 839 | .duration(500) 840 | .style("opacity", 0) 841 | .transition() 842 | .style("visibility", "hidden"); 843 | }); 844 | }; 845 | 846 | // add a circle for each node 847 | nodeEnter.append('circle') 848 | .attr('class', this.node_class_func) 849 | .attr('r', 1e-6) 850 | 851 | // add node label 852 | const this_object = this; 853 | nodeEnter.each(function(node) { 854 | d3_append_multiline_text( 855 | d3.select(this), 856 | this_object.node_label_func(node), 857 | FTDrawer.label_delimiter, 858 | "node-label", 859 | ) 860 | }); 861 | 862 | // UPDATE 863 | var nodeUpdate = nodeEnter.merge(node); 864 | 865 | // transition node to final coordinates 866 | nodeUpdate.transition() 867 | .duration(this.transition_duration()) 868 | .attr("transform", d => "translate(" + d.x + "," + d.y + ")"); 869 | 870 | // update node style 871 | nodeUpdate.select('.node circle') 872 | .attr('r', this.node_size_func) 873 | .attr('class', this.node_class_func) 874 | .attr('cursor', 'pointer'); 875 | 876 | // remove hidden nodes 877 | var nodeExit = node.exit().transition() 878 | .duration(this.transition_duration()) 879 | .attr("transform", _ => "translate(" + source.x + "," + source.y + ")") 880 | .attr('visible', false) 881 | .remove(); 882 | 883 | // animation: shrink hidden nodes 884 | nodeExit.select('circle') 885 | .attr('r', 1e-6); 886 | 887 | // animation: hide hidden nodes' labels 888 | nodeExit.select('text') 889 | .style('fill-opacity', 1e-6); 890 | 891 | // ****************** links section *************************** 892 | 893 | // Update the links... 894 | var link = this.g.selectAll('path.' + this.link_css_class) 895 | .data(links, FTDrawer.make_unique_link_id); 896 | 897 | // Enter any new links at the parent's previous position. 898 | var linkEnter = link.enter().insert('path', "g") 899 | .attr("class", this.link_css_class) 900 | .attr('d', _ => { 901 | var o = { 902 | x: source.x0, 903 | y: source.y0 904 | } 905 | return this.link_path_func(o, o) 906 | }); 907 | 908 | // UPDATE 909 | var linkUpdate = linkEnter.merge(link); 910 | 911 | // Transition back to the parent element position 912 | linkUpdate.transition() 913 | .duration(this.transition_duration()) 914 | .attr('d', d => this.link_path_func(d.source, d.target)); 915 | 916 | // Remove any exiting links 917 | var linkExit = link.exit().transition() 918 | .duration(this.transition_duration()) 919 | .attr('d', _ => { 920 | var o = { 921 | x: source.x, 922 | y: source.y 923 | } 924 | return this.link_path_func(o, o) 925 | }) 926 | .remove(); 927 | 928 | // expanding a big subgraph moves the entire dag out of the screen 929 | // to prevent this, cancel any transformations in y-direction 930 | this.svg.transition() 931 | .duration(this.transition_duration()) 932 | .call( 933 | this.zoom.transform, 934 | d3.zoomTransform(this.g.node()).translate(-(source.x - source.x0), -(source.y - source.y0)), 935 | ); 936 | 937 | // store current node positions for next transition 938 | nodes.forEach(function(d) { 939 | d.x0 = d.x; 940 | d.y0 = d.y; 941 | }); 942 | 943 | }; 944 | 945 | clear() { 946 | this.g.selectAll("*").remove(); 947 | } 948 | }; 949 | 950 | class FamilyTree extends FTDrawer { 951 | 952 | constructor(data, svg) { 953 | const ft_datahandler = new FTDataHandler(data); 954 | super(ft_datahandler, svg); 955 | }; 956 | 957 | get root() { 958 | return this.ft_datahandler.root; 959 | } 960 | 961 | wait_until_data_loaded(old_data, delay, tries, max_tries) { 962 | if (tries == max_tries) { 963 | return; 964 | } else { 965 | const new_data = window.data; 966 | if (old_data == new_data) { 967 | setTimeout( 968 | _ => this.wait_until_data_loaded(old_data, delay, ++tries, max_tries), 969 | delay, 970 | ) 971 | } else { 972 | this.draw_data(new_data); 973 | return; 974 | } 975 | } 976 | } 977 | 978 | draw_data(data) { 979 | var x0 = null, 980 | y0 = null; 981 | if (this.root !== null) { 982 | [x0, y0] = [this.root.x0, this.root.y0]; 983 | } else { 984 | [x0, y0] = this.default_root_position(); 985 | } 986 | this.ft_datahandler = new FTDataHandler(data); 987 | this.root.x0 = x0; 988 | this.root.y0 = y0; 989 | this.clear(); 990 | this.draw(); 991 | } 992 | 993 | load_data(path_to_data) { 994 | const old_data = data, 995 | max_tries = 5, 996 | delay = 1000, 997 | file = document.createElement('script'); 998 | var tries = 0; 999 | file.onreadystatechange = function() { 1000 | if (this.readyState == 'complete') { 1001 | this.wait_until_data_loaded(old_data, delay, tries, max_tries); 1002 | } 1003 | } 1004 | file.onload = this.wait_until_data_loaded(old_data, delay, tries, max_tries); 1005 | file.type = "text/javascript"; 1006 | file.src = path_to_data; 1007 | document.getElementsByTagName("head")[0].appendChild(file) 1008 | } 1009 | 1010 | }; --------------------------------------------------------------------------------