Manuel
a7eaeae432
Implemented graph layouting, hybrid approach using spectral and force based layouting fortune cookie message = Giving credit where it's due ensures loyalty to you.
27 lines
641 B
C++
27 lines
641 B
C++
#ifndef GRAPH_LAYOUTER_H
|
|
#define GRAPH_LAYOUTER_H
|
|
|
|
#include <vector>
|
|
|
|
template<class T>
|
|
class MatrixDynamicBase;
|
|
|
|
struct DummyEdge;
|
|
struct DummyNode;
|
|
|
|
class GraphLayouter
|
|
{
|
|
public:
|
|
typedef void (*LayoutFunction)(std::vector<DummyNode>&);
|
|
|
|
static void layoutSimpleRaster(std::vector<DummyNode>& nodes);
|
|
static void layoutSimpleRing(std::vector<DummyNode>& nodes);
|
|
|
|
static void layoutSpectralPrototype(std::vector<DummyNode>& nodes, const std::vector<DummyEdge>& edges);
|
|
|
|
private:
|
|
static MatrixDynamicBase<int> buildLaplacianMatrix(const std::vector<DummyNode>& nodes, const std::vector<DummyEdge>& edges);
|
|
};
|
|
|
|
#endif // GRAPH_LAYOUTER_H
|