Skip to content

Minimal Cycle Basis calculation for Weighted Undirected Graphs (greedy approach)

License

Notifications You must be signed in to change notification settings

mitxael/mcb-greedy

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

23 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

***************************************************************************************
* Abstract:   Determine Minimal Cycle Basis of an imported Graph
* Uses:       This library has been compiled using Matlab R2017b
* Author:     Michael Vasquez Otazu
* Email:      [email protected]
* History:    V1.0 - First release
* Description:
*             - This project is a library developed in Matlab to calculate the 
                Minimal Cycle Basis of a Graph.
              - The graph is imported from a text file containing in the first two lines 
                the number of nodes and vertices and in the following lines one edge 
                featuring: sourceVertex destinationVertex weight
              - The library include the calculation of the Minimum Spanning Tree (MST)
              - A custom plot function has been included to display the graph and the MST
********************************* START LICENSE BLOCK *********************************
* The MIT License (MIT)
* Copyright (C) 2017 Michael Vasquez Otazu
*
* Permission is hereby granted, free of charge, to any person obtaining a copy of this 
* software and associated documentation files (the "Software"), to deal in the Software 
* without restriction, including without limitation the rights to use, copy, modify, merge, 
* publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons 
* to whom the Software is furnished to do so, subject to the following conditions:
* 
* The above Copyright notice and this Permission Notice shall be included in all copies 
* or substantial portions of the Software.
********************************** END LICENSE BLOCK **********************************