- save(Graph<?, ?>, String) - Static method in interface berack96.lib.graph.Graph
-
Save the Graph passed as input to a file inserted as parameter.
The resulting file is a Json string representing all the graph.
If the directory for getting through the file do not exist,
then it is created.
For now the marks are not included.
- save(Graph<?, ?>, String, String) - Static method in interface berack96.lib.graph.Graph
-
Save the Graph passed as input to a file inserted as parameter.
The resulting file is a Json string representing all the graph.
If the directory for getting through the file do not exist,
then it is created.
For now the marks are not included.
The additional parameter is used if you want to save other as well as the graph.
- save(String) - Method in class berack96.lib.graph.view.GraphPanel
-
- setBounds(int, int, int, int) - Method in class berack96.lib.graph.view.GraphPanel
-
- setGraphListener(GraphListener) - Method in class berack96.lib.graph.view.GraphPanel
-
- source - Variable in class berack96.lib.graph.view.edge.EdgeComponent
-
- src - Variable in class berack96.lib.graph.models.EdgeSaveStructure
-
- stronglyConnectedComponents() - Method in interface berack96.lib.graph.Graph
-
The strongly connected components or disconnected components of an arbitrary directed graph
form a partition into subgraphs that are themselves strongly connected.
- stronglyConnectedComponents() - Method in class berack96.lib.graph.impl.AdjGraph
-
- stronglyConnectedComponents() - Method in class berack96.lib.graph.impl.MapGraph
-
- stronglyConnectedComponents() - Method in class berack96.lib.graph.impl.MatrixGraph
-
- subGraph(V, int) - Method in interface berack96.lib.graph.Graph
-
Get a sub-graph of the current one based on the maximum depth that is given.
If the depth is 1 then only the source and it's children will be in the sub-graph.
If the depth is 2 then only the source, it's children and it's children of it's children will be in the sub-graph.
And so on.
Of course the sub-graph will contain the edges that link the vertices, but only the one selected.
- subGraph(Object...) - Method in interface berack96.lib.graph.Graph
-
Get a sub-graph of the current one with only the vertex marked with the selected markers.
Each vertex will have all his edges, but only the ones with the destination marked with the same marker.
If the marker is not specified or is null then the returning graph will have all the vertices that are not marked by any marker.
If the graph doesn't contain any vertex with that marker then an empty graph is returned.
- subGraph(V, int) - Method in class berack96.lib.graph.impl.AdjGraph
-
- subGraph(Object...) - Method in class berack96.lib.graph.impl.AdjGraph
-
- subGraph(V, int) - Method in class berack96.lib.graph.impl.MapGraph
-
- subGraph(Object...) - Method in class berack96.lib.graph.impl.MapGraph
-
- subGraph(V, int) - Method in class berack96.lib.graph.impl.MatrixGraph
-
- subGraph(Object...) - Method in class berack96.lib.graph.impl.MatrixGraph
-