note description: "Tests for COMPARABLE_GRAPH" author: "Connor" date: "$Date$" revision: "$Revision$" class interface TEST_GRAPH_CONNOR create make feature -- Initialization make feature -- Basic Creation, Operation, and Query Testing t0: BOOLEAN t1: BOOLEAN -- Edge & Vertex Extension t2: BOOLEAN -- Integer Edge & Vertex Removal t3: BOOLEAN -- String Edge & Vertex Removal t4: BOOLEAN -- VERTEX Edge & Vertex Removal t5: BOOLEAN -- has_vertex, has_edge test t6: BOOLEAN -- outgoing & incoming for Integer t7: BOOLEAN -- outgoing & incoming for String t8: BOOLEAN -- outgoing & incoming for vertex t9: BOOLEAN -- adjacent for Integer t10: BOOLEAN -- adjacent for String t11: BOOLEAN -- adjacent for vertex feature -- Advanced Query Testing t19: BOOLEAN t20: BOOLEAN t21: BOOLEAN t22: BOOLEAN -- reachable & is_reachable INTEGER t23: BOOLEAN -- reachable & is_reachable STRING t24: BOOLEAN -- reachable & is_reachable VERTEX t25: BOOLEAN -- paths, shortest_path, shortest_path_via_dijkstra - INTEGER t26: BOOLEAN -- paths, shortest_path, shortest_path_via_dijkstra - STRING t27: BOOLEAN -- paths, shortest_path, shortest_path_via_dijkstra - Vertex t28: BOOLEAN -- SP Via Dijkstra - INTEGER t29: BOOLEAN -- SP Via Dijkstra - STRING t30: BOOLEAN -- SP Via Dijkstra - VERTEX t31: BOOLEAN -- is_valid_path - INTEGER t32: BOOLEAN -- is_valid_path - String t33: BOOLEAN -- is_valid_path - Vertex t34: BOOLEAN -- is_subgraph - Integer t35: BOOLEAN -- is_subgraph - String t36: BOOLEAN -- is_subgraph - Vertex t37: BOOLEAN -- cycle - Integer t38: BOOLEAN -- cycle STRING t39: BOOLEAN -- cycle VERTEX t40: BOOLEAN -- is_equal INTEGER t41: BOOLEAN -- is_equal STRING t42: BOOLEAN -- is_equal VERTEX t43: BOOLEAN -- is_acyclic - INTEGER t44: BOOLEAN -- is_acyclic - STRING t45: BOOLEAN -- is_acyclic - VERTEX feature -- Violation Cases t100 -- Illegal Edge Extension t101 t102 t103 t104 t105 t106 t107 t108 end -- class TEST_GRAPH_CONNOR
Generated by ISE EiffelStudio