https://github.com/mlziade/graph_java
Graph structure, wich can create graphs, add in nodes, add in connections and verify if they are SIMPLE, REGULAR, BIPARTITE or COMPLETE
https://github.com/mlziade/graph_java
Last synced: 6 months ago
JSON representation
Graph structure, wich can create graphs, add in nodes, add in connections and verify if they are SIMPLE, REGULAR, BIPARTITE or COMPLETE
- Host: GitHub
- URL: https://github.com/mlziade/graph_java
- Owner: mlziade
- Created: 2021-03-19T14:44:51.000Z (almost 5 years ago)
- Default Branch: main
- Last Pushed: 2021-03-22T22:34:56.000Z (almost 5 years ago)
- Last Synced: 2025-03-31T18:46:01.727Z (10 months ago)
- Language: Java
- Homepage:
- Size: 140 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Graph_Java
Graph structure, wich can create graphs, add in nodes, add in connections and verify if they are SIMPLE, REGULAR, BIPARTITE or COMPLETE.
Graph inputs are done throug a linked list of all of the nodes, as well as a linked list of neighbors nodes for each node.
A regular graph has the same number of neighbors for all of nodes.
In a complete graph for each vertex of the graph, exists a connection to all of the the remaining nodes.
In a bipartite graph there are 2 groups of nodes, in wich two nodes of the same group can't be connected.
Simple graphs are neither of the above.