The elements are processed in a case-sensitive manner (so lowercase and uppercase are seen as two different elements)! The input lists will be processed and made non-redundant (= duplicated elements in each list will be removed such that only one remains). The lists can contain only a single element on each line, but there is no limit on the number of lines. HOW?Enter files (in plain text format!) with a list of elements and/or copy-paste lists in the appropriate fields. The graphical output is produced in SVG and PNG format.ĭownloading the figure in SVG format will allow you to further customise it with SVG compatible software such as for instance InkScape (which is freeware).
You have the choice between symmetric (default) or non symmetric venn diagrams.Ĭurrently you are able to calculate the intersections of at maximum 30 lists.
If the number of lists is lower than 7 it will also produce a graphical output in the form of a venn/Euler diagram. It will generate a textual output indicating which elements are in each intersection or are unique to a certain list. WHAT?With this tool you can calculate the intersection(s) of list of elements.
0 kommentar(er)
