XC Open source finite element analysis program
|
Classes | |
class | XC::ArrayGraph |
Array de grafos. More... | |
class | XC::ArrayVertexIter |
ArrayVertexIter is an iter for returning the vertices of an object of class ArrayGraph. ArrayVertexIter must be written for each subclass of ArrayGraph: wherin the vertices are stored differently to that in ArrayGraph. More... | |
class | XC::DOF_Graph |
Degrees of freedom graph. More... | |
class | XC::DOF_GroupGraph |
Degrees of freedom group. More... | |
class | XC::FE_VertexIter |
Iterador over the vertices of the graph. More... | |
class | XC::Graph |
The Graph class provides the abstraction of a graph, a collection of vertices and edges. The Graph class is a container class which stores and provides access to Vertex objects. The Vertices contain information about the edges in this design. More... | |
class | XC::ModelGraph |
Base class for model graph. More... | |
class | XC::Vertex |
Vertex of a graph. More... | |
class | XC::VertexIter |
Iterator over the vertices of the graph. More... | |
class | XC::BaseNumberer |
Base class for DOF numberers. More... | |
class | XC::GraphNumberer |
Numberer for problem's degrees of freedom. More... | |
class | XC::Metis |
type of GraphPartitioner which uses 'METIS - Unstructured Graph Partitioning And Sparse Matrix Ordering System', developed by G. Karypis and V. Kumar at the University of Minnesota. The metis files are found in metis-2.0 which were downloaded. More... | |
class | XC::MyRCM |
Class which performs the Reverse Cuthill-McKee numbering scheme on the vertices of a graph. This is done by invoking the number() method with the Graph to be numbered. More... | |
class | XC::RCM |
Class designed to perform the Reverse Cuthill-McKee numbering scheme on the vertices of a graph. This is done by invoking the number() method with the Graph to be numbered. More... | |
class | XC::SimpleNumberer |
Triviel DOF numberer. More... | |
class | XC::GraphPartitioner |
GraphPartitioner is an abstract base class. Its subtypes are responsible for partioning the vertices of a graph. The partitioning is done in the method partition which sets the colors of the vertices of the graph to colors 1 through numParrtitions. More... | |