Package core.Graphs

Examples of core.Graphs.Graph

52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
//                }
//            }

//                long generatingGraphStartTime = System.nanoTime();
                GraphGenerator generator = new RandomIntervalGraphGenerator();
                Graph graph = (Graph) generator.generate(num);
//                long generatingGraphEndTime = System.nanoTime() - generatingGraphStartTime;
//            System.out.println("Generation graph time is - " + generatingGraphEndTime);
//
////            Graph graph = new Graph(a);
//            System.out.println("The matrix is:");
//            printMatrix(graph.getAdjacencyMatrix());
//            System.out.println();
//
//            long startTime = System.nanoTime();
//            System.out.println("Corresponding perfect elimination ordering is:");
//            long findingOrderStartTime = System.nanoTime();
                graph.findOrder();
//            long findingOrderEndTime = System.nanoTime() - findingOrderStartTime;
//            System.out.println("Finding order time is - " + findingOrderEndTime);
//
//            for (Vertex v : graph.getOrder()) {
//                System.out.print(v.getNumber() + " ");
//            }
//            System.out.println();
//            System.out.println();
//
//            long findingChordalityStartTime = System.nanoTime();
                graph.setChordal(graph.checkChordality());
//            long findingChordalityEndTime = System.nanoTime() - findingChordalityStartTime;
//            System.out.println("Finding chordality time is - " + findingChordalityEndTime);
//            System.out.println("Vertex properties are (RN(x) and parent(x)):");
//            for (int i = 0; i < graph.getVertices().size(); i++) {
//                System.out.print("RN" + "(" + i + "):");
//                System.out.print(graph.getVertices().get(i).getRightNeighbours() + "\t\t");
//                System.out.print("parent" + "(" + i + "):");
//                System.out.print(graph.getVertices().get(i).getParent() + "\t\t");
//                System.out.println();
//            }
//            System.out.println();
//            System.out.println();
//
//            System.out.print("Is graph chordal? ");
//            System.out.println(graph.isChordal());
                if (!graph.isChordal()) {
//                throw new IllegalStateException("GRAPH IS NOT CHORDAL");
                }
//            System.out.println();
//            System.out.println();

                if (graph.isChordal() == true) {
//                System.out.println("Corresponding cliques are:");
//                long cliqueTreeStartTime = System.nanoTime();
                    CliqueTree nodeCliqueTree = graph.findCliqueTree();
//                long cliqueTreeEndTime = System.nanoTime() - cliqueTreeStartTime;
//                System.out.println("Finding clique tree time is - " + cliqueTreeEndTime);
//                System.out.println(nodeCliqueTree.toString());
//                System.out.println();
//                long findingIntervalityStartTime = System.nanoTime();
                    List<Node> cliqueChain = graph.getIntervals(nodeCliqueTree);
//                long findingIntervalityEndTime = System.nanoTime() - findingIntervalityStartTime;
//                System.out.println("Finding intervality time is - " + findingIntervalityEndTime);
//
//                System.out.println("Graph's intervals: ");
//                for (Node interval : intervals) {
//                    System.out.println(interval.toString());
//                }
//                System.out.print("Is graph interval? ");
//                System.out.println(graph.isInterval());
                    if (!graph.isInterval()) {
                    throw new IllegalStateException("GRAPH IS NOT INTERVAL");
                    }
                }

                if (!graph.isInterval() && !graph.isChordal()) {
                    plainGrpahs++;
                }
                if (graph.isInterval()) {
                    intervalGrpahs++;
                }
                if (graph.isChordal() && !graph.isInterval()) {
                    chordalGrpahs++;
                }

//            fileWriter.append(new Long(System.nanoTime() - startTime).toString() + "\n");
View Full Code Here
35
36
37
38
39
40
41
                adjacencyMatrix[jIndex][i] = 1;
            }
            adjacencyMatrix[i][i] = 0;
        }

        return new Graph(adjacencyMatrix);
    }
View Full Code Here
25
26
27
28
29
30
31
                }
            }
            adjacencyMatrix[i][i] = 0;
        }

        return new Graph(adjacencyMatrix);
    }
View Full Code Here
15
16
17
18
19
20
21
                adjacencyMatrix[i][j] = 0;
            }
            adjacencyMatrix[i][i] = 0;
        }

        return new Graph(adjacencyMatrix);
    }
View Full Code Here
52
53
54
55
56
57
58
                }
            }
            adjacencyMatrix[i][i] = 0;
        }

        return new Graph(adjacencyMatrix);
    }
View Full Code Here
20
21
22
23
24
25
26
                adjacencyMatrix[i][j] = 1;
            }
            adjacencyMatrix[i][i] = 0;
        }

        return new Graph(adjacencyMatrix);
    }
View Full Code Here
50
51
52
53
54
55
56
                adjacencyMatrix[nIndex][m] = 1;
            }
            adjacencyMatrix[m][m] = 0;
        }

        return new Graph(adjacencyMatrix);
    }
View Full Code Here
TOP

Related Classes of core.Graphs.Graph

  • core.Trees.CliqueTree
  • core.Trees.Node
  • main.Main
  • util.CircleGraphGenerator
  • util.CompleteGraphGenerator
  • util.mOnGraphGenerator
  • util.NotConnectedGraphGenerator
  • util.RandomGraphGenerator
  • util.RandomIntervalGraphGenerator
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.