Figure 8 - uploaded by Cristian Frasinaru
Content may be subject to copyright.
Download
View publication
Memory requirement of labeled complete graphs having user objects associated with both vertices and edges (left) and complete weighted graphs, having weights associated with their edges (right).

Memory requirement of labeled complete graphs having user objects associated with both vertices and edges (left) and complete weighted graphs, having weights associated with their edges (right).

Source publication
Figure 2: The flow of solving an object-oriented graph related problem.
Figure 4: Support data structures representing collections of vertices...
Figure 8: Memory requirement of labeled complete graphs having user...
Figure 10: Time required by operations that inspect a graph: iterating...
+2 Figure 14: The running times and the additional memory required by...
Graph4J -- A computationally efficient Java library for graph algorithms
Preprint
Full-text available
  • Aug 2023
Graph algorithms play an important role in many computer science areas. In order to solve problems that can be modeled using graphs, it is necessary to use a data structure that can represent those graphs in an efficient manner. On top of this, an infrastructure should be build that will assist in implementing common algorithms or developing specia...
Cite
Download full-text

Contexts in source publication

Context 1
... the following test (Figure 8) we create, on one hand (left), complete graphs starting from objects of type City and Road (vertices are cities and edges are roads). On the right, we associate weights to all edges of a complete graph. ...
Context 2
... the following test (Figure 8) we create, on one hand (left), complete graphs starting from objects of type City and Road (vertices are cities and edges are roads). On the right, we associate weights to all edges of a complete graph. ...