Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- public Graph DFSNodes(Node n, int besokt){
- int i = 0;
- Node[] nodene = new Node[besokt];
- n.visit();
- for(Node l: n.getNeighbors()){
- if(l.isVisited() == false){
- nodene[i] = l;
- i++;
- DFSNodes(l,besokt);
- }
- }
- Graph grafen = new Graph(nodene);
- return grafen;
- }
- public Graph biggestComponent() {
- Node tempNode;
- Node bigNode = null;
- int count = 0;
- int tempBesokt = 0;
- int bigBesokt = 0;
- System.out.println("Nå kjører biggestComponent");
- for(Node n: nodes){
- if(n.isVisited() == false){
- tempNode = n;
- //antSKomp++;
- DFS(n);
- for(Node f: nodes){
- if(f.isVisited() == true){
- count++;
- }
- }
- tempBesokt = count - tempBesokt;
- if(tempBesokt > bigBesokt){
- bigBesokt = tempBesokt;
- bigNode = tempNode;
- tempBesokt = 0;
- }
- }
- }
- for(Node n: nodes){
- if(n.isVisited() == true){
- n.isVisited() = false;
- }
- }
- return DFSNodes(bigNode, bigBesokt);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement