Package org.openjgraph.model

Examples of org.openjgraph.model.Graph.addVertex()

49
50
51
52
53
54
55
56
57
58
59
        }

        BudgetGraphComparator comparator = new BudgetGraphComparator();
        Graph solvedGraph = new AdjacencyMatrixDirectedGraph(graph.getVertexSet().size());
        for( Vertex v : graph.getVertexSet()) {
            solvedGraph.addVertex(v.getId());
        }

        while( (!positivesDegree.isEmpty()) && (!negativesDegree.isEmpty())) {

            // on tri les deux listes de vertex
View Full Code Here
78
79
80
81
82
83
84
85
86
87
88
                    positivesDegree.remove(maxPosV);
                    negatives.remove(maxNegV);
                    negativesDegree.remove(maxNegV);
                } catch (VertexNotFoundException e) {
                    // on ajoute le sommet manquant... un tour pour rien
                    solvedGraph.addVertex(e.getVertex());
                }

            }
            else if (posDegree + negDegree > 0) {
                try {
View Full Code Here
91
92
93
94
95
96
97
98
99
100
101
                    positivesDegree.put(maxPosV, posDegree + negDegree);
                    negatives.remove(maxNegV);
                    negativesDegree.remove(maxNegV);
                } catch (VertexNotFoundException e) {
                    // on ajoute le sommet manquant... un tour pour rien
                    solvedGraph.addVertex(e.getVertex());
                }
            }
            else {
                try {
                    solvedGraph.addEdge(maxPosV.getId(), maxNegV.getId(), posDegree);
View Full Code Here
104
105
106
107
108
109
110
111
112
113
114
                    negativesDegree.remove(maxNegV);
                    negativesDegree.put(maxNegV, posDegree + negDegree);

                } catch ( VertexNotFoundException e) {
                    // on ajoute le sommet manquant... un tour pour rien
                    solvedGraph.addVertex(e.getVertex());
                }
            }
        }

View Full Code Here
121
122
123
124
125
126
127
128
129
130
131
     * @return
     */
    public Graph createBudgetGraph(Budget budget) {
        Graph graph = graphFactory.create(true);
        for (Person person : budget.getPersons()) {
            graph.addVertex(person.getId());
        }

        Map<String, Map<String, Float>> expenditureMatrix = new HashMap<String, Map<String, Float>>();
        for (Expenditure ex : budget.getExpenditures()) {
            float value = 0;
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. 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.