Editor and Generator for Graphs2.0 - Download
You'll be able to download in few seconds.
External Download
We do not host Editor and Generator for Graphs on our servers. We did not scan it for viruses, adware, spyware or other type of malware. This app is hosted by the software publisher and passed their terms and conditions to be listed there. We recommend caution when installing it.
The external download link for Editor and Generator for Graphs is provided to you by soft112.com without any warranties, representations or guarantees of any kind, so access it at your own risk.
If you have questions regarding this particular app contact the publisher directly. For questions about the functionalities of soft112.com contact us.
Publisher Description
The EGG v2.0 programs package proposes to offer an easy to use environment for drawing graphs, directed or undirected, with relatively big dimensions, thousands of vertices and edges. A number of graph theory specific concepts, some frequently used algorithms and characteristic data structures can be visualized during the investigation process or can be used for illustrating certain themes, presentations, lessons and lectures to pupils and students.
The EGG application offers standard editing features like adding and placing vertices, defining edges or arcs, with the possibility of editing and deleting them. Mechanisms of copy/paste type complete the set of direct edit features. A series of information, like costs and/or labels associated to edges and vertices can be visualized in the program's graphical space. EGG offers and specific editing features like: transforming a subgraph of the current graph into a clique, stable set, star, path, cycle, complement or other known structures. For a subgraph there can also be obtained a clone (perfect copy), a twin (a copy that keeps the connections with the complementary graph) and the collapse (replacement of the subgraph with a single vertex with the keeping of the adjacencies). Furthermore, EGG offers a process which random generates vertices and edges, obtaining some graphs samples.
The data structure used permits a large set of information retrievals like: the construction of adjacency and edges-vertices incidence matrices, vertices and edges search, the search for minimum length or cost paths, the generation of DFS or BFS tree, the detection of minimum or maximum spanning tree, the detection of connected and strong connected components.
