Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- public class Grid {
- int nH, nL, nh, nE;
- double H, L;
- Node node[];
- Element element[];
- void genGrid(){
- int avoidElement = 1; //nie tworzymy elementów co nH
- for(int i=0;i<element.length;i++){
- if(i==avoidElement*nH-avoidElement)avoidElement++;
- element[i]= new Element(i+avoidElement,nH);
- }
- for(int i=0;i<node.length;i++){
- node[i]=new Node();
- }
- double delX = H/(nH-1);
- double delY = L/(nL-1);
- double x = 0, y = 0;
- int counter = 0;
- for(int i=1;i<=nL;i++){
- for(int j=0;j<nH;j++){
- node[counter].x=x;
- node[counter].y=y;
- y+=delY;
- counter++;
- }
- y=0;
- x+=delX;
- }
- }
- void printGrid(){
- for(int i=0;i<element.length;i++){
- System.out.printf("Dla elementu " + i + " "); element[i].printElement();
- }
- for(int i=0;i<node.length;++i){
- System.out.printf("Wspolrzedne wezla " + i + ": "); node[i].printNode();
- }
- }
- public Grid(int nH, int nL, double H, double L) {
- this.nH = nH;
- this.nL = nL;
- this.nh = nH * nL;
- this.nE = (nL - 1) * (nH - 1);
- this.H = H;
- this.L = L;
- this.node = new Node[nh];
- this.element = new Element[nE];
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement