This application aims to create adjacency matrix that represent direct graphs with and without labels.
The application was developed in Java, a pre-release is available here, on Github.
Type:
To create a labeled graph.
graphg >> CREATE WITH_LABELTo create a not labeled graph.
graphg >> CREATE NO_LABELTo create a not labeled graph undirected.
graphg >> CREATE NO_LABEL_UNDIRECTED(just work with NO_LABEL and NO_LABEL_UNDIRECTED graphs)
Type:
to implement a vertex
graphg >> ADD VERTEX VERTEX1to implement a edge
graphg >> ADD EDGE VERTEX1 VERTEX2(just work with WITH_LABEL graphs)
Type:
to implement a vertex
graphg >> ADD VERTEX LABELto implement a edge
graphg >> ADD EDGE VERTEX1 VERTEX2 LABEL(just work with NO_LABEL_UNDIRECTED graphs)
Type:
to show all cycles in graph with any size
graphg >> COUNT CYCLESto show all cycles in graph with specific size
graphg >> COUNT CYCLES 4Type:
to print graph in display
graphg >> PRINTType:
to segment the background/foreground of an image using network flow graph and min cut
graphg >> PGM /origin_source /destiny_source.to segment the background/foreground of an image using imperative method
graphg >> PGMALT /origin_source /destiny_sourceimage background/foreground segmentation demo - runs the two methods above in an example image
graphg >> PGMDEMO