As I've already indicated, there is a "Graph" component that never got traction: https://commons.apache.org/sandbox/commons-graph/
Please have a look and if you want to revive it, you should make a proposal starting from that (even if just to expose shortcomings which you may have identified and which you'd propose to fix). Le ven. 14 juil. 2023 à 01:35, Dimitrios Efthymiou <efthymiou.dimitri...@gmail.com> a écrit : > > getOrder(Graph graph) > > > getAllPossibleEdges(Graph graph) > > > getAllPossibleEdgesBetween(Graph graph, Graph other) > > > isTrivial(Graph graph) > > > areAdjacent(Graph graph, Vertex v1, Vertex v2) > > > isComplete(Graph graph) > > > getUnion(Graph graph, Graph other) > > > getIntersection(Graph graph, Graph other) > > > isDisjointWith(Graph graph, Graph other) > > > isSubgraphOf(Graph graph, Graph other) > > > isSupergraphOf(Graph graph, Graph other) > > > contains(Graph graph, Graph other) > > > isInducedSubgraphOf(Graph graph, Graph other) > > > doesGraphInduce(Graph graph, Graph other) > > > doesGraphSpan(Graph graph, Graph other) > > > isSpanningSubgraphOf(Graph graph, Graph other) > > > subtract(Graph graph, Vertex[] verticesToDelete) > > > subtractEdges(Graph graph, Edge[] edgesToDelete) > > > getComplement(Graph graph) > > > joinVerticesToVerticesOf(Graph graph, Graph other) > > > getNeighbourVerticesOf(Graph graph, Vertex vertex) > > > getNeighbourEdgesOf(Graph graph, Vertex vertex) > > > getNeighbourhoodOf(Graph graph, Vertex vertex) > > > getDegreeOf(Graph graph, Vertex vertex) > > > isVertexIsolated(Graph graph, Vertex vertex) > > > getDegrees(Graph graph) > > > getIndegrees(Graph graph) > > > getOutdegrees(Graph graph) > > > getIndegreeOf(Graph graph, Vertex vertex) > > > getOutdegreeOf(Graph graph, Vertex vertex) > > > getMinimumDegree(Graph graph) > > > getMinimumIndegree(Graph graph) > > > getMinimumOutdegree(Graph graph) > > > getMaximumDegree(Graph graph) > > > getMaximumIndegree(Graph graph) > > > getMaximumOutdegree(Graph graph) > > > getAverageDegree(Graph graph) > > > getAverageIndegree(Graph graph) > > > getAverageOutdegree(Graph graph) > > > isRegular(Graph graph) > > > containsVertex(Graph graph, Vertex vertex) > > > containsEdge(Graph graph, Edge edge) > > > getEdgesThatIncludeVertex(Graph graph, Vertex vertex) > > > getEdgesThatIncludeVertexAsFirst(Graph graph, Vertex vertex) > > > getEdgesThatIncludeVertexAsSecond(Graph graph, Vertex vertex) > > > getCycles(Graph graph) > > > getGirth(Graph graph) > > > getCircumference(Graph graph) > > > getPathsBetween(Graph graph, Vertex v1, Vertex v2) > > > getNumberOfPathsBetween(Graph graph, Vertex v1, Vertex v2) > > > getDistanceBetween(Graph graph, Vertex v1, Vertex v2) > > > getLargestDistanceBetween(Graph graph, Vertex v1, Vertex v2) > > > getDiameter(Graph graph) > > > get2VerticesWithDistance(Graph graph, ANumber distance) > > > get2VerticesWithDistanceAtLeast(Graph graph, ANumber distance) > > > get2VerticesWithDistanceLessThan(Graph graph, ANumber distance) > > > get2VerticesWithDistanceLessThanOrEqualTo(Graph graph, ANumber distance) > > > getEccentricityOfVertex(Graph graph, Vertex vertex) > > > getCentralVertices(Graph graph) > > > isVertexCentral(Graph graph, Vertex vertex) > > > getRadius(Graph graph) > > > getVerticesWithGivenDistanceFromVertex(Graph graph, ANumber distance, > Vertex vertex) > > > getVerticesWithDistanceFromVertexLessThanGivenDistance(Graph graph, ANumber > distance, Vertex vertex) > > > getVerticesWithDistanceFromVertexLessThanOrEqualToGivenDistance(Graph > graph, ANumber distance, Vertex vertex) > > > getVerticesWithDistanceFromVertexGreaterThanGivenDistance(Graph graph, > ANumber distance, Vertex vertex) > > > getVerticesWithDistanceFromVertexGreaterThanOrEqualToGivenDistance(Graph > graph, ANumber distance, Vertex vertex) > > > isTherePathBetween(Graph graph, Vertex v1, Vertex v2) > > > isConnected(Graph graph) > isKConnected(Graph graph, ANumber k) > > > isComponent(Graph graph, Graph subgraph) > > > getAllPossibleSubgraphs(Graph graph) > > > getComponents(Graph graph) > > > isCutvertex(Graph graph, Graph component, Vertex vertex) > getCutvertices(Graph graph) > > > isBridge(Graph graph, Graph component, Edge edge) > getBridges(Graph graph) > > > getConnectivity(Graph graph) > getEdgeConnectivity(Graph graph) > > > isLEdgeConnected(Graph graph, ANumber l) > > > getNumberOfCycles(Graph graph) > isAcyclic(Graph graph) > > > isForest(Graph graph) > isTree(Graph graph) > isBipartite(Graph graph) > isEulerian(Graph graph) > isSimpleGraph(Graph graph) > isMultigraph(Graph graph) > isPseudograph(Graph graph) > > > contractEdge(Graph graph, Edge edge) > > > doEdgesBelongToCycleSpace(Graph graph, OrionSet<Edge> edges) > > > getDimensionsOfCycleSpace(Graph graph) > getDimensionsOfCutSpace(Graph graph) > > > getNumberOfEdgesThatInclude(Graph graph, Vertex v1, Vertex v2) > > > areAdjacentByMultipleEdges(Graph graph, Vertex v1, Vertex v2) > > > getEdgesThatInclude(Graph graph, Vertex v1, Vertex v2) > > > getNumberOfLoops(Graph graph) > getLoops(Graph graph) > > > getNumberOfMultipleEdges(Graph graph) > > > getRandomVertex(Graph graph) > getNonisolatedRandomVertex(Graph graph) > getIsolatedVertices(Graph graph) > > > doDepthFirstTraversal(Graph graph, Consumer<Vertex> action) > doBreadthFirstTraversal(Graph graph, Consumer<Vertex> action) > > > areEdgesIndependent(Graph graph, OrionSet<Edge> edges) > areVerticesIndependent(Graph graph, OrionSet<Vertex> vertices) > > > isAMatching(Graph graph, OrionSet<Edge> edges) > isPerfectMatching(Graph graph, OrionSet<Edge> edges) > getMatchingNumber(Graph graph) > isAMatchingOfVertices(Graph graph, OrionSet<Edge> edges, OrionSet<Vertex> > vertices) > areVerticesMatchedByEdges(Graph graph, OrionSet<Vertex> vertices, > OrionSet<Edge> edges) > > > areVerticesACover(Graph graph, OrionSet<Vertex> vertices) > isPathCover(Graph graph, OrionSet<Path> paths) > > > > > doesPathBelongToGraph(Graph graph, Path path) > > > getMultiplicityOfEdge(Graph graph, Edge edge) > > > isVertexPendant(Graph graph, Vertex vertex) > > > getWheel(Graph graph, Path cycle, Vertex vertex) > > > getSequenceOfDegrees(Graph graph) > isSequenceOfDegreesGraphic(Graph graph) > > > getAdjacencyList(Graph graph) > getAdjacencyMatrix(Graph graph) > getIncidenceMatrix(Graph graph) > areVerticesAdjacent(Graph graph, Vertex v1, Vertex v2) > > > isGraphIsomorphicTo(Graph graph, Graph other) > > > isSelfComplementary(Graph graph) > > > isHamiltonPath(Graph graph, Path path) > doesGraphHaveAHamiltonCircuit(Graph graph) > > > isWeightedGraph(Graph graph) > > > getShortestPathBetween2VerticesOnWeightedGraph(Graph graph, Vertex v1, > Vertex v2) > getLengthOfShortestPathBetween2VerticesForSimpleConnectedWeightedGraph(Graph > graph, Vertex v1, Vertex v2) > > > getNumberOfRegionsForPlanarRepresentation(Graph graph) > > > getNumberOfProperColorings(Graph graph, int numberOfColors) > > > getLeaves(Tree tree) > getNumberOfLeaves(Tree tree) > > > isTrivial(Tree tree) > > > getRoot(Tree tree) > isRoot(Tree tree, Vertex root) > isLeaf(Tree tree, Vertex vertex) > > > isComparable(Tree tree) > > > getImmediateParentOf(Tree tree, Vertex vertex) > getChildrenOf(Tree tree, Vertex vertex) > getSiblingsOf(Tree tree, Vertex vertex) > getAncestorsOf(Tree tree, Vertex vertex) > getDescendantsOf(Tree tree, Vertex vertex) > > > getEdgeIncidentAtVertex(Tree tree, Vertex vertex) > > > getSubtreeWithRoot(Tree tree, Vertex newRoot) > > > isBinaryTree(Tree tree) > isBalanced(Tree tree) > isMAryTree(Tree tree, int m) > isCompleteMAryTree(Tree tree, int m) > > > subtractEdge(Tree tree, Edge edgeToDelete) > > > getHeight(Tree tree) > getHeightOfVertex(Tree tree, Vertex vertex) --------------------------------------------------------------------- To unsubscribe, e-mail: dev-unsubscr...@commons.apache.org For additional commands, e-mail: dev-h...@commons.apache.org