Lab 4 implementation of Tree Traversal (iteratively and recursively), Dijkstra algorithm and Graph Coloring algorithm.
-
Updated
Dec 27, 2023 - Java
Lab 4 implementation of Tree Traversal (iteratively and recursively), Dijkstra algorithm and Graph Coloring algorithm.
olutions for the CSE1120 Discrete Structures course project (Spring 2022-2023). Includes Java implementations for mathematical proofs, Lucas numbers, and least airfare routes.
This Java program allows you to manipulate different types of trees and perform various operations on them. You can use this project to learn how to implement binary trees, binary insertion trees and B-Trees manually. Topics
1st Discrete Structures lab as an application on Sets Theory and Bits Manipulation using Java programming language.
2nd Discrete Structures lab as an application on Sets and Rules of Inference using Java programming Lnaguage
The following projects are a part of my coursework towards B.Sc. in Computer Science at University of Illinois Springfield.
3rd Discrete Structures lab as an application on prime numbers using Java programming language.
Add a description, image, and links to the discrete-structures topic page so that developers can more easily learn about it.
To associate your repository with the discrete-structures topic, visit your repo's landing page and select "manage topics."