Advertisement
Aldin_SXR

main() undirected

May 26th, 2020
125
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Java 1.08 KB | None | 0 0
  1. public static void main(String[] args) throws FileNotFoundException {
  2.        
  3.     /* Manually create a graph */
  4.     Graph g1 = new Graph(5);
  5.     g1.addEdge(1, 0);  
  6.     g1.addEdge(1, 2);
  7.     g1.addEdge(2, 0);
  8.     g1.addEdge(0, 3);
  9.     g1.addEdge(3, 4);
  10.        
  11.     System.out.println("Number of vertices: " + g1.V());    // 5
  12.     System.out.println("Number of edges: " + g1.E());       // 5
  13.        
  14.     /* See adjacent vertices of vertex 0 */
  15.     /* Expected: 1, 2, 3 */
  16.     System.out.println("Adjacent vertices of 0 (manual): ");
  17.     Iterable<Integer> vertices1 = g1.adj(0);
  18.     for (Integer v: vertices1) {
  19.         System.out.println(v);
  20.     }
  21.        
  22.     System.out.println();
  23.    
  24.     /* Read a graph from a file */
  25.     Graph g2 = new Graph(new Scanner(new File("/home/aldin-sxr/Downloads/tinyG.txt")));
  26.        
  27.     System.out.println("Number of vertices: " + g2.V());    // 13
  28.     System.out.println("Number of edges: " + g2.E());       // 13
  29.        
  30.     /* See adjacent vertices of vertex 0 */
  31.     /* Expected: 5, 1, 2, 6 */
  32.     System.out.println("Adjacent vertices of 0 (file): ");
  33.     Iterable<Integer> vertices2 = g2.adj(0);
  34.     for (Integer v: vertices2) {
  35.         System.out.println(v);
  36.     }
  37. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement