#include "../include/lattice.h"
#include "../include/node.h"
#include "../include/edge.h"
#include <iostream>
#include <vector>
#include <algorithm>
#include <iterator>
Go to the source code of this file.
◆ NUM_VORT
◆ main()
Definition at line 20 of file graphtest.cc.
References a, mpi_vis::i, ii, l, mat, and NUM_VORT.
23 std::shared_ptr<Node> n;
24 std::shared_ptr<Edge> e;
32 n.reset(
new Node(v[
i]));
33 l->Lattice::addVortex(n);
38 std::sort(
l->getVortices().begin(),
l->getVortices().end());
40 e.reset(
new Edge(
l->getVortexIdx(0),
l->getVortexIdx(1),0,0 ));
44 e.reset(
new Edge(
l->getVortexIdx(0),
l->getVortexIdx(2),0,0 ));
47 e.reset(
new Edge(
l->getVortexIdx(1),
l->getVortexIdx(2),0,0 ));
51 for (
int ii=0;
ii < 3; ++
ii){
52 std::cout <<
l->getVortices().at(
ii)<<
" ";
53 std::cout <<
l->getVortices().at(
ii)->getUid()<< std::endl;
59 std::vector< std::shared_ptr<Node> > s3;
64 for (
int ii=0;
ii < 3; ++
ii){
65 std::cout <<
l->getVortices().at(
ii)<<
" ";
66 std::cout <<
l->getVortices().at(
ii)->getUid()<< std::endl;
70 std::cout <<
a << std::endl;
182 unsigned int*
mat = (
unsigned int*) calloc(
l->getVortices().size()*
l->getVortices().size(),
sizeof(int));
end end end % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % Phase winding l
end % idx is for idx is for type for ii
% Prealloc may improve speed here end save Ek mat