GitHub - cheryl06/Optimization-Algorithm: 1.Representing a graph by an adjacency matrix using a two-dimensional array.2.Representing a graph by an adjacency list using a linked list.3. Representing a graph by an adjacency matrix using a one-dimensional array for storing only the elements of the lower triangle in the adjacency matrix

cheryl06 / Optimization-Algorithm Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

1.Representing a graph by an adjacency matrix using a two-dimensional array.2.Representing a graph by an adjacency list using a linked list.3. Representing a graph by an adjacency matrix using a one-dimensional array for storing only the elements of the lower triangle in the adjacency matrix

0 stars 0 forks Branches Tags Activity

Star

Notifications

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 1 Commit
ReadMe.txt		ReadMe.txt
q1_dijkstra.c		q1_dijkstra.c
q1_floyd.c		q1_floyd.c
q2_dijkstra.c		q2_dijkstra.c
q2_floyd.c		q2_floyd.c
q3_dijkstra.c		q3_dijkstra.c
q3_floyd.c		q3_floyd.c

Repository files navigation

1. In q1_dijkstra.c - Node 1-> 1
2. In q2_dijkstra.c - Node 1-> 0 
3. In q3_dijkstra.c - Node 1-> 1
4. In q1_floyd.c    - Node 1-> 0
5. In q2_floyd.c    - Node 1-> 0
6. In q3_floyd.c    - Node 1-> 0