Skip to content

shawnlong636/Breadth-First-Search-GraphViz-C

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

20 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Shortest Path via Breadth First Search

This C++ program reads an input file detailing vertices and edges in a graph and outputs a neatly organized .dot file illustrating the shortest path from the origin to all other nodes.

Key Features

  • Descriptive tooltips on vertices and edges
  • Uniform radial graph Layout
  • Coloring to reflect distance from origin
  • Hyperlink via Subgraph

Input File Formatting

Your input.txt file should be formatting as follows:

  1. Line 1: No. of Vertices (Integer)
  2. Line 2: No. of Edges (Integer)
  3. Vertices: One line for each Vertex Name (String)
  4. Edges: One line for each edge, consisting of a vertex followed by a space, and then the second vertex

Compiling the Output File

This program utilizes the circo layout for GraphViz dot files. Because of this, the output file will must be run from a web compiler that supports additional GraphViz layouts. I recommend using GraphViz Online.

Built With

Author

Acknowledgments

This program was assigned for CS14: Data Structures and Algorithms at UCR, instructed by Professor Rusich with teaching assistance from Quazi Mishkatul Alam. All code in this repository is composed of my original work and the files provided by the instructor for the assignment.

Copyright © 2020 ShawnLong636

About

UCR CS 14 Assignment 15: Breadth First Search of a Graph

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages